java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/mult_array-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:50:02,002 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:50:02,004 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:50:02,018 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:50:02,018 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:50:02,019 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:50:02,020 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:50:02,022 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:50:02,024 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:50:02,025 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:50:02,025 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:50:02,026 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:50:02,026 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:50:02,028 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:50:02,029 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:50:02,031 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:50:02,033 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:50:02,036 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:50:02,037 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:50:02,038 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:50:02,041 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:50:02,041 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:50:02,041 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:50:02,043 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:50:02,043 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:50:02,045 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:50:02,045 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:50:02,046 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:50:02,046 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:50:02,046 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:50:02,047 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:50:02,047 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 12:50:02,057 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:50:02,058 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:50:02,059 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:50:02,059 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:50:02,059 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:50:02,059 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:50:02,059 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:50:02,060 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:50:02,060 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:50:02,061 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:50:02,061 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:50:02,061 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:50:02,061 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:50:02,061 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:50:02,061 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:50:02,062 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:50:02,062 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:50:02,062 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:50:02,062 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:50:02,062 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:50:02,063 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:50:02,063 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:50:02,063 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:50:02,063 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:50:02,063 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:50:02,064 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:50:02,064 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:50:02,064 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:50:02,064 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:50:02,064 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:50:02,064 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:50:02,065 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:50:02,066 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:50:02,066 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:50:02,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:50:02,118 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:50:02,123 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:50:02,125 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:50:02,125 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:50:02,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/mult_array-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:50:02,302 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:50:02,308 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:50:02,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:50:02,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:50:02,314 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:50:02,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:50:02" (1/1) ... [2018-01-24 12:50:02,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386958ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:02, skipping insertion in model container [2018-01-24 12:50:02,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:50:02" (1/1) ... [2018-01-24 12:50:02,332 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:50:02,375 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:50:02,509 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:50:02,525 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:50:02,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:02 WrapperNode [2018-01-24 12:50:02,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:50:02,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:50:02,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:50:02,532 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:50:02,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:02" (1/1) ... [2018-01-24 12:50:02,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:02" (1/1) ... [2018-01-24 12:50:02,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:02" (1/1) ... [2018-01-24 12:50:02,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:02" (1/1) ... [2018-01-24 12:50:02,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:02" (1/1) ... [2018-01-24 12:50:02,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:02" (1/1) ... [2018-01-24 12:50:02,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:02" (1/1) ... [2018-01-24 12:50:02,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:50:02,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:50:02,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:50:02,563 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:50:02,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:02" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:50:02,611 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:50:02,611 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:50:02,611 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:50:02,611 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:50:02,611 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:50:02,611 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:50:02,612 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:50:02,612 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:50:02,612 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:50:02,612 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:50:02,612 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:50:02,612 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:50:02,844 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:50:02,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:50:02 BoogieIcfgContainer [2018-01-24 12:50:02,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:50:02,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:50:02,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:50:02,847 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:50:02,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:50:02" (1/3) ... [2018-01-24 12:50:02,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2600acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:50:02, skipping insertion in model container [2018-01-24 12:50:02,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:50:02" (2/3) ... [2018-01-24 12:50:02,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2600acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:50:02, skipping insertion in model container [2018-01-24 12:50:02,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:50:02" (3/3) ... [2018-01-24 12:50:02,850 INFO L105 eAbstractionObserver]: Analyzing ICFG mult_array-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:50:02,857 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:50:02,863 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-24 12:50:02,909 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:50:02,910 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:50:02,910 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:50:02,910 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:50:02,910 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:50:02,910 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:50:02,910 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:50:02,911 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:50:02,911 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:50:02,932 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 12:50:02,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:50:02,940 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:02,941 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:02,941 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:50:02,947 INFO L82 PathProgramCache]: Analyzing trace with hash 83465695, now seen corresponding path program 1 times [2018-01-24 12:50:02,950 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:03,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:03,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:03,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:03,009 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:03,060 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:50:03,060 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:50:03,060 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-01-24 12:50:03,071 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:03,072 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 12:50:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:03,121 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 12:50:03,121 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:03,121 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:50:03,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:03,130 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:03,174 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:03,221 INFO L477 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 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:50:03,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:03,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:03,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:50:03,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-01-24 12:50:03,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:03,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:50:03,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-24 12:50:03,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:03,299 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:03,356 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:03,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-01-24 12:50:03,391 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:03,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:50:03,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:50:03,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:50:03,467 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 4 states. [2018-01-24 12:50:03,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:03,614 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-01-24 12:50:03,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:50:03,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-24 12:50:03,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:03,625 INFO L225 Difference]: With dead ends: 66 [2018-01-24 12:50:03,625 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 12:50:03,629 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:50:03,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 12:50:03,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 12:50:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 12:50:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-24 12:50:03,661 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 17 [2018-01-24 12:50:03,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:03,661 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-24 12:50:03,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:50:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-24 12:50:03,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:50:03,662 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:03,662 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:03,662 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:50:03,662 INFO L82 PathProgramCache]: Analyzing trace with hash 83465696, now seen corresponding path program 1 times [2018-01-24 12:50:03,663 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:03,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:03,664 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:03,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:03,664 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:03,673 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:50:03,673 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:50:03,674 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-01-24 12:50:03,687 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:03,688 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 12:50:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:03,717 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 12:50:03,717 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:03,718 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:50:03,729 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:03,730 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:03,755 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:03,765 INFO L477 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 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:50:03,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:03,778 INFO L477 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:50:03,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:03,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:03,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-24 12:50:03,824 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:50:03,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 21 [2018-01-24 12:50:03,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:03,876 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:50:03,877 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:50:03,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:50:03,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:03,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 12:50:03,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:27 [2018-01-24 12:50:03,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:03,998 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:04,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 10 treesize of output 3 [2018-01-24 12:50:04,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:04,147 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 12:50:04,166 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 12:50:04,166 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:04,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 14 treesize of output 5 [2018-01-24 12:50:04,169 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:04,176 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:04,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:04,180 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:27, output treesize:5 [2018-01-24 12:50:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:04,208 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:04,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2018-01-24 12:50:04,208 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:04,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:50:04,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:50:04,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:50:04,211 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2018-01-24 12:50:04,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:04,558 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-01-24 12:50:04,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:50:04,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-01-24 12:50:04,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:04,560 INFO L225 Difference]: With dead ends: 64 [2018-01-24 12:50:04,560 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 12:50:04,561 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:50:04,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 12:50:04,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-01-24 12:50:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 12:50:04,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-24 12:50:04,567 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 17 [2018-01-24 12:50:04,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:04,568 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-24 12:50:04,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:50:04,568 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-24 12:50:04,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:50:04,568 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:04,569 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:04,569 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:50:04,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1544748661, now seen corresponding path program 1 times [2018-01-24 12:50:04,569 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:04,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:04,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:04,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:04,571 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:04,579 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:50:04,579 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:50:04,579 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-01-24 12:50:04,589 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:04,589 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 12:50:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:04,619 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 12:50:04,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:04,619 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:50:04,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:04,625 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:04,638 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:04,657 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:04,699 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:04,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-01-24 12:50:04,699 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:04,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:50:04,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:50:04,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:50:04,700 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-01-24 12:50:04,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:04,769 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-01-24 12:50:04,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:50:04,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 12:50:04,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:04,770 INFO L225 Difference]: With dead ends: 46 [2018-01-24 12:50:04,770 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 12:50:04,770 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:50:04,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 12:50:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-24 12:50:04,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 12:50:04,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-24 12:50:04,776 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 19 [2018-01-24 12:50:04,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:04,776 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-24 12:50:04,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:50:04,776 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-24 12:50:04,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:50:04,777 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:04,777 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:04,777 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:50:04,777 INFO L82 PathProgramCache]: Analyzing trace with hash -301838139, now seen corresponding path program 1 times [2018-01-24 12:50:04,777 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:04,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:04,778 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:04,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:04,778 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:04,786 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:50:04,786 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:50:04,786 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-01-24 12:50:04,796 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:04,796 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 12:50:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:04,826 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 12:50:04,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:04,826 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:50:04,836 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:04,837 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:04,856 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:04,891 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:04,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:04,939 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:04,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2018-01-24 12:50:04,940 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:04,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:50:04,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:50:04,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:50:04,941 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 5 states. [2018-01-24 12:50:05,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:05,001 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-01-24 12:50:05,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:50:05,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-24 12:50:05,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:05,003 INFO L225 Difference]: With dead ends: 94 [2018-01-24 12:50:05,003 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 12:50:05,004 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:50:05,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 12:50:05,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2018-01-24 12:50:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 12:50:05,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-24 12:50:05,013 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 22 [2018-01-24 12:50:05,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:05,013 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-24 12:50:05,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:50:05,013 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-24 12:50:05,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:50:05,014 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:05,015 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:05,015 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:50:05,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1322906493, now seen corresponding path program 1 times [2018-01-24 12:50:05,015 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:05,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:05,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:05,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:05,016 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:05,024 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:50:05,024 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:50:05,024 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-01-24 12:50:05,030 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:05,030 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 12:50:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:05,057 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 12:50:05,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:05,057 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:50:05,062 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:05,062 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:05,078 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:05,082 INFO L477 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 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:50:05,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:05,088 INFO L477 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 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:50:05,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:05,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:05,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-24 12:50:05,110 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:50:05,111 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:50:05,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:50:05,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:05,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 21 [2018-01-24 12:50:05,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:05,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:50:05,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:24 [2018-01-24 12:50:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:05,222 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:05,436 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:05,436 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:50:05,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:05,439 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:05,468 ERROR L243 seRefinementStrategy]: Caught known exception: A non-linear fact was asserted to arithmetic in a linear logic. [2018-01-24 12:50:05,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:50:05,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-01-24 12:50:05,468 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:50:05,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:50:05,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:50:05,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:50:05,470 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 14 states. [2018-01-24 12:50:05,668 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 56 DAG size of output 55 [2018-01-24 12:50:07,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:07,393 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-01-24 12:50:07,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:50:07,393 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2018-01-24 12:50:07,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:07,395 INFO L225 Difference]: With dead ends: 56 [2018-01-24 12:50:07,395 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 12:50:07,396 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2018-01-24 12:50:07,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 12:50:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-01-24 12:50:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 12:50:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-24 12:50:07,408 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 22 [2018-01-24 12:50:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:07,409 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-24 12:50:07,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:50:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-24 12:50:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 12:50:07,410 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:07,410 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:07,410 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:50:07,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1599933162, now seen corresponding path program 1 times [2018-01-24 12:50:07,411 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:07,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:07,412 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:07,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:07,412 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:07,420 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:50:07,420 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:50:07,420 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2018-01-24 12:50:07,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:07,429 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:50:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:07,490 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 12:50:07,490 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:07,491 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:50:07,499 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:07,499 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:07,532 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:07,650 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:07,909 WARN L146 SmtUtils]: Spent 233ms on a formula simplification. DAG size of input: 64 DAG size of output 38 [2018-01-24 12:50:09,930 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse7 (< c_main_~length~2 0)) (.cse8 (<= 0 c_main_~length~2))) (and (forall ((v_prenex_10 Int)) (let ((.cse3 (* 4 (mod v_prenex_10 c_main_~length~2)))) (let ((.cse0 (+ c_main_~arr~2.offset .cse3 4)) (.cse2 (* 4 c_main_~length~2)) (.cse1 (select |c_#length| c_main_~arr~2.base))) (or (< v_prenex_10 (+ c_main_~i~2 1)) (<= .cse0 (+ .cse1 .cse2)) (<= .cse0 .cse1) (<= (+ c_main_~arr~2.offset .cse2 .cse3 4) .cse1))))) (forall ((v_prenex_11 Int)) (or (<= (+ c_main_~arr~2.offset (* 4 (mod v_prenex_11 c_main_~length~2)) 4) (select |c_#length| c_main_~arr~2.base)) (< v_prenex_11 (+ c_main_~i~2 1)) (< v_prenex_11 0))) (forall ((v_prenex_9 Int)) (let ((.cse4 (mod v_prenex_9 c_main_~length~2))) (let ((.cse6 (* 4 c_main_~length~2)) (.cse5 (* 4 .cse4))) (or (= 0 .cse4) (<= 0 (+ .cse5 c_main_~arr~2.offset .cse6)) (< v_prenex_9 (+ c_main_~i~2 1)) (<= 0 v_prenex_9) (<= .cse6 (+ .cse5 c_main_~arr~2.offset)))))) (or .cse7 .cse8 (forall ((v_prenex_8 Int)) (or (<= 0 (+ (* 4 (mod v_prenex_8 c_main_~length~2)) c_main_~arr~2.offset)) (< v_prenex_8 (+ c_main_~i~2 1))))) (or .cse7 (forall ((v_prenex_12 Int)) (let ((.cse9 (mod v_prenex_12 c_main_~length~2))) (or (<= 0 v_prenex_12) (<= (* 4 c_main_~length~2) (+ c_main_~arr~2.offset (* 4 .cse9))) (= 0 .cse9) (< v_prenex_12 (+ c_main_~i~2 1)))))) (or .cse7 (forall ((v_prenex_5 Int)) (let ((.cse10 (+ c_main_~arr~2.offset (* 4 (mod v_prenex_5 c_main_~length~2))))) (or (< v_prenex_5 (+ c_main_~i~2 1)) (<= 0 .cse10) (<= (* 4 c_main_~length~2) .cse10))))) (or (forall ((v_prenex_13 Int)) (let ((.cse11 (mod v_prenex_13 c_main_~length~2))) (or (<= 0 v_prenex_13) (= 0 .cse11) (< v_prenex_13 (+ c_main_~i~2 1)) (<= 0 (+ (* 4 .cse11) c_main_~arr~2.offset (* 4 c_main_~length~2)))))) .cse8) (forall ((v_main_~i~2_20 Int)) (let ((.cse12 (mod v_main_~i~2_20 c_main_~length~2))) (or (<= (+ c_main_~arr~2.offset (* 4 .cse12) 4) (select |c_#length| c_main_~arr~2.base)) (< v_main_~i~2_20 (+ c_main_~i~2 1)) (not (= 0 .cse12))))) (or .cse7 (forall ((v_prenex_6 Int)) (or (< v_prenex_6 (+ c_main_~i~2 1)) (= 0 (mod v_prenex_6 c_main_~length~2)) (<= 0 v_prenex_6))) .cse8) (or (forall ((v_prenex_7 Int)) (let ((.cse13 (* 4 (mod v_prenex_7 c_main_~length~2)))) (or (<= 0 (+ .cse13 c_main_~arr~2.offset (* 4 c_main_~length~2))) (<= 0 (+ .cse13 c_main_~arr~2.offset)) (< v_prenex_7 (+ c_main_~i~2 1))))) .cse8) (forall ((v_prenex_14 Int)) (let ((.cse14 (* 4 (mod v_prenex_14 c_main_~length~2)))) (let ((.cse15 (* 4 c_main_~length~2)) (.cse16 (+ c_main_~arr~2.offset .cse14))) (or (< v_prenex_14 (+ c_main_~i~2 1)) (<= 0 (+ c_main_~arr~2.offset .cse14 .cse15)) (<= 0 .cse16) (<= .cse15 .cse16))))))) is different from false [2018-01-24 12:50:09,972 INFO L477 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 40 treesize of output 38 [2018-01-24 12:50:09,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:10,284 INFO L477 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 32 treesize of output 28 [2018-01-24 12:50:10,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:10,441 INFO L477 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 35 treesize of output 31 [2018-01-24 12:50:10,442 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:10,691 INFO L477 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 29 treesize of output 27 [2018-01-24 12:50:10,692 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:10,807 INFO L477 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 29 treesize of output 27 [2018-01-24 12:50:10,808 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:11,059 INFO L477 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 48 treesize of output 46 [2018-01-24 12:50:11,060 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:11,287 INFO L477 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 39 treesize of output 37 [2018-01-24 12:50:11,288 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:11,560 INFO L477 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 40 treesize of output 38 [2018-01-24 12:50:11,561 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:11,872 INFO L477 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 48 treesize of output 42 [2018-01-24 12:50:11,873 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:12,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 22 dim-0 vars, 11 dim-1 vars, End of recursive call: 9 dim-0 vars, and 9 xjuncts. [2018-01-24 12:50:12,349 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 33 variables, input treesize:448, output treesize:238 [2018-01-24 12:50:14,354 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse9 (<= 0 c_main_~length~2)) (.cse3 (< c_main_~length~2 0))) (and (forall ((v_prenex_11 Int)) (or (< v_prenex_11 (+ c_main_~i~2 1)) (< (* 4 (mod v_prenex_11 c_main_~length~2)) (+ (* 4 c_main_~i~2) 1)) (< v_prenex_11 0))) (forall ((v_prenex_9 Int)) (let ((.cse0 (mod v_prenex_9 c_main_~length~2))) (let ((.cse2 (* 4 c_main_~length~2)) (.cse1 (* 4 .cse0))) (or (= 0 .cse0) (<= 0 (+ .cse1 c_main_~arr~2.offset .cse2)) (< v_prenex_9 (+ c_main_~i~2 1)) (<= 0 v_prenex_9) (<= .cse2 (+ .cse1 c_main_~arr~2.offset)))))) (or .cse3 (forall ((v_prenex_12 Int)) (let ((.cse4 (mod v_prenex_12 c_main_~length~2))) (or (<= 0 v_prenex_12) (<= (* 4 c_main_~length~2) (+ c_main_~arr~2.offset (* 4 .cse4))) (= 0 .cse4) (< v_prenex_12 (+ c_main_~i~2 1)))))) (forall ((v_prenex_10 Int)) (let ((.cse6 (* 4 (mod v_prenex_10 c_main_~length~2))) (.cse7 (* 4 c_main_~i~2)) (.cse5 (* 4 c_main_~length~2))) (or (< v_prenex_10 (+ c_main_~i~2 1)) (< (+ .cse5 .cse6) (+ .cse7 1)) (< .cse6 (+ .cse7 .cse5 1))))) (or (forall ((v_prenex_13 Int)) (let ((.cse8 (mod v_prenex_13 c_main_~length~2))) (or (<= 0 v_prenex_13) (= 0 .cse8) (< v_prenex_13 (+ c_main_~i~2 1)) (<= 0 (+ (* 4 .cse8) c_main_~arr~2.offset (* 4 c_main_~length~2)))))) .cse9) (forall ((v_main_~i~2_20 Int)) (let ((.cse10 (mod v_main_~i~2_20 c_main_~length~2))) (or (< (* 4 .cse10) (+ (* 4 c_main_~i~2) 1)) (< v_main_~i~2_20 (+ c_main_~i~2 1)) (not (= 0 .cse10))))) (or (forall ((v_prenex_7 Int)) (or (<= 0 (+ (* 4 (mod v_prenex_7 c_main_~length~2)) c_main_~arr~2.offset)) (< v_prenex_7 (+ c_main_~i~2 1)))) .cse9) (or .cse3 (forall ((v_prenex_5 Int)) (or (< v_prenex_5 (+ c_main_~i~2 1)) (<= 0 (+ c_main_~arr~2.offset (* 4 (mod v_prenex_5 c_main_~length~2))))))) (forall ((v_prenex_14 Int)) (let ((.cse12 (* 4 c_main_~length~2)) (.cse11 (* 4 (mod v_prenex_14 c_main_~length~2)))) (or (< v_prenex_14 (+ c_main_~i~2 1)) (<= 0 (+ c_main_~arr~2.offset .cse11 .cse12)) (<= .cse12 (+ c_main_~arr~2.offset .cse11))))))) is different from false [2018-01-24 12:50:18,601 WARN L146 SmtUtils]: Spent 4154ms on a formula simplification. DAG size of input: 113 DAG size of output 27 [2018-01-24 12:50:19,346 WARN L1007 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_37 Int) (v_prenex_11 Int)) (or (< (* 4 (mod v_prenex_11 c_main_~length~2)) (+ (* 4 v_prenex_37) 1)) (< v_prenex_11 0) (< v_prenex_11 (+ v_prenex_37 1)) (< v_prenex_37 0))) (forall ((v_prenex_7 Int)) (or (< 0 (+ |c_main_#t~malloc2.offset| (* 4 (mod v_prenex_7 c_main_~length~2)) 1)) (< v_prenex_7 1)))) is different from false [2018-01-24 12:50:22,559 WARN L143 SmtUtils]: Spent 576ms on a formula simplification that was a NOOP. DAG size: 26 [2018-01-24 12:50:22,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-24 12:50:22,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:50:22,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-01-24 12:50:22,596 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:22,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:50:22,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:50:22,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=68, Unknown=7, NotChecked=60, Total=182 [2018-01-24 12:50:22,597 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 8 states. [2018-01-24 12:50:22,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:22,705 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-01-24 12:50:22,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:50:22,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-24 12:50:22,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:22,707 INFO L225 Difference]: With dead ends: 69 [2018-01-24 12:50:22,707 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 12:50:22,707 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=87, Invalid=128, Unknown=7, NotChecked=84, Total=306 [2018-01-24 12:50:22,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 12:50:22,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2018-01-24 12:50:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 12:50:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2018-01-24 12:50:22,715 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 25 [2018-01-24 12:50:22,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:22,715 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2018-01-24 12:50:22,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:50:22,716 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2018-01-24 12:50:22,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 12:50:22,716 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:22,716 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:22,716 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 12:50:22,716 INFO L82 PathProgramCache]: Analyzing trace with hash -89010580, now seen corresponding path program 1 times [2018-01-24 12:50:22,717 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:22,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:22,717 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:22,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:22,717 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:22,722 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:50:22,722 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:50:22,722 INFO L164 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-24 12:50:22,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:22,732 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-01-24 12:50:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:22,759 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 12:50:22,759 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:22,759 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:50:22,767 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:22,767 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:22,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:22,834 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:22,993 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 64 DAG size of output 38 [2018-01-24 12:50:23,112 INFO L477 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 39 treesize of output 35 [2018-01-24 12:50:23,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:23,233 INFO L477 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 36 treesize of output 32 [2018-01-24 12:50:23,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:23,319 INFO L477 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 48 treesize of output 42 [2018-01-24 12:50:23,319 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:23,342 INFO L477 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 28 treesize of output 26 [2018-01-24 12:50:23,343 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:23,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:50:23,351 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:272, output treesize:37 [2018-01-24 12:50:42,167 WARN L143 SmtUtils]: Spent 863ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-24 12:50:55,925 WARN L143 SmtUtils]: Spent 898ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-24 12:51:03,975 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:226) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.checkSat(DiffWrapperScript.java:205) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:1068) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:942) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:355) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:573) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:328) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) 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:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1369) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:582) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 40 more [2018-01-24 12:51:03,979 INFO L168 Benchmark]: Toolchain (without parser) took 61675.53 ms. Allocated memory was 305.1 MB in the beginning and 527.4 MB in the end (delta: 222.3 MB). Free memory was 265.2 MB in the beginning and 461.8 MB in the end (delta: -196.7 MB). Peak memory consumption was 25.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:51:03,980 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 305.1 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:51:03,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.17 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 254.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-24 12:51:03,980 INFO L168 Benchmark]: Boogie Preprocessor took 30.61 ms. Allocated memory is still 305.1 MB. Free memory was 254.0 MB in the beginning and 253.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 12:51:03,981 INFO L168 Benchmark]: RCFGBuilder took 281.92 ms. Allocated memory is still 305.1 MB. Free memory was 252.0 MB in the beginning and 235.3 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:51:03,981 INFO L168 Benchmark]: TraceAbstraction took 61132.61 ms. Allocated memory was 305.1 MB in the beginning and 527.4 MB in the end (delta: 222.3 MB). Free memory was 235.3 MB in the beginning and 461.8 MB in the end (delta: -226.5 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:51:03,984 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 305.1 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 223.17 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 254.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.61 ms. Allocated memory is still 305.1 MB. Free memory was 254.0 MB in the beginning and 253.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 281.92 ms. Allocated memory is still 305.1 MB. Free memory was 252.0 MB in the beginning and 235.3 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 61132.61 ms. Allocated memory was 305.1 MB in the beginning and 527.4 MB in the end (delta: 222.3 MB). Free memory was 235.3 MB in the beginning and 461.8 MB in the end (delta: -226.5 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/mult_array-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-51-03-994.csv Received shutdown request...