/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:40:53,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:40:53,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:40:53,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:40:53,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:40:53,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:40:53,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:40:53,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:40:53,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:40:53,815 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:40:53,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:40:53,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:40:53,817 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:40:53,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:40:53,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:40:53,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:40:53,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:40:53,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:40:53,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:40:53,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:40:53,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:40:53,827 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:40:53,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:40:53,829 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:40:53,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:40:53,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:40:53,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:40:53,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:40:53,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:40:53,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:40:53,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:40:53,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:40:53,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:40:53,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:40:53,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:40:53,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:40:53,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:40:53,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:40:53,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:40:53,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:40:53,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:40:53,840 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:40:53,854 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:40:53,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:40:53,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:40:53,856 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:40:53,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:40:53,856 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:40:53,856 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:40:53,857 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:40:53,857 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:40:53,857 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:40:53,857 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:40:53,857 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:40:53,858 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:40:53,858 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:40:53,858 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:40:53,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:40:53,858 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:40:53,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:40:53,859 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:40:53,859 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:40:53,859 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:40:53,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:40:53,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:40:53,860 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:40:53,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:40:53,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:40:53,860 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:40:53,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:40:53,860 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:40:54,023 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:40:54,037 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:40:54,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:40:54,042 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:40:54,042 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:40:54,043 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:40:54,143 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_GIveBs/tmp/addb13fae5544fe5bc8ad077de9b0de0/FLAG67e006e8d [2020-07-01 12:40:54,476 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:40:54,477 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:40:54,477 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:40:54,484 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_GIveBs/tmp/addb13fae5544fe5bc8ad077de9b0de0/FLAG67e006e8d [2020-07-01 12:40:54,881 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_GIveBs/tmp/addb13fae5544fe5bc8ad077de9b0de0 [2020-07-01 12:40:54,892 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:40:54,894 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:40:54,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:40:54,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:40:54,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:40:54,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:40:54" (1/1) ... [2020-07-01 12:40:54,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be702a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:54, skipping insertion in model container [2020-07-01 12:40:54,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:40:54" (1/1) ... [2020-07-01 12:40:54,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:40:54,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:40:55,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:40:55,181 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:40:55,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:40:55,215 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:40:55,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:55 WrapperNode [2020-07-01 12:40:55,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:40:55,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:40:55,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:40:55,217 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:40:55,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:55" (1/1) ... [2020-07-01 12:40:55,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:55" (1/1) ... [2020-07-01 12:40:55,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:40:55,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:40:55,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:40:55,260 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:40:55,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:55" (1/1) ... [2020-07-01 12:40:55,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:55" (1/1) ... [2020-07-01 12:40:55,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:55" (1/1) ... [2020-07-01 12:40:55,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:55" (1/1) ... [2020-07-01 12:40:55,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:55" (1/1) ... [2020-07-01 12:40:55,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:55" (1/1) ... [2020-07-01 12:40:55,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:55" (1/1) ... [2020-07-01 12:40:55,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:40:55,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:40:55,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:40:55,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:40:55,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:55" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:40:55,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:40:55,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:40:55,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:40:55,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:40:55,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:40:55,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:40:55,634 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:40:55,634 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:40:55,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:40:55 BoogieIcfgContainer [2020-07-01 12:40:55,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:40:55,639 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:40:55,639 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:40:55,641 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:40:55,642 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:40:55" (1/1) ... [2020-07-01 12:40:55,657 INFO L313 BlockEncoder]: Initial Icfg 36 locations, 40 edges [2020-07-01 12:40:55,658 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:40:55,659 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:40:55,660 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:40:55,660 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:40:55,662 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:40:55,663 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:40:55,663 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:40:55,688 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:40:55,719 INFO L200 BlockEncoder]: SBE split 17 edges [2020-07-01 12:40:55,724 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:40:55,725 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:40:55,758 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 12:40:55,761 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-07-01 12:40:55,762 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:40:55,762 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:40:55,763 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:40:55,763 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:40:55,764 INFO L313 BlockEncoder]: Encoded RCFG 27 locations, 48 edges [2020-07-01 12:40:55,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:40:55 BasicIcfg [2020-07-01 12:40:55,764 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:40:55,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:40:55,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:40:55,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:40:55,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:40:54" (1/4) ... [2020-07-01 12:40:55,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366cf244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:40:55, skipping insertion in model container [2020-07-01 12:40:55,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:55" (2/4) ... [2020-07-01 12:40:55,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366cf244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:40:55, skipping insertion in model container [2020-07-01 12:40:55,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:40:55" (3/4) ... [2020-07-01 12:40:55,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366cf244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:40:55, skipping insertion in model container [2020-07-01 12:40:55,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:40:55" (4/4) ... [2020-07-01 12:40:55,773 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:40:55,784 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:40:55,791 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-07-01 12:40:55,805 INFO L251 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-07-01 12:40:55,828 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:40:55,828 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:40:55,829 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:40:55,829 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:40:55,829 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:40:55,829 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:40:55,829 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:40:55,829 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:40:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-01 12:40:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:40:55,850 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:55,851 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:40:55,851 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:55,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:55,857 INFO L82 PathProgramCache]: Analyzing trace with hash 177628423, now seen corresponding path program 1 times [2020-07-01 12:40:55,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:55,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813095890] [2020-07-01 12:40:55,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:56,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813095890] [2020-07-01 12:40:56,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:56,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:40:56,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639418546] [2020-07-01 12:40:56,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:40:56,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:56,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:40:56,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:40:56,052 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2020-07-01 12:40:56,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:56,161 INFO L93 Difference]: Finished difference Result 50 states and 87 transitions. [2020-07-01 12:40:56,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:40:56,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:40:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:56,175 INFO L225 Difference]: With dead ends: 50 [2020-07-01 12:40:56,176 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:40:56,179 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:40:56,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:40:56,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:40:56,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:40:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 45 transitions. [2020-07-01 12:40:56,216 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 45 transitions. Word has length 5 [2020-07-01 12:40:56,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:56,217 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 45 transitions. [2020-07-01 12:40:56,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:40:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 45 transitions. [2020-07-01 12:40:56,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:40:56,218 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:56,218 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:40:56,219 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:40:56,220 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:56,220 INFO L82 PathProgramCache]: Analyzing trace with hash 177628454, now seen corresponding path program 1 times [2020-07-01 12:40:56,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:56,220 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916278254] [2020-07-01 12:40:56,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:56,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916278254] [2020-07-01 12:40:56,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:56,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:40:56,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17690419] [2020-07-01 12:40:56,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:40:56,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:56,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:40:56,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:40:56,279 INFO L87 Difference]: Start difference. First operand 27 states and 45 transitions. Second operand 3 states. [2020-07-01 12:40:56,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:56,379 INFO L93 Difference]: Finished difference Result 28 states and 45 transitions. [2020-07-01 12:40:56,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:40:56,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:40:56,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:56,381 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:40:56,381 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:40:56,382 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:40:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:40:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:40:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:40:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 44 transitions. [2020-07-01 12:40:56,387 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 44 transitions. Word has length 5 [2020-07-01 12:40:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:56,389 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 44 transitions. [2020-07-01 12:40:56,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:40:56,389 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 44 transitions. [2020-07-01 12:40:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:40:56,390 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:56,390 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:40:56,390 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:40:56,390 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:56,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:56,391 INFO L82 PathProgramCache]: Analyzing trace with hash 177628455, now seen corresponding path program 1 times [2020-07-01 12:40:56,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:56,391 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411643807] [2020-07-01 12:40:56,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:56,433 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411643807] [2020-07-01 12:40:56,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:56,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:40:56,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354792605] [2020-07-01 12:40:56,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:40:56,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:56,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:40:56,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:40:56,435 INFO L87 Difference]: Start difference. First operand 27 states and 44 transitions. Second operand 4 states. [2020-07-01 12:40:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:56,499 INFO L93 Difference]: Finished difference Result 27 states and 44 transitions. [2020-07-01 12:40:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:40:56,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 12:40:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:56,501 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:40:56,501 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:40:56,501 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:40:56,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:40:56,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 12:40:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:40:56,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 43 transitions. [2020-07-01 12:40:56,506 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 43 transitions. Word has length 5 [2020-07-01 12:40:56,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:56,506 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 43 transitions. [2020-07-01 12:40:56,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:40:56,506 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 43 transitions. [2020-07-01 12:40:56,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:40:56,507 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:56,507 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:40:56,507 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:40:56,507 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:56,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:56,508 INFO L82 PathProgramCache]: Analyzing trace with hash 177628452, now seen corresponding path program 1 times [2020-07-01 12:40:56,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:56,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225864317] [2020-07-01 12:40:56,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:56,544 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225864317] [2020-07-01 12:40:56,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:56,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:40:56,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942521135] [2020-07-01 12:40:56,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:40:56,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:56,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:40:56,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:40:56,546 INFO L87 Difference]: Start difference. First operand 26 states and 43 transitions. Second operand 3 states. [2020-07-01 12:40:56,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:56,613 INFO L93 Difference]: Finished difference Result 26 states and 43 transitions. [2020-07-01 12:40:56,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:40:56,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:40:56,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:56,614 INFO L225 Difference]: With dead ends: 26 [2020-07-01 12:40:56,615 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 12:40:56,615 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:40:56,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 12:40:56,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-01 12:40:56,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:40:56,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 41 transitions. [2020-07-01 12:40:56,619 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 41 transitions. Word has length 5 [2020-07-01 12:40:56,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:56,619 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 41 transitions. [2020-07-01 12:40:56,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:40:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 41 transitions. [2020-07-01 12:40:56,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:40:56,620 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:56,620 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:40:56,620 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:40:56,621 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:56,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:56,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1211513482, now seen corresponding path program 1 times [2020-07-01 12:40:56,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:56,622 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750425194] [2020-07-01 12:40:56,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:56,651 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750425194] [2020-07-01 12:40:56,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:56,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:40:56,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217453639] [2020-07-01 12:40:56,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:40:56,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:56,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:40:56,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:40:56,653 INFO L87 Difference]: Start difference. First operand 25 states and 41 transitions. Second operand 3 states. [2020-07-01 12:40:56,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:56,722 INFO L93 Difference]: Finished difference Result 25 states and 41 transitions. [2020-07-01 12:40:56,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:40:56,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:40:56,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:56,723 INFO L225 Difference]: With dead ends: 25 [2020-07-01 12:40:56,723 INFO L226 Difference]: Without dead ends: 24 [2020-07-01 12:40:56,724 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:40:56,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-01 12:40:56,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-01 12:40:56,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 12:40:56,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-07-01 12:40:56,727 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 6 [2020-07-01 12:40:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:56,728 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-07-01 12:40:56,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:40:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-07-01 12:40:56,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:40:56,728 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:56,728 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:40:56,729 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:40:56,729 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:56,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:56,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1211513484, now seen corresponding path program 1 times [2020-07-01 12:40:56,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:56,730 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172672213] [2020-07-01 12:40:56,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:56,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:56,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172672213] [2020-07-01 12:40:56,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:56,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:40:56,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248845633] [2020-07-01 12:40:56,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:40:56,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:56,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:40:56,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:40:56,769 INFO L87 Difference]: Start difference. First operand 24 states and 39 transitions. Second operand 4 states. [2020-07-01 12:40:56,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:56,828 INFO L93 Difference]: Finished difference Result 25 states and 39 transitions. [2020-07-01 12:40:56,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:40:56,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-01 12:40:56,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:56,830 INFO L225 Difference]: With dead ends: 25 [2020-07-01 12:40:56,830 INFO L226 Difference]: Without dead ends: 24 [2020-07-01 12:40:56,831 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:40:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-01 12:40:56,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-01 12:40:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 12:40:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2020-07-01 12:40:56,835 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 38 transitions. Word has length 6 [2020-07-01 12:40:56,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:56,836 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 38 transitions. [2020-07-01 12:40:56,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:40:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 38 transitions. [2020-07-01 12:40:56,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:40:56,836 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:56,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:40:56,837 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:40:56,837 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:56,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:56,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1211513485, now seen corresponding path program 1 times [2020-07-01 12:40:56,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:56,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469529348] [2020-07-01 12:40:56,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:56,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469529348] [2020-07-01 12:40:56,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:56,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:40:56,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452362189] [2020-07-01 12:40:56,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:40:56,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:56,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:40:56,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:40:56,876 INFO L87 Difference]: Start difference. First operand 24 states and 38 transitions. Second operand 3 states. [2020-07-01 12:40:56,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:56,937 INFO L93 Difference]: Finished difference Result 24 states and 38 transitions. [2020-07-01 12:40:56,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:40:56,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:40:56,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:56,939 INFO L225 Difference]: With dead ends: 24 [2020-07-01 12:40:56,939 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 12:40:56,939 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:40:56,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 12:40:56,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 12:40:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:40:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2020-07-01 12:40:56,943 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 37 transitions. Word has length 6 [2020-07-01 12:40:56,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:56,944 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 37 transitions. [2020-07-01 12:40:56,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:40:56,944 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 37 transitions. [2020-07-01 12:40:56,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:40:56,944 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:56,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:56,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:40:56,945 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:56,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:56,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1097786689, now seen corresponding path program 1 times [2020-07-01 12:40:56,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:56,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97910616] [2020-07-01 12:40:56,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:56,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:56,984 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97910616] [2020-07-01 12:40:56,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:56,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:40:56,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518553758] [2020-07-01 12:40:56,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:40:56,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:56,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:40:56,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:40:56,986 INFO L87 Difference]: Start difference. First operand 23 states and 37 transitions. Second operand 4 states. [2020-07-01 12:40:57,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:57,056 INFO L93 Difference]: Finished difference Result 23 states and 37 transitions. [2020-07-01 12:40:57,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:40:57,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 12:40:57,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:57,058 INFO L225 Difference]: With dead ends: 23 [2020-07-01 12:40:57,058 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 12:40:57,058 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:40:57,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 12:40:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-01 12:40:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 12:40:57,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2020-07-01 12:40:57,061 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 33 transitions. Word has length 7 [2020-07-01 12:40:57,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:57,062 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 33 transitions. [2020-07-01 12:40:57,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:40:57,062 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2020-07-01 12:40:57,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:40:57,063 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:57,063 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:57,063 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:40:57,063 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:57,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:57,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1097786687, now seen corresponding path program 1 times [2020-07-01 12:40:57,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:57,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536109581] [2020-07-01 12:40:57,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:57,101 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536109581] [2020-07-01 12:40:57,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:57,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:40:57,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992494153] [2020-07-01 12:40:57,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:40:57,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:57,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:40:57,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:40:57,103 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. Second operand 4 states. [2020-07-01 12:40:57,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:57,190 INFO L93 Difference]: Finished difference Result 34 states and 51 transitions. [2020-07-01 12:40:57,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:40:57,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 12:40:57,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:57,191 INFO L225 Difference]: With dead ends: 34 [2020-07-01 12:40:57,192 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:40:57,192 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:40:57,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:40:57,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2020-07-01 12:40:57,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:40:57,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 45 transitions. [2020-07-01 12:40:57,197 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 45 transitions. Word has length 7 [2020-07-01 12:40:57,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:57,197 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 45 transitions. [2020-07-01 12:40:57,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:40:57,198 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 45 transitions. [2020-07-01 12:40:57,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:40:57,199 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:57,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:57,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:40:57,199 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:57,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:57,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1097786686, now seen corresponding path program 1 times [2020-07-01 12:40:57,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:57,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519887744] [2020-07-01 12:40:57,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:57,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:57,260 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519887744] [2020-07-01 12:40:57,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:57,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:40:57,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925597406] [2020-07-01 12:40:57,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:40:57,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:57,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:40:57,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:40:57,262 INFO L87 Difference]: Start difference. First operand 25 states and 45 transitions. Second operand 6 states. [2020-07-01 12:40:57,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:57,390 INFO L93 Difference]: Finished difference Result 32 states and 49 transitions. [2020-07-01 12:40:57,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:40:57,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-07-01 12:40:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:57,391 INFO L225 Difference]: With dead ends: 32 [2020-07-01 12:40:57,392 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 12:40:57,392 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:40:57,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 12:40:57,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2020-07-01 12:40:57,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:40:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 43 transitions. [2020-07-01 12:40:57,397 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 43 transitions. Word has length 7 [2020-07-01 12:40:57,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:57,397 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 43 transitions. [2020-07-01 12:40:57,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:40:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 43 transitions. [2020-07-01 12:40:57,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:40:57,397 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:57,398 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:57,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:40:57,398 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:57,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:57,398 INFO L82 PathProgramCache]: Analyzing trace with hash 328351959, now seen corresponding path program 1 times [2020-07-01 12:40:57,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:57,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963540191] [2020-07-01 12:40:57,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:57,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963540191] [2020-07-01 12:40:57,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:57,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:40:57,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385859156] [2020-07-01 12:40:57,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:40:57,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:57,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:40:57,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:40:57,441 INFO L87 Difference]: Start difference. First operand 25 states and 43 transitions. Second operand 5 states. [2020-07-01 12:40:57,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:57,528 INFO L93 Difference]: Finished difference Result 28 states and 43 transitions. [2020-07-01 12:40:57,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:40:57,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-07-01 12:40:57,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:57,529 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:40:57,529 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:40:57,529 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:40:57,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:40:57,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-07-01 12:40:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:40:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 42 transitions. [2020-07-01 12:40:57,533 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 42 transitions. Word has length 8 [2020-07-01 12:40:57,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:57,533 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 42 transitions. [2020-07-01 12:40:57,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:40:57,533 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 42 transitions. [2020-07-01 12:40:57,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:40:57,534 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:57,534 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:57,534 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 12:40:57,535 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:57,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:57,535 INFO L82 PathProgramCache]: Analyzing trace with hash 328351960, now seen corresponding path program 1 times [2020-07-01 12:40:57,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:57,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516801133] [2020-07-01 12:40:57,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:57,600 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516801133] [2020-07-01 12:40:57,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:57,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:40:57,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89589420] [2020-07-01 12:40:57,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:40:57,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:57,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:40:57,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:40:57,602 INFO L87 Difference]: Start difference. First operand 25 states and 42 transitions. Second operand 6 states. [2020-07-01 12:40:57,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:57,744 INFO L93 Difference]: Finished difference Result 27 states and 42 transitions. [2020-07-01 12:40:57,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:40:57,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-07-01 12:40:57,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:57,745 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:40:57,746 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:40:57,746 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:40:57,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:40:57,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-01 12:40:57,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:40:57,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 41 transitions. [2020-07-01 12:40:57,750 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 41 transitions. Word has length 8 [2020-07-01 12:40:57,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:57,750 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 41 transitions. [2020-07-01 12:40:57,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:40:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 41 transitions. [2020-07-01 12:40:57,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:40:57,751 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:57,751 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:57,751 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 12:40:57,751 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:57,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:57,752 INFO L82 PathProgramCache]: Analyzing trace with hash 328351957, now seen corresponding path program 1 times [2020-07-01 12:40:57,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:57,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702653869] [2020-07-01 12:40:57,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:57,788 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702653869] [2020-07-01 12:40:57,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:57,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:40:57,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646452977] [2020-07-01 12:40:57,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:40:57,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:57,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:40:57,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:40:57,790 INFO L87 Difference]: Start difference. First operand 25 states and 41 transitions. Second operand 4 states. [2020-07-01 12:40:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:57,860 INFO L93 Difference]: Finished difference Result 25 states and 41 transitions. [2020-07-01 12:40:57,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:40:57,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-01 12:40:57,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:57,862 INFO L225 Difference]: With dead ends: 25 [2020-07-01 12:40:57,862 INFO L226 Difference]: Without dead ends: 24 [2020-07-01 12:40:57,862 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:40:57,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-01 12:40:57,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-01 12:40:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 12:40:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2020-07-01 12:40:57,866 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 8 [2020-07-01 12:40:57,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:57,866 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2020-07-01 12:40:57,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:40:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2020-07-01 12:40:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:40:57,866 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:57,867 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:57,867 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 12:40:57,867 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:57,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:57,867 INFO L82 PathProgramCache]: Analyzing trace with hash 2013577952, now seen corresponding path program 1 times [2020-07-01 12:40:57,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:57,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582457958] [2020-07-01 12:40:57,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:57,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:57,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582457958] [2020-07-01 12:40:57,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:57,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:40:57,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412115853] [2020-07-01 12:40:57,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:40:57,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:57,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:40:57,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:40:57,906 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2020-07-01 12:40:57,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:57,980 INFO L93 Difference]: Finished difference Result 24 states and 37 transitions. [2020-07-01 12:40:57,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:40:57,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-01 12:40:57,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:57,981 INFO L225 Difference]: With dead ends: 24 [2020-07-01 12:40:57,981 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 12:40:57,982 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:40:57,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 12:40:57,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 12:40:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:40:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2020-07-01 12:40:57,985 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 35 transitions. Word has length 10 [2020-07-01 12:40:57,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:57,985 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 35 transitions. [2020-07-01 12:40:57,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:40:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 35 transitions. [2020-07-01 12:40:57,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:40:57,986 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:57,986 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:57,986 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-01 12:40:57,986 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:57,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:57,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2013577954, now seen corresponding path program 1 times [2020-07-01 12:40:57,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:57,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536427975] [2020-07-01 12:40:57,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:58,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:58,032 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536427975] [2020-07-01 12:40:58,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:58,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:40:58,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894515094] [2020-07-01 12:40:58,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:40:58,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:58,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:40:58,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:40:58,034 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. Second operand 5 states. [2020-07-01 12:40:58,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:58,125 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2020-07-01 12:40:58,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:40:58,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-01 12:40:58,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:58,128 INFO L225 Difference]: With dead ends: 30 [2020-07-01 12:40:58,128 INFO L226 Difference]: Without dead ends: 29 [2020-07-01 12:40:58,129 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:40:58,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-01 12:40:58,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2020-07-01 12:40:58,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 12:40:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2020-07-01 12:40:58,133 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 10 [2020-07-01 12:40:58,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:58,133 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2020-07-01 12:40:58,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:40:58,134 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2020-07-01 12:40:58,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:40:58,134 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:58,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:58,134 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-01 12:40:58,135 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:58,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:58,135 INFO L82 PathProgramCache]: Analyzing trace with hash 2013577955, now seen corresponding path program 1 times [2020-07-01 12:40:58,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:58,135 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214324199] [2020-07-01 12:40:58,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:58,192 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214324199] [2020-07-01 12:40:58,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:58,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:40:58,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520179844] [2020-07-01 12:40:58,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:40:58,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:58,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:40:58,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:40:58,194 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 6 states. [2020-07-01 12:40:58,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:58,298 INFO L93 Difference]: Finished difference Result 29 states and 43 transitions. [2020-07-01 12:40:58,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:40:58,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-01 12:40:58,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:58,299 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:40:58,299 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:40:58,299 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:40:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:40:58,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2020-07-01 12:40:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 12:40:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions. [2020-07-01 12:40:58,302 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 36 transitions. Word has length 10 [2020-07-01 12:40:58,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:58,303 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 36 transitions. [2020-07-01 12:40:58,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:40:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 36 transitions. [2020-07-01 12:40:58,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:40:58,303 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:58,304 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:58,304 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-01 12:40:58,304 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:58,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:58,304 INFO L82 PathProgramCache]: Analyzing trace with hash -2003540609, now seen corresponding path program 1 times [2020-07-01 12:40:58,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:58,305 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031445282] [2020-07-01 12:40:58,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:58,340 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031445282] [2020-07-01 12:40:58,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:58,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:40:58,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988768220] [2020-07-01 12:40:58,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:40:58,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:58,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:40:58,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:40:58,342 INFO L87 Difference]: Start difference. First operand 24 states and 36 transitions. Second operand 4 states. [2020-07-01 12:40:58,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:58,391 INFO L93 Difference]: Finished difference Result 24 states and 36 transitions. [2020-07-01 12:40:58,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:40:58,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-01 12:40:58,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:58,405 INFO L225 Difference]: With dead ends: 24 [2020-07-01 12:40:58,405 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 12:40:58,405 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:40:58,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 12:40:58,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 12:40:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:40:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2020-07-01 12:40:58,408 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 11 [2020-07-01 12:40:58,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:58,408 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2020-07-01 12:40:58,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:40:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2020-07-01 12:40:58,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:40:58,409 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:58,409 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:58,409 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-01 12:40:58,409 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:58,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:58,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2003540607, now seen corresponding path program 1 times [2020-07-01 12:40:58,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:58,410 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098438685] [2020-07-01 12:40:58,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:58,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098438685] [2020-07-01 12:40:58,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:58,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-01 12:40:58,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783922555] [2020-07-01 12:40:58,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:40:58,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:58,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:40:58,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:40:58,480 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand 8 states. [2020-07-01 12:40:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:58,636 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2020-07-01 12:40:58,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:40:58,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-07-01 12:40:58,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:58,637 INFO L225 Difference]: With dead ends: 29 [2020-07-01 12:40:58,637 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:40:58,638 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:40:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:40:58,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2020-07-01 12:40:58,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 12:40:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2020-07-01 12:40:58,641 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 11 [2020-07-01 12:40:58,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:58,641 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2020-07-01 12:40:58,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:40:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2020-07-01 12:40:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:40:58,642 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:58,642 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:58,642 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-01 12:40:58,642 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:58,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:58,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2003540606, now seen corresponding path program 1 times [2020-07-01 12:40:58,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:58,643 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145535763] [2020-07-01 12:40:58,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:58,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:58,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145535763] [2020-07-01 12:40:58,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:58,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 12:40:58,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318244683] [2020-07-01 12:40:58,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:40:58,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:58,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:40:58,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:40:58,697 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 7 states. [2020-07-01 12:40:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:58,804 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2020-07-01 12:40:58,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:40:58,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-07-01 12:40:58,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:58,805 INFO L225 Difference]: With dead ends: 25 [2020-07-01 12:40:58,806 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 12:40:58,806 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-01 12:40:58,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 12:40:58,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 12:40:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:40:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2020-07-01 12:40:58,809 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 11 [2020-07-01 12:40:58,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:58,809 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-07-01 12:40:58,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:40:58,809 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2020-07-01 12:40:58,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:40:58,810 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:58,810 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:58,810 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-01 12:40:58,810 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:58,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:58,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1981914376, now seen corresponding path program 1 times [2020-07-01 12:40:58,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:58,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248113719] [2020-07-01 12:40:58,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:58,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:58,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248113719] [2020-07-01 12:40:58,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004809567] [2020-07-01 12:40:58,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:40:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:58,930 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 12:40:58,935 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:40:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:58,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:40:58,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-07-01 12:40:58,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437174691] [2020-07-01 12:40:58,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:40:58,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:58,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:40:58,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:40:58,973 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 4 states. [2020-07-01 12:40:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:59,049 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2020-07-01 12:40:59,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:40:59,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-01 12:40:59,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:59,051 INFO L225 Difference]: With dead ends: 24 [2020-07-01 12:40:59,051 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 12:40:59,051 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:40:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 12:40:59,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 12:40:59,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:40:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2020-07-01 12:40:59,054 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 12 [2020-07-01 12:40:59,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:59,054 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-07-01 12:40:59,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:40:59,055 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2020-07-01 12:40:59,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:40:59,055 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:59,055 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:59,256 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:40:59,256 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:59,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:59,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1981914375, now seen corresponding path program 1 times [2020-07-01 12:40:59,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:59,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236500341] [2020-07-01 12:40:59,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:59,399 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236500341] [2020-07-01 12:40:59,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:40:59,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-01 12:40:59,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992219787] [2020-07-01 12:40:59,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:40:59,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:40:59,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:40:59,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:40:59,400 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 8 states. [2020-07-01 12:40:59,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:40:59,583 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2020-07-01 12:40:59,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:40:59,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-07-01 12:40:59,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:40:59,584 INFO L225 Difference]: With dead ends: 43 [2020-07-01 12:40:59,584 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 12:40:59,585 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:40:59,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 12:40:59,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 12:40:59,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:40:59,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-07-01 12:40:59,588 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 12 [2020-07-01 12:40:59,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:40:59,588 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-07-01 12:40:59,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:40:59,588 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2020-07-01 12:40:59,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-01 12:40:59,589 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:40:59,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:40:59,589 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-01 12:40:59,589 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:40:59,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:40:59,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1217166140, now seen corresponding path program 1 times [2020-07-01 12:40:59,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:40:59,590 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112840133] [2020-07-01 12:40:59,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:40:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:40:59,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112840133] [2020-07-01 12:40:59,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208648840] [2020-07-01 12:40:59,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:40:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:40:59,918 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-01 12:40:59,920 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:40:59,946 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_22|], 1=[|v_#valid_33|]} [2020-07-01 12:40:59,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:40:59,966 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:40:59,967 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:40:59,980 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:40:59,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:40:59,998 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:41:00,009 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:41:00,010 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:41:00,010 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2020-07-01 12:41:00,046 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:41:00,046 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:41:00,057 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:41:00,057 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:41:00,057 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2020-07-01 12:41:00,110 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-07-01 12:41:00,111 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:41:00,124 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:41:00,127 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 12:41:00,127 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2020-07-01 12:41:00,260 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:41:00,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-07-01 12:41:00,262 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:41:00,265 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:41:00,280 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:41:00,283 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:41:00,285 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:41:00,287 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:41:00,287 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2020-07-01 12:41:00,341 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:41:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:00,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:41:00,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-07-01 12:41:00,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068899910] [2020-07-01 12:41:00,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-01 12:41:00,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:00,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-01 12:41:00,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-07-01 12:41:00,373 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 15 states. [2020-07-01 12:41:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:00,986 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2020-07-01 12:41:00,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 12:41:00,986 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2020-07-01 12:41:00,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:00,987 INFO L225 Difference]: With dead ends: 32 [2020-07-01 12:41:00,987 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 12:41:00,988 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2020-07-01 12:41:00,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 12:41:00,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2020-07-01 12:41:00,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:41:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-07-01 12:41:00,992 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 12 [2020-07-01 12:41:00,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:00,992 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-07-01 12:41:00,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-01 12:41:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-07-01 12:41:00,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:41:00,992 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:00,993 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:41:01,193 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:41:01,194 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:41:01,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:01,194 INFO L82 PathProgramCache]: Analyzing trace with hash -922554467, now seen corresponding path program 1 times [2020-07-01 12:41:01,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:01,194 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521211732] [2020-07-01 12:41:01,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:01,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:01,248 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521211732] [2020-07-01 12:41:01,248 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14426053] [2020-07-01 12:41:01,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:41:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:01,286 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:41:01,287 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:41:01,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:01,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:41:01,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-07-01 12:41:01,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991109567] [2020-07-01 12:41:01,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:41:01,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:01,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:41:01,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:41:01,299 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 8 states. [2020-07-01 12:41:01,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:01,418 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2020-07-01 12:41:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:41:01,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-07-01 12:41:01,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:01,419 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:41:01,419 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:41:01,420 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:41:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:41:01,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:41:01,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:41:01,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2020-07-01 12:41:01,423 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 13 [2020-07-01 12:41:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:01,423 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-07-01 12:41:01,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:41:01,424 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-07-01 12:41:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:41:01,424 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:01,424 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:41:01,625 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-07-01 12:41:01,625 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:41:01,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:01,625 INFO L82 PathProgramCache]: Analyzing trace with hash -922554466, now seen corresponding path program 1 times [2020-07-01 12:41:01,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:01,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017190990] [2020-07-01 12:41:01,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:01,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:01,834 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017190990] [2020-07-01 12:41:01,834 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654236912] [2020-07-01 12:41:01,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:41:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:01,889 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 42 conjunts are in the unsatisfiable core [2020-07-01 12:41:01,891 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:41:01,926 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:41:01,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 12:41:01,941 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:41:01,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-01 12:41:01,949 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:41:01,975 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:41:01,978 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2020-07-01 12:41:01,979 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:49 [2020-07-01 12:41:02,222 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:41:02,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 42 [2020-07-01 12:41:02,225 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:41:02,226 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:41:02,227 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:41:02,228 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:41:02,229 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 12:41:02,229 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:41:02,231 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2020-07-01 12:41:02,292 INFO L619 ElimStorePlain]: treesize reduction 53, result has 43.0 percent of original size [2020-07-01 12:41:02,295 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:41:02,297 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:41:02,298 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:41:02,298 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:23 [2020-07-01 12:41:02,335 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:41:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:02,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:41:02,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-07-01 12:41:02,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079707590] [2020-07-01 12:41:02,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 12:41:02,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:02,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 12:41:02,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2020-07-01 12:41:02,340 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 17 states. [2020-07-01 12:41:02,751 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2020-07-01 12:41:03,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:03,148 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-01 12:41:03,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 12:41:03,148 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2020-07-01 12:41:03,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:03,149 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:41:03,149 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:41:03,150 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2020-07-01 12:41:03,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:41:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:41:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:41:03,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-07-01 12:41:03,153 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 13 [2020-07-01 12:41:03,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:03,153 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-07-01 12:41:03,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 12:41:03,154 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-07-01 12:41:03,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:41:03,154 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:03,154 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:41:03,355 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:41:03,355 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:41:03,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:03,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1811621848, now seen corresponding path program 1 times [2020-07-01 12:41:03,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:03,356 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639308633] [2020-07-01 12:41:03,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:03,404 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639308633] [2020-07-01 12:41:03,404 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514434146] [2020-07-01 12:41:03,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:41:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:03,442 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:41:03,443 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:41:03,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:03,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:41:03,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-07-01 12:41:03,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638915670] [2020-07-01 12:41:03,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:41:03,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:03,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:41:03,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:41:03,457 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 8 states. [2020-07-01 12:41:03,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:03,567 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2020-07-01 12:41:03,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:41:03,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-07-01 12:41:03,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:03,568 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:41:03,568 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:41:03,568 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:41:03,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:41:03,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 12:41:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 12:41:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2020-07-01 12:41:03,571 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 15 [2020-07-01 12:41:03,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:03,572 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-07-01 12:41:03,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:41:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2020-07-01 12:41:03,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:41:03,572 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:03,573 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:41:03,773 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2020-07-01 12:41:03,774 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:41:03,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:03,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1811621847, now seen corresponding path program 1 times [2020-07-01 12:41:03,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:03,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504917883] [2020-07-01 12:41:03,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:41:03,815 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504917883] [2020-07-01 12:41:03,815 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409281400] [2020-07-01 12:41:03,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:41:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:03,868 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-01 12:41:03,870 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:41:03,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:41:03,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:41:03,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2020-07-01 12:41:03,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579402204] [2020-07-01 12:41:03,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:41:03,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:03,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:41:03,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:41:03,875 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 4 states. [2020-07-01 12:41:03,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:03,918 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2020-07-01 12:41:03,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:41:03,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-01 12:41:03,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:03,919 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:41:03,919 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 12:41:03,919 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:41:03,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 12:41:03,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2020-07-01 12:41:03,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:41:03,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-07-01 12:41:03,923 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2020-07-01 12:41:03,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:03,923 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-07-01 12:41:03,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:41:03,923 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-07-01 12:41:03,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 12:41:03,924 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:03,924 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:41:04,124 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:41:04,125 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:41:04,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:04,125 INFO L82 PathProgramCache]: Analyzing trace with hash -325650181, now seen corresponding path program 1 times [2020-07-01 12:41:04,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:04,126 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598879412] [2020-07-01 12:41:04,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:04,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:41:04,167 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598879412] [2020-07-01 12:41:04,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:41:04,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:41:04,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725718543] [2020-07-01 12:41:04,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:41:04,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:04,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:41:04,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:41:04,168 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-07-01 12:41:04,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:04,242 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2020-07-01 12:41:04,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:41:04,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-01 12:41:04,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:04,243 INFO L225 Difference]: With dead ends: 23 [2020-07-01 12:41:04,243 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 12:41:04,244 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:41:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 12:41:04,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 12:41:04,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:41:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-07-01 12:41:04,247 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 16 [2020-07-01 12:41:04,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:04,247 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-07-01 12:41:04,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:41:04,247 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-07-01 12:41:04,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-01 12:41:04,248 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:04,248 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:41:04,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-07-01 12:41:04,248 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:41:04,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:04,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1506918721, now seen corresponding path program 2 times [2020-07-01 12:41:04,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:04,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091096033] [2020-07-01 12:41:04,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:04,498 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:04,498 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091096033] [2020-07-01 12:41:04,498 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955811413] [2020-07-01 12:41:04,498 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:41:04,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:41:04,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:41:04,543 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-01 12:41:04,545 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:41:04,549 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_23|], 1=[|v_#valid_34|]} [2020-07-01 12:41:04,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 12:41:04,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 12:41:04,553 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:41:04,559 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:41:04,563 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 12:41:04,564 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 12:41:04,570 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:41:04,570 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:41:04,570 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-07-01 12:41:04,594 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:41:04,594 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:41:04,603 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:41:04,604 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:41:04,605 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2020-07-01 12:41:04,638 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-07-01 12:41:04,639 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:41:04,649 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:41:04,650 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 12:41:04,650 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2020-07-01 12:41:04,772 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:41:04,772 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-07-01 12:41:04,773 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:41:04,774 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:41:04,788 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:41:04,789 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:41:04,790 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:41:04,792 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:41:04,792 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:23 [2020-07-01 12:41:04,830 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:41:04,833 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-01 12:41:04,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:41:04,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2020-07-01 12:41:04,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6692489] [2020-07-01 12:41:04,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-01 12:41:04,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:04,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-01 12:41:04,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-07-01 12:41:04,835 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 16 states. [2020-07-01 12:41:05,259 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2020-07-01 12:41:05,478 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 67 [2020-07-01 12:41:05,863 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2020-07-01 12:41:05,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:05,964 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-07-01 12:41:05,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-01 12:41:05,964 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-07-01 12:41:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:05,965 INFO L225 Difference]: With dead ends: 21 [2020-07-01 12:41:05,965 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 12:41:05,965 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2020-07-01 12:41:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 12:41:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-07-01 12:41:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 12:41:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2020-07-01 12:41:05,969 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2020-07-01 12:41:05,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:05,969 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2020-07-01 12:41:05,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-01 12:41:05,969 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2020-07-01 12:41:05,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-01 12:41:05,970 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:05,970 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:41:06,170 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-07-01 12:41:06,171 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:41:06,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:06,171 INFO L82 PathProgramCache]: Analyzing trace with hash 530160763, now seen corresponding path program 2 times [2020-07-01 12:41:06,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:06,172 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835193977] [2020-07-01 12:41:06,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:06,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835193977] [2020-07-01 12:41:06,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113750263] [2020-07-01 12:41:06,416 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:41:06,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:41:06,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:41:06,476 INFO L264 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 66 conjunts are in the unsatisfiable core [2020-07-01 12:41:06,478 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:41:06,495 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:41:06,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-01 12:41:06,496 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:41:06,516 INFO L619 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2020-07-01 12:41:06,516 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:41:06,517 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2020-07-01 12:41:06,545 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:41:06,546 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:41:06,560 INFO L619 ElimStorePlain]: treesize reduction 3, result has 86.4 percent of original size [2020-07-01 12:41:06,560 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:41:06,560 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2020-07-01 12:41:06,798 INFO L343 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2020-07-01 12:41:06,799 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 30 [2020-07-01 12:41:06,800 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:41:06,801 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:41:06,801 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:41:06,802 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:41:06,803 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-07-01 12:41:06,827 INFO L619 ElimStorePlain]: treesize reduction 17, result has 55.3 percent of original size [2020-07-01 12:41:06,827 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:41:06,828 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:21 [2020-07-01 12:41:06,862 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:41:06,927 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:06,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:41:06,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2020-07-01 12:41:06,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337599506] [2020-07-01 12:41:06,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-01 12:41:06,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:06,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-01 12:41:06,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2020-07-01 12:41:06,929 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 22 states. [2020-07-01 12:41:07,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:07,591 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2020-07-01 12:41:07,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-01 12:41:07,591 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 18 [2020-07-01 12:41:07,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:07,592 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:41:07,592 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 12:41:07,592 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=912, Unknown=0, NotChecked=0, Total=1056 [2020-07-01 12:41:07,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 12:41:07,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2020-07-01 12:41:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 12:41:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-07-01 12:41:07,596 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2020-07-01 12:41:07,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:07,597 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-01 12:41:07,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-01 12:41:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-01 12:41:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-01 12:41:07,598 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:07,598 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:41:07,798 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-07-01 12:41:07,799 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 12:41:07,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:07,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1902997950, now seen corresponding path program 3 times [2020-07-01 12:41:07,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:07,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488150768] [2020-07-01 12:41:07,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-01 12:41:07,938 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488150768] [2020-07-01 12:41:07,938 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6424444] [2020-07-01 12:41:07,938 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:41:08,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-01 12:41:08,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:41:08,015 INFO L264 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 39 conjunts are in the unsatisfiable core [2020-07-01 12:41:08,017 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:41:08,031 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:41:08,031 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-01 12:41:08,031 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:41:08,046 INFO L619 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-07-01 12:41:08,047 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:41:08,047 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-07-01 12:41:08,052 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 12:41:08,052 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:41:08,054 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:41:08,054 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:41:08,055 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-07-01 12:41:08,169 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:41:08,169 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 50 [2020-07-01 12:41:08,171 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:41:08,172 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:41:08,172 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:41:08,173 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:41:08,173 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 12:41:08,175 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-07-01 12:41:08,218 INFO L619 ElimStorePlain]: treesize reduction 32, result has 63.2 percent of original size [2020-07-01 12:41:08,220 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:41:08,221 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:41:08,221 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:23 [2020-07-01 12:41:08,250 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:41:08,253 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-01 12:41:08,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:41:08,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2020-07-01 12:41:08,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828290701] [2020-07-01 12:41:08,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-01 12:41:08,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:08,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-01 12:41:08,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-07-01 12:41:08,254 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 14 states. [2020-07-01 12:41:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:08,586 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-07-01 12:41:08,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:41:08,587 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2020-07-01 12:41:08,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:08,587 INFO L225 Difference]: With dead ends: 24 [2020-07-01 12:41:08,588 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:41:08,588 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2020-07-01 12:41:08,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:41:08,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:41:08,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:41:08,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:41:08,589 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2020-07-01 12:41:08,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:08,589 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:41:08,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-01 12:41:08,590 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:41:08,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:41:08,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:41:08,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:41:09,473 WARN L192 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 89 [2020-07-01 12:41:09,477 INFO L268 CegarLoopResult]: For program point L27-1(lines 27 29) no Hoare annotation was computed. [2020-07-01 12:41:09,478 INFO L268 CegarLoopResult]: For program point L15-2(line 15) no Hoare annotation was computed. [2020-07-01 12:41:09,478 INFO L268 CegarLoopResult]: For program point L15-3(lines 15 17) no Hoare annotation was computed. [2020-07-01 12:41:09,478 INFO L264 CegarLoopResult]: At program point L15-5(lines 15 17) the Hoare annotation is: (let ((.cse14 (select |#length| ULTIMATE.start_cstrcmp_~s1.base)) (.cse11 (select |#length| ULTIMATE.start_cstrcmp_~s2.base)) (.cse22 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse0 (= ULTIMATE.start_cstrcmp_~s1.offset 0)) (.cse1 (= .cse22 ULTIMATE.start_main_~length1~0)) (.cse15 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s2.base) (+ .cse11 (- 1))))) (.cse16 (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= ULTIMATE.start_cstrcmp_~s1.base ULTIMATE.start_main_~nondetString2~0.base))))) (.cse17 (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset .cse22 (- 1))))) (.cse2 (= 1 (select |#valid| ULTIMATE.start_cstrcmp_~s2.base))) (.cse3 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse4 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse5 (<= 1 |#StackHeapBarrier|)) (.cse6 (<= 1 .cse14)) (.cse7 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse18 (or (= ULTIMATE.start_main_~length2~0 1) (< 1 ULTIMATE.start_main_~length2~0))) (.cse8 (= 0 ULTIMATE.start_main_~nondetString2~0.offset)) (.cse9 (= 0 ULTIMATE.start_main_~nondetString1~0.offset)) (.cse10 (= 0 ULTIMATE.start_cstrcmp_~s2.offset)) (.cse19 (<= (+ ULTIMATE.start_cstrcmp_~s2.offset 1) .cse11)) (.cse12 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse13 (= 1 (select |#valid| ULTIMATE.start_cstrcmp_~s1.base))) (.cse20 (<= 1 .cse22)) (.cse21 (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_cstrcmp_~s1.base) (- 1)))))))) (or (and .cse0 .cse1 (<= 1 ULTIMATE.start_main_~length2~0) (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~nondetString1~0.offset)) .cse2 .cse3 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base) ULTIMATE.start_cstrcmp_~s1.offset)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 .cse11) .cse12 .cse13 (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (and (<= (+ ULTIMATE.start_cstrcmp_~s1.offset 1) .cse14) .cse15 .cse1 .cse16 .cse17 .cse2 .cse3 .cse4 .cse5 .cse7 (<= 1 ULTIMATE.start_cstrcmp_~s2.offset) .cse18 .cse8 .cse9 .cse12 .cse19 .cse13 .cse20 (<= 1 ULTIMATE.start_cstrcmp_~s1.offset) .cse21) (and .cse0 .cse1 .cse15 .cse16 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse10 .cse19 .cse12 .cse13 .cse20 .cse21)))) [2020-07-01 12:41:09,478 INFO L268 CegarLoopResult]: For program point L15-6(lines 15 17) no Hoare annotation was computed. [2020-07-01 12:41:09,478 INFO L268 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2020-07-01 12:41:09,479 INFO L268 CegarLoopResult]: For program point L32-1(line 32) no Hoare annotation was computed. [2020-07-01 12:41:09,479 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:41:09,479 INFO L268 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2020-07-01 12:41:09,479 INFO L268 CegarLoopResult]: For program point L24-2(lines 21 35) no Hoare annotation was computed. [2020-07-01 12:41:09,479 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:41:09,479 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:41:09,479 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-01 12:41:09,479 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 12:41:09,479 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:41:09,480 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:41:09,480 INFO L268 CegarLoopResult]: For program point L16-1(lines 16 17) no Hoare annotation was computed. [2020-07-01 12:41:09,480 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:41:09,480 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:41:09,480 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:41:09,480 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:41:09,480 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:41:09,480 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. [2020-07-01 12:41:09,480 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-07-01 12:41:09,481 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:41:09,481 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. [2020-07-01 12:41:09,481 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-07-01 12:41:09,483 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:41:09,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:41:09,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,496 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:41:09,497 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,497 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,497 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,498 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:41:09,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,505 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,505 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,505 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,506 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,506 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,506 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,506 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,507 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:41:09,507 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,507 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,508 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,508 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,508 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,508 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,508 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,509 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,509 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,509 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,510 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,510 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,510 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:41:09,510 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,511 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,511 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,511 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,511 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,511 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:41:09,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:41:09,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,525 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,525 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,525 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,528 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,528 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,528 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,528 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:41:09,529 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,529 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,529 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,529 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,529 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,531 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:41:09,532 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,532 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,532 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,532 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,532 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:41:09,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,536 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,536 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:41:09 BasicIcfg [2020-07-01 12:41:09,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:41:09,540 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:41:09,540 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:41:09,544 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:41:09,545 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:41:09,545 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:40:54" (1/5) ... [2020-07-01 12:41:09,545 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57e1a54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:41:09, skipping insertion in model container [2020-07-01 12:41:09,546 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:41:09,546 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:40:55" (2/5) ... [2020-07-01 12:41:09,546 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57e1a54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:41:09, skipping insertion in model container [2020-07-01 12:41:09,546 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:41:09,546 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:40:55" (3/5) ... [2020-07-01 12:41:09,546 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57e1a54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:41:09, skipping insertion in model container [2020-07-01 12:41:09,546 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:41:09,547 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:40:55" (4/5) ... [2020-07-01 12:41:09,547 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@57e1a54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:41:09, skipping insertion in model container [2020-07-01 12:41:09,547 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:41:09,547 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:41:09" (5/5) ... [2020-07-01 12:41:09,548 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:41:09,572 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:41:09,572 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:41:09,573 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:41:09,573 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:41:09,573 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:41:09,573 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:41:09,573 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:41:09,573 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:41:09,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2020-07-01 12:41:09,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-01 12:41:09,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:41:09,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:41:09,586 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:41:09,586 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 12:41:09,587 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:41:09,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2020-07-01 12:41:09,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-01 12:41:09,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:41:09,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:41:09,589 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:41:09,589 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 12:41:09,594 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue [158] ULTIMATE.startENTRY-->L24: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 29#L24true [103] L24-->L24-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 26#L24-2true [92] L24-2-->L27-1: Formula: (and (< v_ULTIMATE.start_main_~length2~0_5 1) (= v_ULTIMATE.start_main_~length2~0_4 1)) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_5} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length2~0] 4#L27-1true [125] L27-1-->L32: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc10.base_2|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|)) (= 0 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (= 0 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1) |v_#valid_3|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| 0))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 15#L32true [82] L32-->L32-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 13#L32-1true [159] L32-1-->L15-5: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_cstrcmp_~s2.base_7) (= v_ULTIMATE.start_cstrcmp_~s1.base_11 |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2| v_ULTIMATE.start_cstrcmp_~s2.offset_7) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrcmp_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_9) (= |v_#memory_int_10| (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrcmp_#in~s2.offset=|v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_7|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_9, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_7|, ULTIMATE.start_cstrcmp_#t~pre5.offset=|v_ULTIMATE.start_cstrcmp_#t~pre5.offset_6|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_7|, ULTIMATE.start_cstrcmp_#t~mem7=|v_ULTIMATE.start_cstrcmp_#t~mem7_5|, ULTIMATE.start_cstrcmp_#t~mem6=|v_ULTIMATE.start_cstrcmp_#t~mem6_5|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_11, ULTIMATE.start_cstrcmp_#t~post3.offset=|v_ULTIMATE.start_cstrcmp_#t~post3.offset_7|, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_7, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_18|, ULTIMATE.start_cstrcmp_#t~post0.offset=|v_ULTIMATE.start_cstrcmp_#t~post0.offset_7|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_7, ULTIMATE.start_cstrcmp_#t~post0.base=|v_ULTIMATE.start_cstrcmp_#t~post0.base_8|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrcmp_#res=|v_ULTIMATE.start_cstrcmp_#res_5|, ULTIMATE.start_cstrcmp_#t~post3.base=|v_ULTIMATE.start_cstrcmp_#t~post3.base_8|, ULTIMATE.start_cstrcmp_#t~pre5.base=|v_ULTIMATE.start_cstrcmp_#t~pre5.base_7|, #valid=|v_#valid_25|, ULTIMATE.start_cstrcmp_#in~s1.offset=|v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrcmp_#in~s2.base=|v_ULTIMATE.start_cstrcmp_#in~s2.base_2|, ULTIMATE.start_cstrcmp_#in~s1.base=|v_ULTIMATE.start_cstrcmp_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#in~s2.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~post0.base, ULTIMATE.start_cstrcmp_#t~pre5.offset, ULTIMATE.start_cstrcmp_#t~mem4, ULTIMATE.start_cstrcmp_#t~mem7, ULTIMATE.start_cstrcmp_#t~mem6, ULTIMATE.start_cstrcmp_#res, ULTIMATE.start_cstrcmp_#t~post3.base, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post3.offset, ULTIMATE.start_cstrcmp_#t~pre5.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#in~s1.offset, #memory_int, ULTIMATE.start_cstrcmp_#in~s2.base, ULTIMATE.start_cstrcmp_#in~s1.base, ULTIMATE.start_cstrcmp_#t~post0.offset] 24#L15-5true [2020-07-01 12:41:09,595 INFO L796 eck$LassoCheckResult]: Loop: 24#L15-5true [160] L15-5-->L15-2: Formula: (and (= |v_ULTIMATE.start_cstrcmp_#t~post0.base_9| v_ULTIMATE.start_cstrcmp_~s2.base_9) (= (+ |v_ULTIMATE.start_cstrcmp_#t~post0.offset_8| 1) v_ULTIMATE.start_cstrcmp_~s2.offset_8) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrcmp_~s1.base_12) v_ULTIMATE.start_cstrcmp_~s1.offset_10) |v_ULTIMATE.start_cstrcmp_#t~mem1_8|) (= |v_ULTIMATE.start_cstrcmp_#t~post0.offset_8| v_ULTIMATE.start_cstrcmp_~s2.offset_9) (= |v_ULTIMATE.start_cstrcmp_#t~post0.base_9| v_ULTIMATE.start_cstrcmp_~s2.base_8) (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_10 1) (select |v_#length_19| v_ULTIMATE.start_cstrcmp_~s1.base_12)) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_10) (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrcmp_~s1.base_12))) InVars {ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_9, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_12, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_9, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_10} OutVars{ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_8, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_12, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_8, #valid=|v_#valid_26|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_8|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_cstrcmp_#t~post0.base=|v_ULTIMATE.start_cstrcmp_#t~post0.base_9|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_10, ULTIMATE.start_cstrcmp_#t~post0.offset=|v_ULTIMATE.start_cstrcmp_#t~post0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_#t~post0.base, ULTIMATE.start_cstrcmp_#t~post0.offset] 28#L15-2true [97] L15-2-->L15-3: Formula: (and (<= 0 |v_ULTIMATE.start_cstrcmp_#t~post0.offset_3|) (<= (+ |v_ULTIMATE.start_cstrcmp_#t~post0.offset_3| 1) (select |v_#length_10| |v_ULTIMATE.start_cstrcmp_#t~post0.base_3|)) (= 1 (select |v_#valid_12| |v_ULTIMATE.start_cstrcmp_#t~post0.base_3|)) (= (select (select |v_#memory_int_6| |v_ULTIMATE.start_cstrcmp_#t~post0.base_3|) |v_ULTIMATE.start_cstrcmp_#t~post0.offset_3|) |v_ULTIMATE.start_cstrcmp_#t~mem2_2|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_#t~post0.base=|v_ULTIMATE.start_cstrcmp_#t~post0.base_3|, ULTIMATE.start_cstrcmp_#t~post0.offset=|v_ULTIMATE.start_cstrcmp_#t~post0.offset_3|, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_2|, ULTIMATE.start_cstrcmp_#t~post0.base=|v_ULTIMATE.start_cstrcmp_#t~post0.base_3|, ULTIMATE.start_cstrcmp_#t~post0.offset=|v_ULTIMATE.start_cstrcmp_#t~post0.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem2] 27#L15-3true [96] L15-3-->L16: Formula: (and (= |v_ULTIMATE.start_cstrcmp_#t~post3.base_2| v_ULTIMATE.start_cstrcmp_~s1.base_7) (= |v_ULTIMATE.start_cstrcmp_#t~mem1_6| |v_ULTIMATE.start_cstrcmp_#t~mem2_6|) (= v_ULTIMATE.start_cstrcmp_~s1.offset_5 (+ |v_ULTIMATE.start_cstrcmp_#t~post3.offset_2| 1)) (= |v_ULTIMATE.start_cstrcmp_#t~post3.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_6) (= v_ULTIMATE.start_cstrcmp_~s1.base_6 |v_ULTIMATE.start_cstrcmp_#t~post3.base_2|)) InVars {ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_6|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_6, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_6|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_7} OutVars{ULTIMATE.start_cstrcmp_#t~post3.base=|v_ULTIMATE.start_cstrcmp_#t~post3.base_2|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_6, ULTIMATE.start_cstrcmp_#t~post3.offset=|v_ULTIMATE.start_cstrcmp_#t~post3.offset_2|, ULTIMATE.start_cstrcmp_#t~mem1=|v_ULTIMATE.start_cstrcmp_#t~mem1_5|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_5, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~post0.base=|v_ULTIMATE.start_cstrcmp_#t~post0.base_7|, ULTIMATE.start_cstrcmp_#t~post0.offset=|v_ULTIMATE.start_cstrcmp_#t~post0.offset_6|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post3.base, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post3.offset, ULTIMATE.start_cstrcmp_#t~mem1, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~post0.base, ULTIMATE.start_cstrcmp_#t~post0.offset] 6#L16true [68] L16-->L16-1: Formula: (and (<= (+ |v_ULTIMATE.start_cstrcmp_#t~post3.offset_3| 1) (select |v_#length_12| |v_ULTIMATE.start_cstrcmp_#t~post3.base_3|)) (= 1 (select |v_#valid_14| |v_ULTIMATE.start_cstrcmp_#t~post3.base_3|)) (= (select (select |v_#memory_int_7| |v_ULTIMATE.start_cstrcmp_#t~post3.base_3|) |v_ULTIMATE.start_cstrcmp_#t~post3.offset_3|) |v_ULTIMATE.start_cstrcmp_#t~mem4_2|) (<= 0 |v_ULTIMATE.start_cstrcmp_#t~post3.offset_3|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrcmp_#t~post3.base=|v_ULTIMATE.start_cstrcmp_#t~post3.base_3|, #length=|v_#length_12|, ULTIMATE.start_cstrcmp_#t~post3.offset=|v_ULTIMATE.start_cstrcmp_#t~post3.offset_3|, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_cstrcmp_#t~post3.base=|v_ULTIMATE.start_cstrcmp_#t~post3.base_3|, ULTIMATE.start_cstrcmp_#t~post3.offset=|v_ULTIMATE.start_cstrcmp_#t~post3.offset_3|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, #length=|v_#length_12|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem4] 3#L16-1true [156] L16-1-->L15-5: Formula: (> 0 |v_ULTIMATE.start_cstrcmp_#t~mem4_6|) InVars {ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_6|} OutVars{ULTIMATE.start_cstrcmp_#t~post3.base=|v_ULTIMATE.start_cstrcmp_#t~post3.base_7|, ULTIMATE.start_cstrcmp_#t~post3.offset=|v_ULTIMATE.start_cstrcmp_#t~post3.offset_6|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~post3.base, ULTIMATE.start_cstrcmp_#t~post3.offset, ULTIMATE.start_cstrcmp_#t~mem4] 24#L15-5true [2020-07-01 12:41:09,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:09,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1213928504, now seen corresponding path program 1 times [2020-07-01 12:41:09,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:09,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365470097] [2020-07-01 12:41:09,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:09,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:09,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365470097] [2020-07-01 12:41:09,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:41:09,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:41:09,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550429506] [2020-07-01 12:41:09,611 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:41:09,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:09,611 INFO L82 PathProgramCache]: Analyzing trace with hash 179376758, now seen corresponding path program 1 times [2020-07-01 12:41:09,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:09,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991470104] [2020-07-01 12:41:09,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:41:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:41:09,638 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:41:09,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:09,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:41:09,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:41:09,762 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2020-07-01 12:41:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:09,802 INFO L93 Difference]: Finished difference Result 27 states and 45 transitions. [2020-07-01 12:41:09,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:41:09,805 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:41:09,808 INFO L168 Benchmark]: Toolchain (without parser) took 14915.13 ms. Allocated memory was 649.6 MB in the beginning and 899.2 MB in the end (delta: 249.6 MB). Free memory was 556.2 MB in the beginning and 574.4 MB in the end (delta: -18.2 MB). Peak memory consumption was 231.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:09,809 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 577.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:41:09,809 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.63 ms. Allocated memory was 649.6 MB in the beginning and 689.4 MB in the end (delta: 39.8 MB). Free memory was 556.2 MB in the beginning and 652.5 MB in the end (delta: -96.3 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:09,810 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.79 ms. Allocated memory is still 689.4 MB. Free memory was 652.5 MB in the beginning and 649.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:09,810 INFO L168 Benchmark]: Boogie Preprocessor took 27.45 ms. Allocated memory is still 689.4 MB. Free memory was 649.8 MB in the beginning and 648.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:09,810 INFO L168 Benchmark]: RCFGBuilder took 350.30 ms. Allocated memory is still 689.4 MB. Free memory was 648.4 MB in the beginning and 624.6 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:09,811 INFO L168 Benchmark]: BlockEncodingV2 took 125.76 ms. Allocated memory is still 689.4 MB. Free memory was 623.3 MB in the beginning and 613.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:09,811 INFO L168 Benchmark]: TraceAbstraction took 13773.85 ms. Allocated memory was 689.4 MB in the beginning and 899.2 MB in the end (delta: 209.7 MB). Free memory was 613.8 MB in the beginning and 627.4 MB in the end (delta: -13.6 MB). Peak memory consumption was 196.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:09,812 INFO L168 Benchmark]: BuchiAutomizer took 266.87 ms. Allocated memory is still 899.2 MB. Free memory was 618.7 MB in the beginning and 574.4 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:09,814 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 36 locations, 40 edges - StatisticsResult: Encoded RCFG 27 locations, 48 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 577.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 321.63 ms. Allocated memory was 649.6 MB in the beginning and 689.4 MB in the end (delta: 39.8 MB). Free memory was 556.2 MB in the beginning and 652.5 MB in the end (delta: -96.3 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.79 ms. Allocated memory is still 689.4 MB. Free memory was 652.5 MB in the beginning and 649.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 27.45 ms. Allocated memory is still 689.4 MB. Free memory was 649.8 MB in the beginning and 648.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 350.30 ms. Allocated memory is still 689.4 MB. Free memory was 648.4 MB in the beginning and 624.6 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 125.76 ms. Allocated memory is still 689.4 MB. Free memory was 623.3 MB in the beginning and 613.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 13773.85 ms. Allocated memory was 689.4 MB in the beginning and 899.2 MB in the end (delta: 209.7 MB). Free memory was 613.8 MB in the beginning and 627.4 MB in the end (delta: -13.6 MB). Peak memory consumption was 196.1 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 266.87 ms. Allocated memory is still 899.2 MB. Free memory was 618.7 MB in the beginning and 574.4 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant [2020-07-01 12:41:09,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:41:09,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,827 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,827 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,827 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,827 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,828 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:41:09,828 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,828 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,829 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,829 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,830 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,831 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,831 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,831 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,831 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:41:09,832 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,832 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,832 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,832 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,832 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,834 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,834 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,834 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:41:09,834 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,834 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,835 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,835 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,835 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,835 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,835 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,836 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:41:09,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,837 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,838 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,838 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,838 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:41:09,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 12:41:09,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 12:41:09,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString1~0.offset,QUANTIFIED] [2020-07-01 12:41:09,844 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,844 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,844 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,845 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,845 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:41:09,845 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,845 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,845 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,845 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,846 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,847 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,847 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,847 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,847 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:41:09,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,848 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,849 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,849 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,849 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,849 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:41:09,850 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:09,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:41:09,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((s1 == 0 && unknown-#length-unknown[nondetString1] == length1) && 1 <= length2) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && 1 == \valid[s2]) && !(nondetString1 == nondetString2)) && 0 == unknown-#memory_int-unknown[s1][s1]) && 1 == \valid[nondetString2]) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 <= unknown-#length-unknown[s1]) && unknown-#length-unknown[nondetString2] == length2) && 0 == nondetString2) && 0 == nondetString1) && 0 == s2) && 1 <= unknown-#length-unknown[s2]) && 1 == \valid[nondetString1]) && 1 == \valid[s1]) && 1 == nondetString1 + length1) || (((((((((((((((((((s1 + 1 <= unknown-#length-unknown[s1] && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && unknown-#length-unknown[nondetString1] == length1) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(s1 == ULTIMATE.start_main_~nondetString2~0.base))) && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && 1 == \valid[s2]) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[nondetString2] == length2) && 1 <= s2) && (length2 == 1 || 1 < length2)) && 0 == nondetString2) && 0 == nondetString1) && 1 == \valid[nondetString1]) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[s1]) && 1 <= unknown-#length-unknown[nondetString1]) && 1 <= s1) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[s1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[s1] + -1]))) || (((((((((((((((((((s1 == 0 && unknown-#length-unknown[nondetString1] == length1) && 0 == unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1]) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(s1 == ULTIMATE.start_main_~nondetString2~0.base))) && 0 == unknown-#memory_int-unknown[nondetString1][nondetString1 + unknown-#length-unknown[nondetString1] + -1]) && 1 == \valid[s2]) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 <= unknown-#length-unknown[s1]) && unknown-#length-unknown[nondetString2] == length2) && (length2 == 1 || 1 < length2)) && 0 == nondetString2) && 0 == nondetString1) && 0 == s2) && s2 + 1 <= unknown-#length-unknown[s2]) && 1 == \valid[nondetString1]) && 1 == \valid[s1]) && 1 <= unknown-#length-unknown[nondetString1]) && (\exists ULTIMATE.start_main_~nondetString1~0.offset : int :: (ULTIMATE.start_main_~nondetString1~0.offset <= 0 && 0 <= ULTIMATE.start_main_~nondetString1~0.offset) && 0 == unknown-#memory_int-unknown[s1][ULTIMATE.start_main_~nondetString1~0.offset + unknown-#length-unknown[s1] + -1])) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 14 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.9s, OverallIterations: 30, TraceHistogramMax: 4, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 139 SDtfs, 1286 SDslu, 946 SDs, 0 SdLazy, 2476 SolverSat, 218 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 37 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 6 NumberOfFragments, 366 HoareAnnotationTreeSize, 1 FomulaSimplifications, 954 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 151 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 450 NumberOfCodeBlocks, 450 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 411 ConstructedInterpolants, 20 QuantifiedInterpolants, 50325 SizeOfPredicates, 90 NumberOfNonLiveVariables, 1130 ConjunctsInSsa, 230 ConjunctsInUnsatCore, 39 InterpolantComputations, 23 PerfectInterpolantSequences, 40/106 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:40:51.615 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_GIveBs/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:41:10.077 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check