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/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-buckets_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:29:28,345 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:29:28,347 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:29:28,359 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:29:28,359 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:29:28,360 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:29:28,361 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:29:28,363 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:29:28,364 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:29:28,365 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:29:28,366 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:29:28,366 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:29:28,367 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:29:28,368 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:29:28,369 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:29:28,371 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:29:28,373 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:29:28,375 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:29:28,376 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:29:28,378 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:29:28,380 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:29:28,380 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:29:28,380 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:29:28,381 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:29:28,382 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:29:28,383 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:29:28,384 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:29:28,384 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:29:28,384 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:29:28,385 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:29:28,385 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:29:28,385 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-20 22:29:28,395 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:29:28,395 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:29:28,396 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:29:28,396 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:29:28,396 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:29:28,396 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:29:28,397 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:29:28,397 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:29:28,397 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:29:28,398 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:29:28,398 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:29:28,398 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:29:28,398 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:29:28,398 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:29:28,398 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:29:28,399 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:29:28,399 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:29:28,399 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:29:28,399 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:29:28,399 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:29:28,400 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:29:28,400 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:29:28,400 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:29:28,400 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:29:28,400 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:29:28,401 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:29:28,401 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:29:28,401 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:29:28,401 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:29:28,401 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:29:28,401 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:29:28,402 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:29:28,402 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:29:28,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:29:28,402 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:29:28,403 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:29:28,403 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:29:28,436 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:29:28,448 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:29:28,452 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:29:28,454 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:29:28,454 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:29:28,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-01-20 22:29:28,618 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:29:28,623 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:29:28,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:29:28,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:29:28,629 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:29:28,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:29:28" (1/1) ... [2018-01-20 22:29:28,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44478139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:28, skipping insertion in model container [2018-01-20 22:29:28,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:29:28" (1/1) ... [2018-01-20 22:29:28,651 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:29:28,696 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:29:28,815 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:29:28,841 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:29:28,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:28 WrapperNode [2018-01-20 22:29:28,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:29:28,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:29:28,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:29:28,851 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:29:28,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:28" (1/1) ... [2018-01-20 22:29:28,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:28" (1/1) ... [2018-01-20 22:29:28,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:28" (1/1) ... [2018-01-20 22:29:28,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:28" (1/1) ... [2018-01-20 22:29:28,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:28" (1/1) ... [2018-01-20 22:29:28,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:28" (1/1) ... [2018-01-20 22:29:28,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:28" (1/1) ... [2018-01-20 22:29:28,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:29:28,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:29:28,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:29:28,888 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:29:28,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:28" (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-20 22:29:28,931 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:29:28,932 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:29:28,932 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:29:28,932 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:29:28,932 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:29:28,932 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 22:29:28,932 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 22:29:28,933 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:29:28,933 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:29:28,933 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:29:28,933 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:29:28,933 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:29:28,933 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:29:28,934 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-20 22:29:28,934 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:29:28,934 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:29:28,934 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:29:29,342 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:29:29,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:29:29 BoogieIcfgContainer [2018-01-20 22:29:29,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:29:29,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:29:29,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:29:29,346 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:29:29,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:29:28" (1/3) ... [2018-01-20 22:29:29,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704c36cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:29:29, skipping insertion in model container [2018-01-20 22:29:29,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:28" (2/3) ... [2018-01-20 22:29:29,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704c36cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:29:29, skipping insertion in model container [2018-01-20 22:29:29,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:29:29" (3/3) ... [2018-01-20 22:29:29,349 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-01-20 22:29:29,355 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:29:29,361 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-20 22:29:29,406 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:29:29,406 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:29:29,407 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:29:29,407 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:29:29,407 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:29:29,407 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:29:29,407 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:29:29,407 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:29:29,408 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:29:29,429 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2018-01-20 22:29:29,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:29:29,435 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:29,436 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:29:29,436 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:29:29,441 INFO L82 PathProgramCache]: Analyzing trace with hash 258952, now seen corresponding path program 1 times [2018-01-20 22:29:29,443 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:29,443 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:29,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:29,485 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:29,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:29:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:29:29,542 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:29:29,548 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:29:29,553 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:29:29,554 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:29:29,554 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:29:29,554 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:29:29,554 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:29:29,554 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:29:29,554 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:29:29,554 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:29:29,554 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:29:29,557 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2018-01-20 22:29:29,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-20 22:29:29,559 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:29,559 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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-20 22:29:29,559 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:29:29,560 INFO L82 PathProgramCache]: Analyzing trace with hash -806241979, now seen corresponding path program 1 times [2018-01-20 22:29:29,560 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:29,560 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:29,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:29,561 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:29,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:29,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:29,755 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-20 22:29:29,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:29:29,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:29:29,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:29:29,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:29:29,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:29:29,771 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 2 states. [2018-01-20 22:29:29,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:29:29,796 INFO L93 Difference]: Finished difference Result 164 states and 218 transitions. [2018-01-20 22:29:29,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:29:29,798 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-01-20 22:29:29,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:29:29,808 INFO L225 Difference]: With dead ends: 164 [2018-01-20 22:29:29,808 INFO L226 Difference]: Without dead ends: 91 [2018-01-20 22:29:29,811 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:29:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-20 22:29:29,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-01-20 22:29:29,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-20 22:29:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2018-01-20 22:29:29,847 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 30 [2018-01-20 22:29:29,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:29:29,848 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2018-01-20 22:29:29,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:29:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2018-01-20 22:29:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-20 22:29:29,849 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:29,849 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:29:29,849 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:29:29,849 INFO L82 PathProgramCache]: Analyzing trace with hash -956225716, now seen corresponding path program 1 times [2018-01-20 22:29:29,849 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:29,850 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:29,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:29,851 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:29,851 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:29,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:30,000 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-20 22:29:30,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:29:30,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:29:30,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:29:30,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:29:30,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:29:30,003 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 5 states. [2018-01-20 22:29:30,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:29:30,246 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2018-01-20 22:29:30,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:29:30,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-20 22:29:30,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:29:30,248 INFO L225 Difference]: With dead ends: 153 [2018-01-20 22:29:30,249 INFO L226 Difference]: Without dead ends: 148 [2018-01-20 22:29:30,250 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:29:30,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-20 22:29:30,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 93. [2018-01-20 22:29:30,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-20 22:29:30,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-01-20 22:29:30,262 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 33 [2018-01-20 22:29:30,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:29:30,263 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-01-20 22:29:30,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:29:30,263 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-01-20 22:29:30,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-20 22:29:30,265 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:30,265 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, 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-20 22:29:30,265 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:29:30,265 INFO L82 PathProgramCache]: Analyzing trace with hash -912780865, now seen corresponding path program 1 times [2018-01-20 22:29:30,265 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:30,265 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:30,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:30,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:30,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:30,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:31,084 WARN L146 SmtUtils]: Spent 357ms on a formula simplification. DAG size of input: 47 DAG size of output 35 [2018-01-20 22:29:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:29:31,314 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:29:31,314 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:29:31,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:31,369 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:29:31,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:29:31,591 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-20 22:29:31,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:31,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:31,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:31,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:30 [2018-01-20 22:29:31,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-01-20 22:29:31,650 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-01-20 22:29:31,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:31,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:31,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:31,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2018-01-20 22:29:31,966 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~bucket~5.base Int) (|main_#t~malloc8.base| Int) (main_~bcki~5.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~bucket~5.base 1))) (let ((.cse1 (store .cse0 main_~bcki~5.base 1))) (and (= 0 (select .cse0 main_~bcki~5.base)) (= 0 (select .cse1 |main_#t~malloc8.base|)) (= |c_#valid| (store (store .cse1 |main_#t~malloc8.base| 1) main_~bucket~5.base 0)) (not (= 0 main_~bucket~5.base)))))) is different from true [2018-01-20 22:29:31,998 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-20 22:29:32,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:29:32,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-01-20 22:29:32,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-20 22:29:32,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-20 22:29:32,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=4, NotChecked=34, Total=380 [2018-01-20 22:29:32,022 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 20 states. [2018-01-20 22:29:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:29:32,771 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2018-01-20 22:29:32,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-20 22:29:32,771 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2018-01-20 22:29:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:29:32,775 INFO L225 Difference]: With dead ends: 207 [2018-01-20 22:29:32,776 INFO L226 Difference]: Without dead ends: 202 [2018-01-20 22:29:32,777 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=136, Invalid=561, Unknown=9, NotChecked=50, Total=756 [2018-01-20 22:29:32,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-20 22:29:32,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 112. [2018-01-20 22:29:32,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-20 22:29:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-01-20 22:29:32,793 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 48 [2018-01-20 22:29:32,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:29:32,793 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-01-20 22:29:32,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-20 22:29:32,794 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-01-20 22:29:32,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-20 22:29:32,796 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:32,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:29:32,796 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:29:32,796 INFO L82 PathProgramCache]: Analyzing trace with hash 773059570, now seen corresponding path program 1 times [2018-01-20 22:29:32,796 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:32,797 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:32,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:32,798 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:32,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:32,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:33,413 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 68 DAG size of output 43 [2018-01-20 22:29:33,598 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 75 DAG size of output 45 [2018-01-20 22:29:33,790 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 73 DAG size of output 45 [2018-01-20 22:29:33,926 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 63 DAG size of output 39 [2018-01-20 22:29:34,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:29:34,599 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:29:34,599 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-20 22:29:34,604 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:34,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:29:34,646 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-20 22:29:34,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:34,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:34,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:29:34,708 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:34,708 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:34,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-20 22:29:34,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:34,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:34,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:22 [2018-01-20 22:29:34,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:29:34,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-20 22:29:34,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:34,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:34,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:34,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 [2018-01-20 22:29:34,889 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:34,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2018-01-20 22:29:34,893 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 16 treesize of output 1 [2018-01-20 22:29:34,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:34,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:34,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:34,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:38 [2018-01-20 22:29:34,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:34,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-01-20 22:29:34,911 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 10 treesize of output 9 [2018-01-20 22:29:34,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:34,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:34,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:34,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-20 22:29:34,964 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:34,965 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:34,965 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:34,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-20 22:29:34,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:34,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:34,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:45 [2018-01-20 22:29:35,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:35,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-01-20 22:29:35,021 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:35,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-20 22:29:35,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:35,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:35,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:35,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:53 [2018-01-20 22:29:35,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:35,195 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:35,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 88 [2018-01-20 22:29:35,203 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 16 treesize of output 1 [2018-01-20 22:29:35,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:35,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:35,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:29:35,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:61 [2018-01-20 22:29:35,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:35,288 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:35,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 82 [2018-01-20 22:29:35,297 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 10 treesize of output 9 [2018-01-20 22:29:35,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:35,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:35,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:29:35,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:70 [2018-01-20 22:29:35,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 75 [2018-01-20 22:29:35,376 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:35,377 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 24 treesize of output 39 [2018-01-20 22:29:35,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:35,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:35,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:29:35,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:102, output treesize:90 [2018-01-20 22:29:35,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 78 [2018-01-20 22:29:35,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 80 [2018-01-20 22:29:35,577 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:29:35,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:29:35,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-01-20 22:29:35,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:172 [2018-01-20 22:29:35,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 66 [2018-01-20 22:29:35,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:35,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-01-20 22:29:35,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:35,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:35,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-01-20 22:29:35,899 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:35,909 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:35,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-01-20 22:29:35,910 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:35,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:35,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 68 [2018-01-20 22:29:35,963 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:35,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2018-01-20 22:29:35,970 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-20 22:29:36,002 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:36,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-01-20 22:29:36,004 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:36,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:36,017 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-01-20 22:29:36,018 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:36,019 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:36,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2018-01-20 22:29:36,020 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:36,029 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:29:36,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:29:36,038 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:186, output treesize:28 [2018-01-20 22:29:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:29:36,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:29:36,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2018-01-20 22:29:36,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-20 22:29:36,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-20 22:29:36,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1352, Unknown=0, NotChecked=0, Total=1482 [2018-01-20 22:29:36,218 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 39 states. [2018-01-20 22:29:36,776 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 74 DAG size of output 55 [2018-01-20 22:29:36,968 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 86 DAG size of output 58 [2018-01-20 22:29:37,168 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 86 DAG size of output 58 [2018-01-20 22:29:37,560 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 92 DAG size of output 64 [2018-01-20 22:29:37,989 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 99 DAG size of output 73 [2018-01-20 22:29:38,205 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 122 DAG size of output 88 [2018-01-20 22:29:38,887 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 104 DAG size of output 100 [2018-01-20 22:29:39,317 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 108 DAG size of output 108 [2018-01-20 22:29:39,661 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 99 DAG size of output 99 [2018-01-20 22:29:39,856 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 105 DAG size of output 105 [2018-01-20 22:29:41,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:29:41,568 INFO L93 Difference]: Finished difference Result 367 states and 398 transitions. [2018-01-20 22:29:41,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-20 22:29:41,608 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 58 [2018-01-20 22:29:41,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:29:41,610 INFO L225 Difference]: With dead ends: 367 [2018-01-20 22:29:41,610 INFO L226 Difference]: Without dead ends: 360 [2018-01-20 22:29:41,613 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1271 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=745, Invalid=5107, Unknown=0, NotChecked=0, Total=5852 [2018-01-20 22:29:41,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-01-20 22:29:41,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 137. [2018-01-20 22:29:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-20 22:29:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2018-01-20 22:29:41,636 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 58 [2018-01-20 22:29:41,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:29:41,636 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2018-01-20 22:29:41,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-20 22:29:41,636 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2018-01-20 22:29:41,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-20 22:29:41,637 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:41,638 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:29:41,638 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:29:41,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1697079073, now seen corresponding path program 2 times [2018-01-20 22:29:41,638 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:41,638 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:41,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:41,639 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:41,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:41,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:42,377 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:29:42,377 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:29:42,377 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:29:42,382 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:29:42,399 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:29:42,454 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:29:42,457 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:29:42,463 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:29:42,466 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-20 22:29:42,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:29:42,475 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:42,476 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:42,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-01-20 22:29:42,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-01-20 22:29:42,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:29:42,507 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-20 22:29:42,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:29:42,518 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:29:42,518 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,520 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,526 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2018-01-20 22:29:42,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-01-20 22:29:42,552 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-01-20 22:29:42,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:36 [2018-01-20 22:29:42,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:42,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-01-20 22:29:42,615 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 16 treesize of output 1 [2018-01-20 22:29:42,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2018-01-20 22:29:42,631 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:42,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-01-20 22:29:42,635 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 10 treesize of output 9 [2018-01-20 22:29:42,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-01-20 22:29:42,687 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:42,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:42,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:42,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-20 22:29:42,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:47 [2018-01-20 22:29:42,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:42,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:42,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2018-01-20 22:29:42,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:42,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-01-20 22:29:42,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:51 [2018-01-20 22:29:42,861 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:42,862 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:42,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:42,864 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:42,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 96 [2018-01-20 22:29:42,872 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 16 treesize of output 1 [2018-01-20 22:29:42,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:42,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:87, output treesize:60 [2018-01-20 22:29:42,915 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:42,915 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:42,916 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:42,918 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:42,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 90 [2018-01-20 22:29:42,923 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 10 treesize of output 9 [2018-01-20 22:29:42,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:43,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:43,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:43,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:81, output treesize:69 [2018-01-20 22:29:43,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:43,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:43,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 83 [2018-01-20 22:29:43,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:43,272 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 24 treesize of output 39 [2018-01-20 22:29:43,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:43,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:43,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:29:43,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:89 [2018-01-20 22:29:43,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:43,448 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:43,449 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:43,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 97 [2018-01-20 22:29:43,458 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:43,472 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 146 [2018-01-20 22:29:43,474 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:29:43,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:43,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:29:43,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:98 [2018-01-20 22:29:43,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:43,830 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:43,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 87 [2018-01-20 22:29:43,852 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:43,880 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 95 [2018-01-20 22:29:43,888 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-01-20 22:29:44,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-01-20 22:29:44,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 18 dim-0 vars, and 6 xjuncts. [2018-01-20 22:29:44,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:553 [2018-01-20 22:29:54,379 WARN L146 SmtUtils]: Spent 10086ms on a formula simplification. DAG size of input: 177 DAG size of output 69 [2018-01-20 22:29:54,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 69 [2018-01-20 22:29:54,514 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:54,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:54,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:54,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-20 22:29:54,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:54,530 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:54,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-01-20 22:29:54,531 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:54,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-20 22:29:54,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:54,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:54,563 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:54,565 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:54,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 90 [2018-01-20 22:29:54,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:54,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-01-20 22:29:54,569 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:54,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:54,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2018-01-20 22:29:54,589 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-20 22:29:54,599 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:54,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 58 [2018-01-20 22:29:54,614 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 5 xjuncts. [2018-01-20 22:29:54,651 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:29:54,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-20 22:29:54,679 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:239, output treesize:50 [2018-01-20 22:29:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:29:54,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:29:54,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 41 [2018-01-20 22:29:54,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-20 22:29:54,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-20 22:29:54,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1507, Unknown=0, NotChecked=0, Total=1640 [2018-01-20 22:29:54,872 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand 41 states. [2018-01-20 22:29:57,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:29:57,265 INFO L93 Difference]: Finished difference Result 234 states and 250 transitions. [2018-01-20 22:29:57,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-20 22:29:57,265 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 73 [2018-01-20 22:29:57,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:29:57,266 INFO L225 Difference]: With dead ends: 234 [2018-01-20 22:29:57,266 INFO L226 Difference]: Without dead ends: 229 [2018-01-20 22:29:57,267 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=494, Invalid=3666, Unknown=0, NotChecked=0, Total=4160 [2018-01-20 22:29:57,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-01-20 22:29:57,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 143. [2018-01-20 22:29:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-20 22:29:57,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-01-20 22:29:57,285 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 73 [2018-01-20 22:29:57,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:29:57,285 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-01-20 22:29:57,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-20 22:29:57,286 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-01-20 22:29:57,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-20 22:29:57,287 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:57,287 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:29:57,287 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:29:57,288 INFO L82 PathProgramCache]: Analyzing trace with hash -2011199221, now seen corresponding path program 1 times [2018-01-20 22:29:57,288 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:57,288 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:57,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:57,289 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:29:57,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:57,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:29:58,128 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:29:58,128 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-20 22:29:58,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:58,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:29:58,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-01-20 22:29:58,357 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:29:58,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:58,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:58,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:58,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-01-20 22:29:58,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 14 [2018-01-20 22:29:58,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2018-01-20 22:29:58,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:29:58,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:29:58,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:29:58,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:11 [2018-01-20 22:29:58,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:29:58,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:29:58,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2018-01-20 22:29:58,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-20 22:29:58,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-20 22:29:58,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2018-01-20 22:29:58,554 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 28 states. [2018-01-20 22:30:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:30:00,973 INFO L93 Difference]: Finished difference Result 359 states and 390 transitions. [2018-01-20 22:30:00,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-20 22:30:00,973 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 74 [2018-01-20 22:30:00,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:30:00,974 INFO L225 Difference]: With dead ends: 359 [2018-01-20 22:30:00,975 INFO L226 Difference]: Without dead ends: 329 [2018-01-20 22:30:00,976 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=681, Invalid=2979, Unknown=0, NotChecked=0, Total=3660 [2018-01-20 22:30:00,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-01-20 22:30:00,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 171. [2018-01-20 22:30:00,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-20 22:30:00,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 185 transitions. [2018-01-20 22:30:00,993 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 185 transitions. Word has length 74 [2018-01-20 22:30:00,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:30:00,994 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 185 transitions. [2018-01-20 22:30:00,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-20 22:30:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 185 transitions. [2018-01-20 22:30:00,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-01-20 22:30:00,995 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:30:00,995 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:30:00,996 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:30:00,996 INFO L82 PathProgramCache]: Analyzing trace with hash 894038559, now seen corresponding path program 2 times [2018-01-20 22:30:00,996 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:30:00,996 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:30:00,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:30:00,996 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:30:00,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:30:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:30:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:30:01,082 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:30:01,095 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:30:01,110 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:30:01,111 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:30:01,134 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:30:01,134 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:30:01,134 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:30:01,134 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:30:01,134 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:30:01,134 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:30:01,135 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:30:01,135 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:30:01,135 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:30:01,136 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2018-01-20 22:30:01,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-20 22:30:01,137 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:30:01,137 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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-20 22:30:01,137 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:30:01,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1183517258, now seen corresponding path program 1 times [2018-01-20 22:30:01,138 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:30:01,138 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:30:01,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:30:01,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:30:01,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:30:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:30:01,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:30:01,157 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-20 22:30:01,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:30:01,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:30:01,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:30:01,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:30:01,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:30:01,158 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 2 states. [2018-01-20 22:30:01,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:30:01,163 INFO L93 Difference]: Finished difference Result 164 states and 218 transitions. [2018-01-20 22:30:01,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:30:01,163 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-01-20 22:30:01,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:30:01,164 INFO L225 Difference]: With dead ends: 164 [2018-01-20 22:30:01,164 INFO L226 Difference]: Without dead ends: 89 [2018-01-20 22:30:01,165 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:30:01,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-20 22:30:01,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-01-20 22:30:01,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-20 22:30:01,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-01-20 22:30:01,170 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 28 [2018-01-20 22:30:01,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:30:01,170 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-01-20 22:30:01,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:30:01,170 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-01-20 22:30:01,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-20 22:30:01,171 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:30:01,171 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:30:01,171 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 22:30:01,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1931719151, now seen corresponding path program 1 times [2018-01-20 22:30:01,171 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:30:01,171 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:30:01,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:30:01,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:30:01,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:30:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:30:01,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:30:01,251 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-20 22:30:01,251 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:30:01,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:30:01,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:30:01,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:30:01,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:30:01,252 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 5 states. [2018-01-20 22:30:01,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:30:01,331 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2018-01-20 22:30:01,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:30:01,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-20 22:30:01,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:30:01,332 INFO L225 Difference]: With dead ends: 149 [2018-01-20 22:30:01,332 INFO L226 Difference]: Without dead ends: 146 [2018-01-20 22:30:01,333 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:30:01,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-20 22:30:01,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 91. [2018-01-20 22:30:01,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-20 22:30:01,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2018-01-20 22:30:01,337 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 31 [2018-01-20 22:30:01,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:30:01,338 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2018-01-20 22:30:01,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:30:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2018-01-20 22:30:01,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-20 22:30:01,338 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:30:01,339 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:30:01,339 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 22:30:01,339 INFO L82 PathProgramCache]: Analyzing trace with hash 83966276, now seen corresponding path program 1 times [2018-01-20 22:30:01,339 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:30:01,339 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:30:01,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:30:01,340 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:30:01,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:30:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:30:01,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:30:01,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:30:01,808 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:30:01,808 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:30:01,814 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:30:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:30:01,840 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:30:01,852 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-20 22:30:01,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:01,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:01,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:30:01,868 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:01,869 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:01,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-20 22:30:01,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:01,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:01,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:22 [2018-01-20 22:30:01,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:30:01,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-20 22:30:01,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:01,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:01,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:01,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 [2018-01-20 22:30:01,967 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:01,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2018-01-20 22:30:01,972 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 16 treesize of output 1 [2018-01-20 22:30:01,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:01,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:01,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:01,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:38 [2018-01-20 22:30:01,985 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:01,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-01-20 22:30:01,989 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 10 treesize of output 9 [2018-01-20 22:30:01,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:01,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:02,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:02,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-01-20 22:30:02,026 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:02,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:02,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:02,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-20 22:30:02,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:02,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:02,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:45 [2018-01-20 22:30:02,061 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:02,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-01-20 22:30:02,066 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:02,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-20 22:30:02,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:02,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:02,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:02,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:53 [2018-01-20 22:30:02,168 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:02,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:02,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 88 [2018-01-20 22:30:02,175 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 16 treesize of output 1 [2018-01-20 22:30:02,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:02,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:02,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:30:02,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:61 [2018-01-20 22:30:02,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:02,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:02,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 82 [2018-01-20 22:30:02,236 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 10 treesize of output 9 [2018-01-20 22:30:02,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:02,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:02,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:30:02,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:70 [2018-01-20 22:30:02,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 75 [2018-01-20 22:30:02,305 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:02,306 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 24 treesize of output 39 [2018-01-20 22:30:02,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:02,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:02,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-20 22:30:02,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:102, output treesize:90 [2018-01-20 22:30:02,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 78 [2018-01-20 22:30:02,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 80 [2018-01-20 22:30:02,418 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:30:02,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:30:02,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-01-20 22:30:02,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:172 [2018-01-20 22:30:02,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 62 [2018-01-20 22:30:02,601 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:02,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-01-20 22:30:02,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:02,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:02,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-01-20 22:30:02,614 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:02,623 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:02,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-01-20 22:30:02,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:02,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:02,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 68 [2018-01-20 22:30:02,654 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:02,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-01-20 22:30:02,655 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:02,666 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:02,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2018-01-20 22:30:02,672 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-20 22:30:02,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:02,691 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-01-20 22:30:02,691 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:02,694 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:02,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2018-01-20 22:30:02,696 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:02,706 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:30:02,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:30:02,716 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:186, output treesize:28 [2018-01-20 22:30:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:30:02,799 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:30:02,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 32 [2018-01-20 22:30:02,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-20 22:30:02,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-20 22:30:02,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=899, Unknown=0, NotChecked=0, Total=992 [2018-01-20 22:30:02,800 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 32 states. [2018-01-20 22:30:04,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:30:04,665 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2018-01-20 22:30:04,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-20 22:30:04,665 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 46 [2018-01-20 22:30:04,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:30:04,666 INFO L225 Difference]: With dead ends: 182 [2018-01-20 22:30:04,666 INFO L226 Difference]: Without dead ends: 179 [2018-01-20 22:30:04,667 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=369, Invalid=2283, Unknown=0, NotChecked=0, Total=2652 [2018-01-20 22:30:04,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-20 22:30:04,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 118. [2018-01-20 22:30:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-20 22:30:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-01-20 22:30:04,675 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 46 [2018-01-20 22:30:04,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:30:04,676 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-01-20 22:30:04,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-20 22:30:04,676 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-01-20 22:30:04,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-20 22:30:04,676 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:30:04,676 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-20 22:30:04,677 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 22:30:04,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1760026191, now seen corresponding path program 2 times [2018-01-20 22:30:04,677 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:30:04,677 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:30:04,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:30:04,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:30:04,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:30:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:30:04,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:30:05,455 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:30:05,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:30:05,455 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-20 22:30:05,462 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:30:05,476 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:30:05,537 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:30:05,539 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:30:05,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:30:05,547 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-20 22:30:05,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:30:05,555 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:05,556 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:05,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-01-20 22:30:05,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-01-20 22:30:05,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:30:05,587 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-20 22:30:05,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:30:05,598 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-20 22:30:05,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,607 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2018-01-20 22:30:05,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-01-20 22:30:05,633 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-01-20 22:30:05,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:36 [2018-01-20 22:30:05,695 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:05,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-01-20 22:30:05,700 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 16 treesize of output 1 [2018-01-20 22:30:05,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2018-01-20 22:30:05,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:05,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-01-20 22:30:05,717 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 10 treesize of output 9 [2018-01-20 22:30:05,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-01-20 22:30:05,761 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:05,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:05,763 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:05,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-20 22:30:05,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:47 [2018-01-20 22:30:05,804 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:05,805 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:05,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52 [2018-01-20 22:30:05,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:05,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-01-20 22:30:05,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:51 [2018-01-20 22:30:05,918 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:05,919 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:05,920 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:05,921 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:05,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 96 [2018-01-20 22:30:05,927 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 16 treesize of output 1 [2018-01-20 22:30:05,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:87, output treesize:60 [2018-01-20 22:30:05,969 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:05,970 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:05,971 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:05,972 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:05,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 90 [2018-01-20 22:30:05,978 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 10 treesize of output 9 [2018-01-20 22:30:05,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:05,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:06,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:06,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:81, output treesize:69 [2018-01-20 22:30:06,044 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:06,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:06,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 83 [2018-01-20 22:30:06,053 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:06,055 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 24 treesize of output 39 [2018-01-20 22:30:06,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:06,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:06,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:30:06,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:89 [2018-01-20 22:30:06,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:06,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:06,170 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:06,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 97 [2018-01-20 22:30:06,175 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:06,182 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 146 [2018-01-20 22:30:06,183 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:30:06,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:06,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:30:06,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:98 [2018-01-20 22:30:06,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:06,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:06,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 89 [2018-01-20 22:30:06,358 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:06,379 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 99 [2018-01-20 22:30:06,382 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-01-20 22:30:06,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-01-20 22:30:06,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 18 dim-0 vars, and 6 xjuncts. [2018-01-20 22:30:06,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:529 [2018-01-20 22:30:14,795 WARN L146 SmtUtils]: Spent 8057ms on a formula simplification. DAG size of input: 176 DAG size of output 67 [2018-01-20 22:30:14,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:14,887 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:14,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 90 [2018-01-20 22:30:14,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:14,895 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:14,924 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 114 [2018-01-20 22:30:14,924 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-01-20 22:30:14,952 INFO L267 ElimStorePlain]: Start of recursive call 3: 33 dim-0 vars, End of recursive call: 33 dim-0 vars, and 38 xjuncts. [2018-01-20 22:30:15,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:15,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-01-20 22:30:15,132 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:15,167 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-01-20 22:30:15,168 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:15,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2018-01-20 22:30:15,176 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-20 22:30:15,178 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-01-20 22:30:15,179 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:15,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:30:15,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 69 [2018-01-20 22:30:15,254 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:15,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:15,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:15,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-20 22:30:15,258 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:15,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-20 22:30:15,278 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:15,286 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:15,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-01-20 22:30:15,287 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:15,292 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:15,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-20 22:30:15,329 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:239, output treesize:50 [2018-01-20 22:30:15,434 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:30:15,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:30:15,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 41 [2018-01-20 22:30:15,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-20 22:30:15,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-20 22:30:15,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1509, Unknown=0, NotChecked=0, Total=1640 [2018-01-20 22:30:15,457 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 41 states. [2018-01-20 22:30:16,780 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 97 DAG size of output 80 [2018-01-20 22:30:17,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:30:17,944 INFO L93 Difference]: Finished difference Result 253 states and 273 transitions. [2018-01-20 22:30:17,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-20 22:30:17,944 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 61 [2018-01-20 22:30:17,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:30:17,945 INFO L225 Difference]: With dead ends: 253 [2018-01-20 22:30:17,946 INFO L226 Difference]: Without dead ends: 250 [2018-01-20 22:30:17,947 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 40 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 943 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=520, Invalid=3770, Unknown=0, NotChecked=0, Total=4290 [2018-01-20 22:30:17,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-01-20 22:30:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 141. [2018-01-20 22:30:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-20 22:30:17,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-01-20 22:30:17,956 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 61 [2018-01-20 22:30:17,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:30:17,957 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-01-20 22:30:17,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-20 22:30:17,957 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-01-20 22:30:17,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-20 22:30:17,957 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:30:17,958 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 22:30:17,958 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-20 22:30:17,958 INFO L82 PathProgramCache]: Analyzing trace with hash -2057956464, now seen corresponding path program 1 times [2018-01-20 22:30:17,958 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:30:17,958 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:30:17,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:30:17,959 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:30:17,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:30:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:30:17,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:30:18,082 ERROR L119 erpolLogProxyWrapper]: Interpolant 48 not inductive: (Check returned sat) [2018-01-20 22:30:18,090 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1003) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) 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:157) 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) [2018-01-20 22:30:18,092 INFO L168 Benchmark]: Toolchain (without parser) took 49474.14 ms. Allocated memory was 305.1 MB in the beginning and 736.1 MB in the end (delta: 431.0 MB). Free memory was 263.5 MB in the beginning and 611.4 MB in the end (delta: -347.9 MB). Peak memory consumption was 374.9 MB. Max. memory is 5.3 GB. [2018-01-20 22:30:18,094 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 305.1 MB. Free memory is still 269.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:30:18,094 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.28 ms. Allocated memory is still 305.1 MB. Free memory was 262.5 MB in the beginning and 250.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-20 22:30:18,094 INFO L168 Benchmark]: Boogie Preprocessor took 36.77 ms. Allocated memory is still 305.1 MB. Free memory was 250.4 MB in the beginning and 248.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:30:18,094 INFO L168 Benchmark]: RCFGBuilder took 455.61 ms. Allocated memory is still 305.1 MB. Free memory was 248.4 MB in the beginning and 219.5 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 5.3 GB. [2018-01-20 22:30:18,094 INFO L168 Benchmark]: TraceAbstraction took 48747.81 ms. Allocated memory was 305.1 MB in the beginning and 736.1 MB in the end (delta: 431.0 MB). Free memory was 219.5 MB in the beginning and 611.4 MB in the end (delta: -391.8 MB). Peak memory consumption was 330.9 MB. Max. memory is 5.3 GB. [2018-01-20 22:30:18,096 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.20 ms. Allocated memory is still 305.1 MB. Free memory is still 269.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 226.28 ms. Allocated memory is still 305.1 MB. Free memory was 262.5 MB in the beginning and 250.4 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.77 ms. Allocated memory is still 305.1 MB. Free memory was 250.4 MB in the beginning and 248.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 455.61 ms. Allocated memory is still 305.1 MB. Free memory was 248.4 MB in the beginning and 219.5 MB in the end (delta: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 48747.81 ms. Allocated memory was 305.1 MB in the beginning and 736.1 MB in the end (delta: 431.0 MB). Free memory was 219.5 MB in the beginning and 611.4 MB in the end (delta: -391.8 MB). Peak memory consumption was 330.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 94 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L993] EXPR, FCALL malloc(sizeof(BCK)) VAL [malloc(sizeof(BCK))={18:0}] [L993] BCK* bucket = malloc(sizeof(BCK)); VAL [bucket={18:0}, malloc(sizeof(BCK))={18:0}] [L994] FCALL bucket->data = 0 VAL [bucket={18:0}, malloc(sizeof(BCK))={18:0}] [L995] FCALL bucket->list = ((void*)0) VAL [bucket={18:0}, malloc(sizeof(BCK))={18:0}] [L997] EXPR, FCALL malloc(sizeof(BCK)) VAL [bucket={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L997] FCALL bucket->next = malloc(sizeof(BCK)) VAL [bucket={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L998] EXPR, FCALL bucket->next VAL [bucket={18:0}, bucket->next={31:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L998] BCK* bcki = bucket->next; [L999] FCALL bcki->data = 1 VAL [bcki={31:0}, bucket={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1000] FCALL bcki->list = ((void*)0) VAL [bcki={31:0}, bucket={18:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1002] EXPR, FCALL malloc(sizeof(BCK)) VAL [bcki={31:0}, bucket={18:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1002] FCALL bcki->next = malloc(sizeof(BCK)) VAL [bcki={31:0}, bucket={18:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1003] EXPR, FCALL bcki->next VAL [bcki={31:0}, bcki->next={19:0}, bucket={18:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1003] bcki = bcki->next [L1004] FCALL bcki->data = 2 VAL [bcki={19:0}, bucket={18:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1005] FCALL bcki->list = ((void*)0) VAL [bcki={19:0}, bucket={18:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1006] FCALL bcki->next = ((void*)0) VAL [bcki={19:0}, bucket={18:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1008] struct TSLL* item = ((void*)0); [L1009] struct TSLL* itr = ((void*)0); VAL [bcki={19:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1041] bcki = bucket VAL [bcki={18:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1042] COND TRUE bcki != ((void*)0) VAL [bcki={18:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1044] EXPR, FCALL bcki->list VAL [bcki={18:0}, bcki->list={0:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1044] item = bcki->list [L1045] FCALL bcki->list = ((void*)0) VAL [bcki={18:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1046] COND FALSE !(item != ((void*)0)) VAL [bcki={18:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1053] COND FALSE !(!(item == ((void*)0))) VAL [bcki={18:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1053] COND FALSE !(0) VAL [bcki={18:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1054] bucket = bcki VAL [bcki={18:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1055] EXPR, FCALL bcki->next VAL [bcki={18:0}, bcki->next={31:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1055] bcki = bcki->next [L1056] FCALL free(bucket) VAL [bcki={31:0}, bucket={18:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1057] bucket = ((void*)0) VAL [bcki={31:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1042] COND TRUE bcki != ((void*)0) VAL [bcki={31:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1044] EXPR, FCALL bcki->list VAL [bcki={31:0}, bcki->list={0:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1044] item = bcki->list [L1045] FCALL bcki->list = ((void*)0) VAL [bcki={31:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1046] COND FALSE !(item != ((void*)0)) VAL [bcki={31:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1053] COND FALSE !(!(item == ((void*)0))) VAL [bcki={31:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1053] COND FALSE !(0) VAL [bcki={31:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1054] bucket = bcki VAL [bcki={31:0}, bucket={31:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1055] EXPR, FCALL bcki->next VAL [bcki={31:0}, bcki->next={19:0}, bucket={31:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1055] bcki = bcki->next [L1056] FCALL free(bucket) VAL [bcki={19:0}, bucket={31:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1057] bucket = ((void*)0) VAL [bcki={19:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1042] COND TRUE bcki != ((void*)0) VAL [bcki={19:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1044] EXPR, FCALL bcki->list VAL [bcki={19:0}, bcki->list={0:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1044] item = bcki->list [L1045] FCALL bcki->list = ((void*)0) VAL [bcki={19:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1046] COND FALSE !(item != ((void*)0)) VAL [bcki={19:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1053] COND FALSE !(!(item == ((void*)0))) VAL [bcki={19:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1053] COND FALSE !(0) VAL [bcki={19:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1054] bucket = bcki VAL [bcki={19:0}, bucket={19:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1055] EXPR, FCALL bcki->next VAL [bcki={19:0}, bcki->next={0:0}, bucket={19:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1055] bcki = bcki->next [L1056] FCALL free(bucket) VAL [bcki={0:0}, bucket={19:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1057] bucket = ((void*)0) VAL [bcki={0:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1042] COND FALSE !(bcki != ((void*)0)) VAL [bcki={0:0}, bucket={0:0}, item={0:0}, itr={0:0}, malloc(sizeof(BCK))={19:0}, malloc(sizeof(BCK))={31:0}, malloc(sizeof(BCK))={18:0}] [L1060] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 94 locations, 3 error locations. UNSAFE Result, 31.5s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 11.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 506 SDtfs, 2932 SDslu, 6268 SDs, 0 SdLazy, 4467 SolverSat, 378 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 207 SyntacticMatches, 12 SemanticMatches, 228 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3067 ImplicationChecksByTransitivity, 22.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 612 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 647 NumberOfCodeBlocks, 647 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 559 ConstructedInterpolants, 106 QuantifiedInterpolants, 1482554 SizeOfPredicates, 56 NumberOfNonLiveVariables, 842 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 8/68 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:1003) 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/sll-buckets_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-30-18-103.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-buckets_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-30-18-103.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-buckets_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-30-18-103.csv Received shutdown request...