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/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:02:34,746 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:02:34,748 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:02:34,763 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:02:34,764 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:02:34,765 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:02:34,766 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:02:34,767 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:02:34,769 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:02:34,770 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:02:34,770 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:02:34,771 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:02:34,771 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:02:34,772 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:02:34,773 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:02:34,775 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:02:34,777 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:02:34,779 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:02:34,780 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:02:34,782 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:02:34,784 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:02:34,784 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:02:34,785 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:02:34,786 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:02:34,787 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:02:34,788 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:02:34,788 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:02:34,789 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:02:34,789 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:02:34,789 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:02:34,790 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:02:34,790 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:02:34,800 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:02:34,801 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:02:34,801 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:02:34,802 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:02:34,802 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:02:34,802 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:02:34,802 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:02:34,803 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:02:34,803 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:02:34,803 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:02:34,803 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:02:34,804 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:02:34,804 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:02:34,804 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:02:34,804 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:02:34,804 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:02:34,805 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:02:34,805 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:02:34,805 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:02:34,805 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:02:34,805 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:02:34,806 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:02:34,806 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:02:34,806 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:02:34,806 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:02:34,806 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:02:34,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:02:34,807 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:02:34,807 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:02:34,807 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:02:34,807 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:02:34,807 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:02:34,808 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:02:34,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:02:34,808 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:02:34,809 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:02:34,809 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:02:34,845 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:02:34,857 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:02:34,861 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:02:34,863 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:02:34,863 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:02:34,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i [2018-01-20 22:02:35,040 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:02:35,045 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:02:35,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:02:35,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:02:35,055 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:02:35,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:02:35" (1/1) ... [2018-01-20 22:02:35,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157b506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:02:35, skipping insertion in model container [2018-01-20 22:02:35,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:02:35" (1/1) ... [2018-01-20 22:02:35,074 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:02:35,113 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:02:35,229 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:02:35,246 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:02:35,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:02:35 WrapperNode [2018-01-20 22:02:35,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:02:35,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:02:35,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:02:35,256 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:02:35,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:02:35" (1/1) ... [2018-01-20 22:02:35,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:02:35" (1/1) ... [2018-01-20 22:02:35,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:02:35" (1/1) ... [2018-01-20 22:02:35,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:02:35" (1/1) ... [2018-01-20 22:02:35,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:02:35" (1/1) ... [2018-01-20 22:02:35,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:02:35" (1/1) ... [2018-01-20 22:02:35,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:02:35" (1/1) ... [2018-01-20 22:02:35,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:02:35,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:02:35,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:02:35,293 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:02:35,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:02:35" (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:02:35,339 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:02:35,340 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:02:35,340 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:02:35,340 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:02:35,340 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:02:35,340 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:02:35,340 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:02:35,340 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:02:35,340 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:02:35,340 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:02:35,341 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:02:35,341 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:02:35,341 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:02:35,341 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:02:35,542 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:02:35,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:02:35 BoogieIcfgContainer [2018-01-20 22:02:35,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:02:35,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:02:35,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:02:35,545 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:02:35,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:02:35" (1/3) ... [2018-01-20 22:02:35,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7889acd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:02:35, skipping insertion in model container [2018-01-20 22:02:35,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:02:35" (2/3) ... [2018-01-20 22:02:35,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7889acd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:02:35, skipping insertion in model container [2018-01-20 22:02:35,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:02:35" (3/3) ... [2018-01-20 22:02:35,548 INFO L105 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer_true-valid-memsafety.i [2018-01-20 22:02:35,555 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:02:35,561 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-20 22:02:35,597 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:02:35,598 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:02:35,598 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:02:35,598 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:02:35,598 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:02:35,598 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:02:35,598 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:02:35,598 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:02:35,599 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:02:35,621 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-20 22:02:35,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:02:35,628 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:02:35,629 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:02:35,629 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:02:35,635 INFO L82 PathProgramCache]: Analyzing trace with hash 98024, now seen corresponding path program 1 times [2018-01-20 22:02:35,637 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:02:35,638 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:02:35,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:35,681 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:02:35,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:02:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:02:35,731 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:02:35,737 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:02:35,745 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:02:35,745 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:02:35,745 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:02:35,745 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:02:35,745 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:02:35,745 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:02:35,746 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:02:35,746 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:02:35,746 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:02:35,747 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-20 22:02:35,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-20 22:02:35,748 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:02:35,748 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:02:35,748 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:02:35,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1566967016, now seen corresponding path program 1 times [2018-01-20 22:02:35,749 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:02:35,749 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:02:35,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:35,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:02:35,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:02:35,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:02:35,819 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:02:35,821 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:02:35,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:02:35,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:02:35,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:02:35,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:02:35,838 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-01-20 22:02:35,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:02:35,925 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-01-20 22:02:35,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:02:35,927 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-20 22:02:35,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:02:35,938 INFO L225 Difference]: With dead ends: 60 [2018-01-20 22:02:35,938 INFO L226 Difference]: Without dead ends: 40 [2018-01-20 22:02:35,941 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:02:35,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-20 22:02:35,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-20 22:02:35,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-20 22:02:35,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-20 22:02:35,974 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 18 [2018-01-20 22:02:35,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:02:35,975 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-20 22:02:35,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:02:35,975 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-20 22:02:35,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-20 22:02:35,976 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:02:35,976 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] [2018-01-20 22:02:35,976 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:02:35,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2022925235, now seen corresponding path program 1 times [2018-01-20 22:02:35,976 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:02:35,977 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:02:35,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:35,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:02:35,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:02:35,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:02:36,066 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:02:36,066 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:02:36,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:02:36,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:02:36,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:02:36,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:02:36,068 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 5 states. [2018-01-20 22:02:36,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:02:36,249 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-01-20 22:02:36,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:02:36,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-20 22:02:36,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:02:36,254 INFO L225 Difference]: With dead ends: 73 [2018-01-20 22:02:36,254 INFO L226 Difference]: Without dead ends: 68 [2018-01-20 22:02:36,255 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-20 22:02:36,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-20 22:02:36,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 45. [2018-01-20 22:02:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-20 22:02:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-20 22:02:36,263 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 21 [2018-01-20 22:02:36,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:02:36,263 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-20 22:02:36,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:02:36,264 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-20 22:02:36,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-20 22:02:36,265 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:02:36,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] [2018-01-20 22:02:36,265 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:02:36,265 INFO L82 PathProgramCache]: Analyzing trace with hash 745482112, now seen corresponding path program 1 times [2018-01-20 22:02:36,265 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:02:36,265 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:02:36,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:36,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:02:36,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:02:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:02:36,317 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:02:36,322 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:02:36,325 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:02:36,325 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:02:36,335 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:02:36,335 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:02:36,335 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:02:36,335 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:02:36,335 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:02:36,335 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:02:36,335 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:02:36,335 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:02:36,336 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:02:36,337 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-20 22:02:36,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-20 22:02:36,337 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:02:36,338 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:02:36,338 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:02:36,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1567082781, now seen corresponding path program 1 times [2018-01-20 22:02:36,338 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:02:36,338 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:02:36,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:36,339 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:02:36,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:02:36,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:02:36,366 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:02:36,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:02:36,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:02:36,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:02:36,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:02:36,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:02:36,367 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-01-20 22:02:36,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:02:36,370 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-01-20 22:02:36,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:02:36,370 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-01-20 22:02:36,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:02:36,371 INFO L225 Difference]: With dead ends: 60 [2018-01-20 22:02:36,371 INFO L226 Difference]: Without dead ends: 38 [2018-01-20 22:02:36,371 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:02:36,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-20 22:02:36,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-20 22:02:36,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-20 22:02:36,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-20 22:02:36,375 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 16 [2018-01-20 22:02:36,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:02:36,375 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-20 22:02:36,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:02:36,375 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-20 22:02:36,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-20 22:02:36,376 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:02:36,376 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:02:36,376 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 22:02:36,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1749589112, now seen corresponding path program 1 times [2018-01-20 22:02:36,376 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:02:36,376 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:02:36,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:36,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:02:36,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:02:36,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:02:36,453 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:02:36,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:02:36,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:02:36,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:02:36,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:02:36,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:02:36,454 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 5 states. [2018-01-20 22:02:36,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:02:36,562 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-01-20 22:02:36,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:02:36,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-20 22:02:36,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:02:36,564 INFO L225 Difference]: With dead ends: 69 [2018-01-20 22:02:36,564 INFO L226 Difference]: Without dead ends: 66 [2018-01-20 22:02:36,564 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-20 22:02:36,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-20 22:02:36,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2018-01-20 22:02:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-20 22:02:36,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-20 22:02:36,570 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2018-01-20 22:02:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:02:36,571 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-20 22:02:36,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:02:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-20 22:02:36,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-20 22:02:36,572 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:02:36,572 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] [2018-01-20 22:02:36,572 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 22:02:36,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1944907653, now seen corresponding path program 1 times [2018-01-20 22:02:36,573 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:02:36,573 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:02:36,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:36,574 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:02:36,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:02:36,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:02:36,764 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:02:36,764 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:02:36,764 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:02:36,778 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:02:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:02:36,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:02:36,972 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~y~4.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~y~4.base 0)) (= 0 (select |c_old(#valid)| main_~y~4.base)) (not (= main_~y~4.base 0)))) is different from true [2018-01-20 22:02:36,986 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:02:37,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:02:37,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-01-20 22:02:37,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-20 22:02:37,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-20 22:02:37,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=73, Unknown=1, NotChecked=16, Total=110 [2018-01-20 22:02:37,008 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2018-01-20 22:02:37,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:02:37,542 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2018-01-20 22:02:37,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-20 22:02:37,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-01-20 22:02:37,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:02:37,543 INFO L225 Difference]: With dead ends: 63 [2018-01-20 22:02:37,544 INFO L226 Difference]: Without dead ends: 60 [2018-01-20 22:02:37,544 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=160, Unknown=1, NotChecked=26, Total=240 [2018-01-20 22:02:37,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-20 22:02:37,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2018-01-20 22:02:37,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-20 22:02:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-20 22:02:37,549 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 26 [2018-01-20 22:02:37,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:02:37,550 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-20 22:02:37,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-20 22:02:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-20 22:02:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-20 22:02:37,550 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:02:37,551 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] [2018-01-20 22:02:37,551 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 22:02:37,551 INFO L82 PathProgramCache]: Analyzing trace with hash 66158503, now seen corresponding path program 1 times [2018-01-20 22:02:37,551 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:02:37,551 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:02:37,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:37,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:02:37,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:02:37,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:02:37,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:02:37,781 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:02:37,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-20 22:02:37,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 22:02:37,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 22:02:37,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:02:37,782 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 7 states. [2018-01-20 22:02:37,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:02:37,938 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-01-20 22:02:37,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 22:02:37,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-20 22:02:37,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:02:37,939 INFO L225 Difference]: With dead ends: 71 [2018-01-20 22:02:37,939 INFO L226 Difference]: Without dead ends: 58 [2018-01-20 22:02:37,939 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-01-20 22:02:37,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-20 22:02:37,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-01-20 22:02:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-20 22:02:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-20 22:02:37,944 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 29 [2018-01-20 22:02:37,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:02:37,944 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-20 22:02:37,944 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 22:02:37,944 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-20 22:02:37,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-20 22:02:37,945 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:02:37,945 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] [2018-01-20 22:02:37,945 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-20 22:02:37,945 INFO L82 PathProgramCache]: Analyzing trace with hash 304338011, now seen corresponding path program 1 times [2018-01-20 22:02:37,946 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:02:37,946 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:02:37,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:37,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:02:37,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:02:37,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:02:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:02:37,996 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:02:37,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:02:37,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:02:37,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:02:37,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:02:37,997 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-01-20 22:02:38,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:02:38,100 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2018-01-20 22:02:38,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:02:38,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-20 22:02:38,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:02:38,102 INFO L225 Difference]: With dead ends: 91 [2018-01-20 22:02:38,102 INFO L226 Difference]: Without dead ends: 88 [2018-01-20 22:02:38,102 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:02:38,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-20 22:02:38,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 50. [2018-01-20 22:02:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-20 22:02:38,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-20 22:02:38,108 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 30 [2018-01-20 22:02:38,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:02:38,108 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-20 22:02:38,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:02:38,108 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-20 22:02:38,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-20 22:02:38,109 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:02:38,110 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 22:02:38,110 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-20 22:02:38,110 INFO L82 PathProgramCache]: Analyzing trace with hash 264537048, now seen corresponding path program 2 times [2018-01-20 22:02:38,110 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:02:38,110 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:02:38,111 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:38,111 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:02:38,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:02:38,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:02:38,243 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:02:38,243 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:02:38,243 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:02:38,252 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:02:38,265 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:02:38,272 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:02:38,274 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:02:38,277 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:02:38,314 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:02:38,316 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:02:38,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:38,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:38,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:38,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-20 22:02:38,344 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 21 treesize of output 16 [2018-01-20 22:02:38,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:38,350 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 16 treesize of output 23 [2018-01-20 22:02:38,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:38,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:38,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:38,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-20 22:02:38,382 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 30 treesize of output 23 [2018-01-20 22:02:38,385 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:38,386 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:38,386 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:38,388 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 23 treesize of output 46 [2018-01-20 22:02:38,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:38,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:38,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:38,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-20 22:02:38,431 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 29 treesize of output 21 [2018-01-20 22:02:38,435 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 21 treesize of output 3 [2018-01-20 22:02:38,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:38,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:38,438 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:02:38,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:3 [2018-01-20 22:02:38,476 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:02:38,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:02:38,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 15 [2018-01-20 22:02:38,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-20 22:02:38,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-20 22:02:38,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-01-20 22:02:38,498 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 15 states. [2018-01-20 22:02:38,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:02:38,762 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-01-20 22:02:38,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-20 22:02:38,763 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-01-20 22:02:38,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:02:38,763 INFO L225 Difference]: With dead ends: 68 [2018-01-20 22:02:38,764 INFO L226 Difference]: Without dead ends: 46 [2018-01-20 22:02:38,765 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2018-01-20 22:02:38,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-20 22:02:38,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-01-20 22:02:38,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-20 22:02:38,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-20 22:02:38,769 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 33 [2018-01-20 22:02:38,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:02:38,769 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-20 22:02:38,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-20 22:02:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-20 22:02:38,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 22:02:38,770 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:02:38,770 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] [2018-01-20 22:02:38,770 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-20 22:02:38,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1962892734, now seen corresponding path program 1 times [2018-01-20 22:02:38,770 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:02:38,771 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:02:38,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:38,771 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:02:38,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:02:38,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:02:39,004 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:02:39,005 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:02:39,005 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:02:39,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:02:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:02:39,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:02:39,055 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 6 treesize of output 5 [2018-01-20 22:02:39,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:39,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:39,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-01-20 22:02:39,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:39,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:39,086 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-20 22:02:39,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:39,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:39,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-01-20 22:02:39,129 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:02:39,131 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:02:39,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:39,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:39,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:39,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-20 22:02:39,166 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-01-20 22:02:39,168 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 14 treesize of output 13 [2018-01-20 22:02:39,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:39,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:39,178 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:02:39,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-01-20 22:02:39,214 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-01-20 22:02:39,217 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 32 treesize of output 37 [2018-01-20 22:02:39,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:39,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:39,242 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:02:39,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-01-20 22:02:39,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-01-20 22:02:39,398 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 7 treesize of output 1 [2018-01-20 22:02:39,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:39,435 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2018-01-20 22:02:39,436 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-01-20 22:02:39,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:02:39,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-01-20 22:02:39,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2018-01-20 22:02:39,481 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-20 22:02:39,495 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 7 treesize of output 1 [2018-01-20 22:02:39,496 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:39,501 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:02:39,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-20 22:02:39,517 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:97, output treesize:32 [2018-01-20 22:02:39,558 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:02:39,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:02:39,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 21 [2018-01-20 22:02:39,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-20 22:02:39,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-20 22:02:39,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-01-20 22:02:39,579 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 21 states. [2018-01-20 22:02:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:02:40,327 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-01-20 22:02:40,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-20 22:02:40,327 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 37 [2018-01-20 22:02:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:02:40,328 INFO L225 Difference]: With dead ends: 104 [2018-01-20 22:02:40,328 INFO L226 Difference]: Without dead ends: 101 [2018-01-20 22:02:40,328 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=281, Invalid=1441, Unknown=0, NotChecked=0, Total=1722 [2018-01-20 22:02:40,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-20 22:02:40,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 66. [2018-01-20 22:02:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-20 22:02:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-01-20 22:02:40,334 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 37 [2018-01-20 22:02:40,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:02:40,334 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-01-20 22:02:40,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-20 22:02:40,334 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-01-20 22:02:40,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-20 22:02:40,335 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:02:40,335 INFO L322 BasicCegarLoop]: trace histogram [3, 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] [2018-01-20 22:02:40,335 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-20 22:02:40,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1346194821, now seen corresponding path program 2 times [2018-01-20 22:02:40,336 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:02:40,336 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:02:40,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:40,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:02:40,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:02:40,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:02:40,823 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:02:40,823 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:02:40,823 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:02:40,829 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:02:40,841 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:02:40,850 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:02:40,853 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:02:40,856 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:02:40,983 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:02:40,985 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:02:40,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:40,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:40,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:40,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-01-20 22:02:41,033 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:41,036 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-01-20 22:02:41,039 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 14 treesize of output 13 [2018-01-20 22:02:41,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:41,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:41,055 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:02:41,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-01-20 22:02:41,100 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:41,105 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 57 [2018-01-20 22:02:41,109 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 63 [2018-01-20 22:02:41,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:41,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:41,127 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:02:41,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:55 [2018-01-20 22:02:41,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:41,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2018-01-20 22:02:41,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 43 [2018-01-20 22:02:41,324 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-20 22:02:41,359 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 7 treesize of output 1 [2018-01-20 22:02:41,359 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:41,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-20 22:02:41,433 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:41,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2018-01-20 22:02:41,443 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 39 [2018-01-20 22:02:41,444 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-20 22:02:41,467 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 7 treesize of output 1 [2018-01-20 22:02:41,467 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:41,481 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-20 22:02:41,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-01-20 22:02:41,539 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:133, output treesize:162 [2018-01-20 22:02:42,172 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~y~4.base Int) (v_subst_1 Int)) (let ((.cse0 (store |c_old(#valid)| main_~y~4.base 1))) (and (not (= v_subst_1 0)) (= 0 (select |c_old(#valid)| main_~y~4.base)) (not (= main_~y~4.base 0)) (= (select .cse0 v_subst_1) 0) (= |c_#valid| (store (store .cse0 v_subst_1 0) main_~y~4.base 0))))) is different from true [2018-01-20 22:02:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-01-20 22:02:42,207 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:02:42,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2018-01-20 22:02:42,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-20 22:02:42,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-20 22:02:42,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=728, Unknown=20, NotChecked=54, Total=870 [2018-01-20 22:02:42,209 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 30 states. [2018-01-20 22:02:43,288 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 123 DAG size of output 44 [2018-01-20 22:02:43,477 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 98 DAG size of output 37 [2018-01-20 22:02:44,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:02:44,099 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-01-20 22:02:44,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-20 22:02:44,100 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 44 [2018-01-20 22:02:44,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:02:44,100 INFO L225 Difference]: With dead ends: 101 [2018-01-20 22:02:44,100 INFO L226 Difference]: Without dead ends: 98 [2018-01-20 22:02:44,101 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=202, Invalid=1588, Unknown=20, NotChecked=82, Total=1892 [2018-01-20 22:02:44,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-20 22:02:44,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 83. [2018-01-20 22:02:44,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-20 22:02:44,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2018-01-20 22:02:44,111 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 44 [2018-01-20 22:02:44,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:02:44,111 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2018-01-20 22:02:44,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-20 22:02:44,111 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2018-01-20 22:02:44,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-20 22:02:44,113 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:02:44,113 INFO L322 BasicCegarLoop]: trace histogram [3, 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] [2018-01-20 22:02:44,113 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-20 22:02:44,113 INFO L82 PathProgramCache]: Analyzing trace with hash -2126030707, now seen corresponding path program 1 times [2018-01-20 22:02:44,114 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:02:44,114 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:02:44,114 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:44,115 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:02:44,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:02:44,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:02:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-20 22:02:44,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:02:44,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-20 22:02:44,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-20 22:02:44,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-20 22:02:44,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-20 22:02:44,307 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 10 states. [2018-01-20 22:02:44,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:02:44,556 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2018-01-20 22:02:44,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-20 22:02:44,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-01-20 22:02:44,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:02:44,558 INFO L225 Difference]: With dead ends: 143 [2018-01-20 22:02:44,558 INFO L226 Difference]: Without dead ends: 127 [2018-01-20 22:02:44,559 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506 [2018-01-20 22:02:44,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-20 22:02:44,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 93. [2018-01-20 22:02:44,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-20 22:02:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-01-20 22:02:44,566 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 45 [2018-01-20 22:02:44,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:02:44,567 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-01-20 22:02:44,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-20 22:02:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-01-20 22:02:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-20 22:02:44,568 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:02:44,568 INFO L322 BasicCegarLoop]: trace histogram [3, 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:02:44,568 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-20 22:02:44,568 INFO L82 PathProgramCache]: Analyzing trace with hash 886772723, now seen corresponding path program 1 times [2018-01-20 22:02:44,568 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:02:44,568 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:02:44,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:44,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:02:44,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:02:44,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:02:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:02:45,368 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:02:45,368 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:02:45,373 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:02:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:02:45,393 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:02:45,422 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:02:45,423 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:02:45,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:45,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:45,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:45,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-20 22:02:45,483 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 21 treesize of output 17 [2018-01-20 22:02:45,486 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:45,487 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:02:45,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:45,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:45,492 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 21 treesize of output 17 [2018-01-20 22:02:45,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-01-20 22:02:45,500 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-20 22:02:45,504 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:02:45,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:02:45,510 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:43, output treesize:15 [2018-01-20 22:02:45,530 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 11 treesize of output 10 [2018-01-20 22:02:45,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:45,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:02:45,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-20 22:02:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:02:45,583 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-20 22:02:45,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 28 [2018-01-20 22:02:45,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-20 22:02:45,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-20 22:02:45,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2018-01-20 22:02:45,584 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 28 states. [2018-01-20 22:02:47,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:02:47,100 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2018-01-20 22:02:47,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-20 22:02:47,100 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2018-01-20 22:02:47,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:02:47,101 INFO L225 Difference]: With dead ends: 146 [2018-01-20 22:02:47,101 INFO L226 Difference]: Without dead ends: 123 [2018-01-20 22:02:47,102 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=485, Invalid=3055, Unknown=0, NotChecked=0, Total=3540 [2018-01-20 22:02:47,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-20 22:02:47,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 99. [2018-01-20 22:02:47,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-20 22:02:47,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-01-20 22:02:47,110 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 47 [2018-01-20 22:02:47,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:02:47,110 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-01-20 22:02:47,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-20 22:02:47,110 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-01-20 22:02:47,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-20 22:02:47,111 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:02:47,111 INFO L322 BasicCegarLoop]: trace histogram [3, 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:02:47,111 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-20 22:02:47,112 INFO L82 PathProgramCache]: Analyzing trace with hash 345788657, now seen corresponding path program 2 times [2018-01-20 22:02:47,112 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:02:47,112 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:02:47,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:47,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:02:47,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:02:47,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:02:47,939 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:02:47,939 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:02:47,939 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:02:47,944 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:02:47,953 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:02:47,962 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:02:47,967 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:02:47,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:02:47,975 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:02:47,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:47,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:47,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:02:48,022 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 15 treesize of output 12 [2018-01-20 22:02:48,024 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 12 treesize of output 11 [2018-01-20 22:02:48,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-20 22:02:48,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:48,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:48,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-20 22:02:48,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-01-20 22:02:48,125 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 19 treesize of output 20 [2018-01-20 22:02:48,126 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:02:48,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,140 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:02:48,141 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:02:48,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,143 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,149 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2018-01-20 22:02:48,182 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 69 treesize of output 64 [2018-01-20 22:02:48,184 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:48,185 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:48,185 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 51 [2018-01-20 22:02:48,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,205 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-01-20 22:02:48,207 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 18 treesize of output 17 [2018-01-20 22:02:48,207 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,219 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:64 [2018-01-20 22:02:48,255 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 64 treesize of output 63 [2018-01-20 22:02:48,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:48,259 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 57 [2018-01-20 22:02:48,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,279 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2018-01-20 22:02:48,282 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-01-20 22:02:48,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,295 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-01-20 22:02:48,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2018-01-20 22:02:48,410 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 1 [2018-01-20 22:02:48,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:48,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 41 [2018-01-20 22:02:48,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-20 22:02:48,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-20 22:02:48,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-20 22:02:48,468 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:82, output treesize:134 [2018-01-20 22:02:48,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-01-20 22:02:48,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:48,713 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 20 treesize of output 15 [2018-01-20 22:02:48,714 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:02:48,721 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:48,723 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:48,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 29 [2018-01-20 22:02:48,730 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-01-20 22:02:48,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:02:48,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:02:48,753 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:10 [2018-01-20 22:02:48,818 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:02:48,838 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:02:48,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 36 [2018-01-20 22:02:48,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-20 22:02:48,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-20 22:02:48,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1170, Unknown=0, NotChecked=0, Total=1260 [2018-01-20 22:02:48,839 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 36 states. [2018-01-20 22:02:49,819 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 151 DAG size of output 72 [2018-01-20 22:02:50,041 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 111 DAG size of output 96 [2018-01-20 22:02:50,566 WARN L146 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 167 DAG size of output 123 [2018-01-20 22:02:51,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:02:51,488 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2018-01-20 22:02:51,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-20 22:02:51,489 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 47 [2018-01-20 22:02:51,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:02:51,489 INFO L225 Difference]: With dead ends: 134 [2018-01-20 22:02:51,490 INFO L226 Difference]: Without dead ends: 117 [2018-01-20 22:02:51,491 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=305, Invalid=2887, Unknown=0, NotChecked=0, Total=3192 [2018-01-20 22:02:51,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-20 22:02:51,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2018-01-20 22:02:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-20 22:02:51,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-01-20 22:02:51,499 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 47 [2018-01-20 22:02:51,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:02:51,499 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-01-20 22:02:51,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-20 22:02:51,499 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-01-20 22:02:51,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-20 22:02:51,500 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:02:51,501 INFO L322 BasicCegarLoop]: trace histogram [3, 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] [2018-01-20 22:02:51,501 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-20 22:02:51,501 INFO L82 PathProgramCache]: Analyzing trace with hash 273996961, now seen corresponding path program 1 times [2018-01-20 22:02:51,501 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:02:51,501 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:02:51,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:51,502 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:02:51,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:02:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:02:51,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:02:52,193 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 72 DAG size of output 37 [2018-01-20 22:02:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:02:53,226 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:02:53,263 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:02:53,268 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:02:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:02:53,290 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:02:53,427 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:02:53,429 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:02:53,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:53,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:53,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:53,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-01-20 22:02:53,483 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:53,487 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-01-20 22:02:53,489 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 14 treesize of output 13 [2018-01-20 22:02:53,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:53,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:53,504 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:02:53,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-01-20 22:02:53,618 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:53,622 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 73 [2018-01-20 22:02:53,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:53,626 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 70 treesize of output 89 [2018-01-20 22:02:53,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:53,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:02:53,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:02:53,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-01-20 22:02:54,062 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:54,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 89 [2018-01-20 22:02:54,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:54,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:54,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:54,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 83 [2018-01-20 22:02:54,083 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-20 22:02:54,200 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 7 treesize of output 1 [2018-01-20 22:02:54,201 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:54,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-20 22:02:54,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:54,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 89 [2018-01-20 22:02:54,405 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:54,410 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:02:54,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 91 [2018-01-20 22:02:54,434 INFO L267 ElimStorePlain]: Start of recursive call 6: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 9 xjuncts. [2018-01-20 22:02:54,981 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 7 treesize of output 1 [2018-01-20 22:02:54,981 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:02:55,322 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 9 xjuncts. [2018-01-20 22:02:56,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 12 xjuncts. [2018-01-20 22:02:56,114 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:205, output treesize:673 [2018-01-20 22:02:56,408 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 178 DAG size of output 81 [2018-01-20 22:02:56,763 WARN L146 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 130 DAG size of output 95 [2018-01-20 22:02:57,275 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~y~4.base Int) (v_prenex_30 Int) (v_subst_3 Int)) (let ((.cse0 (store |c_old(#valid)| main_~y~4.base 1))) (let ((.cse1 (store .cse0 v_subst_3 1))) (and (not (= v_prenex_30 0)) (= 0 (select .cse0 v_subst_3)) (not (= v_subst_3 0)) (= 0 (select |c_old(#valid)| main_~y~4.base)) (not (= main_~y~4.base 0)) (= (select .cse1 v_prenex_30) 0) (= |c_#valid| (store (store (store .cse1 v_prenex_30 0) v_subst_3 0) main_~y~4.base 0)))))) is different from true [2018-01-20 22:02:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-01-20 22:02:57,327 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:02:57,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2018-01-20 22:02:57,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-20 22:02:57,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-20 22:02:57,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1236, Unknown=13, NotChecked=70, Total=1406 [2018-01-20 22:02:57,328 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 38 states. [2018-01-20 22:02:58,650 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 135 DAG size of output 51 [2018-01-20 22:02:59,010 WARN L146 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 176 DAG size of output 56 [2018-01-20 22:02:59,209 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 120 DAG size of output 54 [2018-01-20 22:02:59,543 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 192 DAG size of output 57 [2018-01-20 22:02:59,759 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 195 DAG size of output 75 [2018-01-20 22:02:59,946 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 191 DAG size of output 69 [2018-01-20 22:03:00,147 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 118 DAG size of output 74 [2018-01-20 22:03:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:03:00,702 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-01-20 22:03:00,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-20 22:03:00,702 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 48 [2018-01-20 22:03:00,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:03:00,703 INFO L225 Difference]: With dead ends: 123 [2018-01-20 22:03:00,703 INFO L226 Difference]: Without dead ends: 120 [2018-01-20 22:03:00,704 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=269, Invalid=2799, Unknown=16, NotChecked=108, Total=3192 [2018-01-20 22:03:00,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-20 22:03:00,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2018-01-20 22:03:00,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-20 22:03:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2018-01-20 22:03:00,711 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 48 [2018-01-20 22:03:00,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:03:00,711 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2018-01-20 22:03:00,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-20 22:03:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-01-20 22:03:00,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-20 22:03:00,712 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:03:00,713 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-01-20 22:03:00,713 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-20 22:03:00,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1926183067, now seen corresponding path program 3 times [2018-01-20 22:03:00,713 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:03:00,713 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:03:00,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:03:00,714 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:03:00,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:03:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:03:00,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:03:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:03:00,850 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:03:00,850 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:03:00,856 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-20 22:03:00,864 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:03:00,871 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:03:00,888 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-20 22:03:00,889 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:03:00,893 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:03:00,898 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 6 treesize of output 5 [2018-01-20 22:03:00,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:00,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:00,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-01-20 22:03:00,920 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:00,921 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:00,921 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-20 22:03:00,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:00,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:00,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2018-01-20 22:03:00,935 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:03:00,936 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:03:00,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:00,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:00,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:00,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-20 22:03:00,954 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-01-20 22:03:00,956 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 14 treesize of output 13 [2018-01-20 22:03:00,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:00,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:00,963 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:03:00,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-01-20 22:03:00,983 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-01-20 22:03:00,985 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:00,986 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 34 treesize of output 45 [2018-01-20 22:03:00,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:00,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:00,997 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:03:00,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-01-20 22:03:01,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2018-01-20 22:03:01,077 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 7 treesize of output 1 [2018-01-20 22:03:01,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:01,083 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2018-01-20 22:03:01,083 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:01,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:01,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:01,089 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:46, output treesize:4 [2018-01-20 22:03:01,099 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:03:01,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:03:01,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 17 [2018-01-20 22:03:01,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-20 22:03:01,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-20 22:03:01,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-01-20 22:03:01,121 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 17 states. [2018-01-20 22:03:06,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:03:06,102 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2018-01-20 22:03:06,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-20 22:03:06,102 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-01-20 22:03:06,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:03:06,103 INFO L225 Difference]: With dead ends: 140 [2018-01-20 22:03:06,103 INFO L226 Difference]: Without dead ends: 137 [2018-01-20 22:03:06,104 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=451, Invalid=1271, Unknown=0, NotChecked=0, Total=1722 [2018-01-20 22:03:06,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-20 22:03:06,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 103. [2018-01-20 22:03:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-20 22:03:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-01-20 22:03:06,112 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 48 [2018-01-20 22:03:06,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:03:06,113 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-01-20 22:03:06,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-20 22:03:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-01-20 22:03:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-20 22:03:06,114 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:03:06,114 INFO L322 BasicCegarLoop]: trace histogram [3, 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] [2018-01-20 22:03:06,114 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-20 22:03:06,114 INFO L82 PathProgramCache]: Analyzing trace with hash 636693771, now seen corresponding path program 1 times [2018-01-20 22:03:06,114 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:03:06,114 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:03:06,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:03:06,115 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:03:06,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:03:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:03:06,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:03:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:03:06,943 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:03:06,943 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:03:06,948 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:03:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:03:06,972 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:03:06,974 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:03:06,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:06,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:06,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:03:06,986 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 15 treesize of output 12 [2018-01-20 22:03:06,987 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 12 treesize of output 11 [2018-01-20 22:03:06,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:06,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:06,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:06,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-20 22:03:07,013 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:07,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:07,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-20 22:03:07,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:07,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:07,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-01-20 22:03:07,066 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:03:07,067 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:03:07,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:07,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:07,079 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 19 treesize of output 24 [2018-01-20 22:03:07,080 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:03:07,080 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:07,084 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:07,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:07,090 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:36 [2018-01-20 22:03:07,122 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 69 treesize of output 64 [2018-01-20 22:03:07,124 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:07,125 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:07,125 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 51 [2018-01-20 22:03:07,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:07,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:07,145 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-01-20 22:03:07,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-20 22:03:07,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:07,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:07,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:07,159 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:64 [2018-01-20 22:03:07,194 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 64 treesize of output 63 [2018-01-20 22:03:07,197 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 44 treesize of output 49 [2018-01-20 22:03:07,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:07,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:07,217 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2018-01-20 22:03:07,220 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-01-20 22:03:07,220 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:07,226 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:07,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:07,234 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:61 [2018-01-20 22:03:07,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 52 [2018-01-20 22:03:07,327 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 1 [2018-01-20 22:03:07,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:07,336 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 36 treesize of output 33 [2018-01-20 22:03:07,337 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:03:07,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:03:07,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-20 22:03:07,359 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:68, output treesize:69 [2018-01-20 22:03:07,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-01-20 22:03:07,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-20 22:03:07,527 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:03:07,534 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:07,536 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:07,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 29 [2018-01-20 22:03:07,544 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-01-20 22:03:07,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:03:07,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:03:07,566 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:10 [2018-01-20 22:03:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:03:07,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:03:07,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 35 [2018-01-20 22:03:07,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-20 22:03:07,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-20 22:03:07,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1087, Unknown=0, NotChecked=0, Total=1190 [2018-01-20 22:03:07,639 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 35 states. [2018-01-20 22:03:09,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:03:09,527 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2018-01-20 22:03:09,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-20 22:03:09,527 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 51 [2018-01-20 22:03:09,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:03:09,528 INFO L225 Difference]: With dead ends: 138 [2018-01-20 22:03:09,528 INFO L226 Difference]: Without dead ends: 121 [2018-01-20 22:03:09,529 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=438, Invalid=3222, Unknown=0, NotChecked=0, Total=3660 [2018-01-20 22:03:09,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-20 22:03:09,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2018-01-20 22:03:09,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-20 22:03:09,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-01-20 22:03:09,533 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 51 [2018-01-20 22:03:09,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:03:09,534 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-01-20 22:03:09,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-20 22:03:09,534 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-01-20 22:03:09,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-20 22:03:09,535 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:03:09,535 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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] [2018-01-20 22:03:09,535 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation]=== [2018-01-20 22:03:09,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1085382690, now seen corresponding path program 4 times [2018-01-20 22:03:09,535 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:03:09,535 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:03:09,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:03:09,536 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:03:09,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:03:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:03:09,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:03:09,872 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:03:09,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:03:09,872 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:03:09,877 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-20 22:03:09,913 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:03:09,917 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:03:09,921 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:03:09,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:09,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:09,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-20 22:03:09,940 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:03:09,942 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:03:09,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:09,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:09,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:09,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-20 22:03:09,978 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 21 treesize of output 16 [2018-01-20 22:03:09,980 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:09,981 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 16 treesize of output 23 [2018-01-20 22:03:09,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:09,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:09,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:09,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-20 22:03:10,019 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 30 treesize of output 23 [2018-01-20 22:03:10,022 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:10,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:10,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:10,026 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 23 treesize of output 46 [2018-01-20 22:03:10,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:10,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:10,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:10,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-01-20 22:03:10,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:10,106 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:10,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-20 22:03:10,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:10,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:10,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:29 [2018-01-20 22:03:10,171 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 33 treesize of output 34 [2018-01-20 22:03:10,173 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:03:10,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:10,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:10,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:10,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-01-20 22:03:10,220 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 43 [2018-01-20 22:03:10,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:10,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 50 [2018-01-20 22:03:10,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:10,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:10,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:10,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:46 [2018-01-20 22:03:10,272 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2018-01-20 22:03:10,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:10,275 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 61 [2018-01-20 22:03:10,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:10,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:10,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:10,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-01-20 22:03:10,655 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:10,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 43 [2018-01-20 22:03:10,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:10,761 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 27 treesize of output 73 [2018-01-20 22:03:10,761 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-01-20 22:03:10,804 INFO L267 ElimStorePlain]: Start of recursive call 3: 104 dim-0 vars, End of recursive call: 104 dim-0 vars, and 112 xjuncts. [2018-01-20 22:03:11,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-01-20 22:03:11,203 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:11,207 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 23 treesize of output 16 [2018-01-20 22:03:11,207 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:11,208 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 23 treesize of output 16 [2018-01-20 22:03:11,208 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:11,210 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 17 [2018-01-20 22:03:11,210 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:11,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:03:11,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:03:11,235 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:64, output treesize:31 [2018-01-20 22:03:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:03:11,365 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:03:11,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 35 [2018-01-20 22:03:11,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-20 22:03:11,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-20 22:03:11,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2018-01-20 22:03:11,367 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 35 states. [2018-01-20 22:03:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:03:12,978 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-01-20 22:03:12,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-20 22:03:12,978 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 51 [2018-01-20 22:03:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:03:12,979 INFO L225 Difference]: With dead ends: 130 [2018-01-20 22:03:12,979 INFO L226 Difference]: Without dead ends: 87 [2018-01-20 22:03:12,980 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=338, Invalid=3202, Unknown=0, NotChecked=0, Total=3540 [2018-01-20 22:03:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-20 22:03:12,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2018-01-20 22:03:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-20 22:03:12,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-01-20 22:03:12,984 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 51 [2018-01-20 22:03:12,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:03:12,984 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-01-20 22:03:12,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-20 22:03:12,984 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-01-20 22:03:12,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-20 22:03:12,985 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:03:12,985 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 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] [2018-01-20 22:03:12,985 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation]=== [2018-01-20 22:03:12,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1764225032, now seen corresponding path program 5 times [2018-01-20 22:03:12,985 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:03:12,985 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:03:12,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:03:12,986 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:03:12,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:03:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:03:12,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:03:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:03:13,524 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:03:13,524 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:03:13,529 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-20 22:03:13,539 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:03:13,545 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:03:13,558 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:03:13,560 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:03:13,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:03:13,566 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 6 treesize of output 5 [2018-01-20 22:03:13,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:13,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:13,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-01-20 22:03:13,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:13,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:13,584 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:03:13,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:13,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:13,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:22 [2018-01-20 22:03:13,644 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:03:13,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, 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:03:13,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:13,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:13,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:13,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-01-20 22:03:13,684 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-01-20 22:03:13,685 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 14 treesize of output 13 [2018-01-20 22:03:13,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:13,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:13,697 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:03:13,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:47 [2018-01-20 22:03:13,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-01-20 22:03:13,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:13,739 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 41 treesize of output 54 [2018-01-20 22:03:13,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:13,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:13,756 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:03:13,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:56 [2018-01-20 22:03:13,842 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:13,842 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:13,843 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:13,843 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-20 22:03:13,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:13,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:03:13,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:63, output treesize:56 [2018-01-20 22:03:13,936 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-01-20 22:03:13,938 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:03:13,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:13,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:13,956 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:03:13,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:63 [2018-01-20 22:03:14,007 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 106 treesize of output 75 [2018-01-20 22:03:14,011 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:14,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:14,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 110 [2018-01-20 22:03:14,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-20 22:03:14,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:03:14,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-20 22:03:14,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:113, output treesize:191 [2018-01-20 22:03:14,170 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 118 treesize of output 91 [2018-01-20 22:03:14,173 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:14,173 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 88 treesize of output 113 [2018-01-20 22:03:14,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:14,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:14,235 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 77 [2018-01-20 22:03:14,237 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:14,238 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 75 treesize of output 96 [2018-01-20 22:03:14,238 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:14,250 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:14,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-20 22:03:14,278 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:217, output treesize:209 [2018-01-20 22:03:14,749 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 125 treesize of output 124 [2018-01-20 22:03:14,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:14,781 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 97 treesize of output 96 [2018-01-20 22:03:14,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:14,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-01-20 22:03:14,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:231, output treesize:213 [2018-01-20 22:03:14,986 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:14,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:14,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 82 [2018-01-20 22:03:14,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:15,015 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 61 [2018-01-20 22:03:15,018 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 9 xjuncts. [2018-01-20 22:03:15,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:15,057 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2018-01-20 22:03:15,057 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:15,059 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:15,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-01-20 22:03:15,059 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:15,061 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:15,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-01-20 22:03:15,061 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:15,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-01-20 22:03:15,086 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:15,087 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 16 treesize of output 9 [2018-01-20 22:03:15,088 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:15,089 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 15 treesize of output 8 [2018-01-20 22:03:15,089 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:15,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:03:15,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:15,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:15,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 82 [2018-01-20 22:03:15,201 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:15,212 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 57 [2018-01-20 22:03:15,214 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-01-20 22:03:15,234 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:15,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-20 22:03:15,235 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:15,245 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 7 treesize of output 1 [2018-01-20 22:03:15,245 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:15,251 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:03:15,333 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:15,335 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:15,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 94 [2018-01-20 22:03:15,342 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:15,348 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 61 [2018-01-20 22:03:15,349 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-20 22:03:15,376 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:15,378 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:15,379 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:15,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 74 [2018-01-20 22:03:15,387 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-01-20 22:03:15,427 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 25 treesize of output 18 [2018-01-20 22:03:15,427 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:15,428 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 28 treesize of output 21 [2018-01-20 22:03:15,428 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:15,430 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 31 treesize of output 20 [2018-01-20 22:03:15,430 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:15,452 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-20 22:03:15,555 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:15,556 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:15,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 94 [2018-01-20 22:03:15,564 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:15,570 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 61 [2018-01-20 22:03:15,571 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-20 22:03:15,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 35 treesize of output 16 [2018-01-20 22:03:15,596 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:15,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:15,617 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:15,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-01-20 22:03:15,626 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 5 xjuncts. [2018-01-20 22:03:15,666 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-20 22:03:15,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 12 xjuncts. [2018-01-20 22:03:15,822 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 14 variables, input treesize:469, output treesize:299 [2018-01-20 22:03:16,051 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:16,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-20 22:03:16,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:16,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:16,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:4 [2018-01-20 22:03:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:03:16,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:03:16,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 40 [2018-01-20 22:03:16,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-20 22:03:16,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-20 22:03:16,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2018-01-20 22:03:16,104 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 40 states. [2018-01-20 22:03:17,637 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 85 DAG size of output 63 [2018-01-20 22:03:18,308 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 120 DAG size of output 69 [2018-01-20 22:03:19,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:03:19,608 INFO L93 Difference]: Finished difference Result 195 states and 210 transitions. [2018-01-20 22:03:19,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-20 22:03:19,609 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 55 [2018-01-20 22:03:19,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:03:19,610 INFO L225 Difference]: With dead ends: 195 [2018-01-20 22:03:19,610 INFO L226 Difference]: Without dead ends: 192 [2018-01-20 22:03:19,611 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=575, Invalid=5745, Unknown=0, NotChecked=0, Total=6320 [2018-01-20 22:03:19,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-20 22:03:19,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 115. [2018-01-20 22:03:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-20 22:03:19,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-01-20 22:03:19,617 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 55 [2018-01-20 22:03:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:03:19,618 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-01-20 22:03:19,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-20 22:03:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-01-20 22:03:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-20 22:03:19,618 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:03:19,618 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-20 22:03:19,618 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation]=== [2018-01-20 22:03:19,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1371763707, now seen corresponding path program 6 times [2018-01-20 22:03:19,619 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:03:19,619 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:03:19,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:03:19,619 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:03:19,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:03:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:03:19,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:03:21,767 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:03:21,767 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:03:21,767 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:03:21,772 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-20 22:03:21,782 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:03:21,787 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:03:21,793 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:03:21,805 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-20 22:03:21,811 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:03:21,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:03:21,990 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:03:21,991 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:03:21,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:21,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:21,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:21,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-01-20 22:03:22,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:22,049 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-01-20 22:03:22,051 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 14 treesize of output 13 [2018-01-20 22:03:22,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:22,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:22,064 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:03:22,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-01-20 22:03:22,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:22,125 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2018-01-20 22:03:22,128 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:22,128 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 71 [2018-01-20 22:03:22,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:22,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:22,145 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:03:22,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:60 [2018-01-20 22:03:22,404 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:22,404 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:22,405 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:22,410 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:22,411 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 113 [2018-01-20 22:03:22,413 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 18 treesize of output 16 [2018-01-20 22:03:22,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:22,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:22,440 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:03:22,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:86 [2018-01-20 22:03:22,521 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:22,522 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:22,522 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:22,523 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:22,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:22,529 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 138 treesize of output 142 [2018-01-20 22:03:22,537 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:22,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:22,558 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 128 treesize of output 227 [2018-01-20 22:03:22,560 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-01-20 22:03:22,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-01-20 22:03:22,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-01-20 22:03:22,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:144, output treesize:548 [2018-01-20 22:03:22,947 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:22,948 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:22,949 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:22,950 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:22,953 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:22,955 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 129 treesize of output 143 [2018-01-20 22:03:22,959 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:22,970 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 201 [2018-01-20 22:03:22,971 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:03:23,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:23,049 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:23,049 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:23,050 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:23,051 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:23,055 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:23,056 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 149 treesize of output 157 [2018-01-20 22:03:23,077 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:23,100 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 218 [2018-01-20 22:03:23,101 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:03:23,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:03:23,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-20 22:03:23,182 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:279, output treesize:271 [2018-01-20 22:03:25,746 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:25,747 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:25,747 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:25,752 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:25,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 136 [2018-01-20 22:03:25,760 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:25,761 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:25,764 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:25,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:25,767 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:25,779 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 110 [2018-01-20 22:03:25,781 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-20 22:03:25,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:25,823 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 78 [2018-01-20 22:03:25,823 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:25,843 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 1 case distinctions, treesize of input 64 treesize of output 49 [2018-01-20 22:03:25,843 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:03:25,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:03:26,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 136 [2018-01-20 22:03:26,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-20 22:03:26,160 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-20 22:03:26,188 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,189 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,190 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,193 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,194 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 76 [2018-01-20 22:03:26,194 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:26,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,218 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2018-01-20 22:03:26,218 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:26,220 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,221 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 60 treesize of output 49 [2018-01-20 22:03:26,221 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:03:26,245 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:03:26,560 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,561 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,561 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,564 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 124 [2018-01-20 22:03:26,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,572 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,575 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 70 [2018-01-20 22:03:26,576 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:03:26,602 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 72 [2018-01-20 22:03:26,603 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:26,618 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 1 case distinctions, treesize of input 64 treesize of output 49 [2018-01-20 22:03:26,619 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:03:26,641 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:03:26,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,887 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 124 [2018-01-20 22:03:26,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,902 INFO L477 Elim1Store]: Elim1 applied some 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 85 treesize of output 103 [2018-01-20 22:03:26,903 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:03:26,931 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:03:26,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 68 [2018-01-20 22:03:26,932 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-20 22:03:26,953 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 64 treesize of output 49 [2018-01-20 22:03:26,954 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:03:26,977 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-20 22:03:27,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 12 dim-0 vars, and 8 xjuncts. [2018-01-20 22:03:27,253 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 14 variables, input treesize:685, output treesize:417 [2018-01-20 22:03:27,583 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~y~4.base Int) (v_arrayElimCell_125 Int) (v_prenex_206 Int)) (let ((.cse0 (store |c_old(#valid)| main_~y~4.base 1))) (let ((.cse1 (store .cse0 v_arrayElimCell_125 1))) (and (= 0 (select .cse0 v_arrayElimCell_125)) (= 0 (select .cse1 v_prenex_206)) (= (store (store (store .cse1 v_prenex_206 0) v_arrayElimCell_125 0) main_~y~4.base 0) |c_#valid|) (= 0 (select |c_old(#valid)| main_~y~4.base)) (not (= main_~y~4.base 0)) (not (= v_prenex_206 0)) (not (= 0 v_arrayElimCell_125)))))) is different from true [2018-01-20 22:03:27,635 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-01-20 22:03:27,654 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:03:27,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 55 [2018-01-20 22:03:27,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-01-20 22:03:27,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-01-20 22:03:27,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2808, Unknown=13, NotChecked=106, Total=3080 [2018-01-20 22:03:27,655 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 56 states. Received shutdown request... [2018-01-20 22:03:28,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:03:28,140 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:03:28,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:03:28 BoogieIcfgContainer [2018-01-20 22:03:28,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:03:28,142 INFO L168 Benchmark]: Toolchain (without parser) took 53101.65 ms. Allocated memory was 308.8 MB in the beginning and 737.1 MB in the end (delta: 428.3 MB). Free memory was 265.7 MB in the beginning and 570.5 MB in the end (delta: -304.8 MB). Peak memory consumption was 123.6 MB. Max. memory is 5.3 GB. [2018-01-20 22:03:28,143 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 308.8 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:03:28,144 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.41 ms. Allocated memory is still 308.8 MB. Free memory was 265.7 MB in the beginning and 255.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:03:28,144 INFO L168 Benchmark]: Boogie Preprocessor took 37.10 ms. Allocated memory is still 308.8 MB. Free memory was 255.8 MB in the beginning and 253.8 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:03:28,144 INFO L168 Benchmark]: RCFGBuilder took 250.44 ms. Allocated memory is still 308.8 MB. Free memory was 253.8 MB in the beginning and 234.8 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:03:28,144 INFO L168 Benchmark]: TraceAbstraction took 52598.09 ms. Allocated memory was 308.8 MB in the beginning and 737.1 MB in the end (delta: 428.3 MB). Free memory was 234.8 MB in the beginning and 570.5 MB in the end (delta: -335.7 MB). Peak memory consumption was 92.7 MB. Max. memory is 5.3 GB. [2018-01-20 22:03:28,146 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.22 ms. Allocated memory is still 308.8 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 208.41 ms. Allocated memory is still 308.8 MB. Free memory was 265.7 MB in the beginning and 255.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.10 ms. Allocated memory is still 308.8 MB. Free memory was 255.8 MB in the beginning and 253.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 250.44 ms. Allocated memory is still 308.8 MB. Free memory was 253.8 MB in the beginning and 234.8 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 52598.09 ms. Allocated memory was 308.8 MB in the beginning and 737.1 MB in the end (delta: 428.3 MB). Free memory was 234.8 MB in the beginning and 570.5 MB in the end (delta: -335.7 MB). Peak memory consumption was 92.7 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, 43 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=43occurred 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: [L633] Node* list = ((void *)0); [L634] Node* y = ((void *)0); VAL [list={0:0}, y={0:0}] [L635] EXPR, FCALL malloc(sizeof(*y)) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={0:0}] [L635] y = malloc(sizeof(*y)) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L636] FCALL y->next = ((void *)0) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L637] FCALL y->prev = ((void *)0) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L638] FCALL y->pData = &y->data VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L639] list = y VAL [list={15:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L640] COND FALSE !(__VERIFIER_nondet_int()) [L655] COND TRUE ((void *)0) != list [L657] y = list VAL [list={15:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L658] EXPR, FCALL list->next VAL [list={15:0}, list->next={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L658] list = list->next [L659] EXPR, FCALL y->pData VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}, y->pData={15:12}] [L659] COND FALSE !(&y->data != y->pData) [L663] FCALL free(y) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L655] COND FALSE !(((void *)0) != list) VAL [list={0:0}, malloc(sizeof(*y))={15:0}, y={15:0}] [L665] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 43 locations, 3 error locations. UNSAFE Result, 0.5s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 75 SDtfs, 96 SDslu, 58 SDs, 0 SdLazy, 44 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=2, 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.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 23 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 37 ConstructedInterpolants, 0 QuantifiedInterpolants, 1289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (115states) and interpolant automaton (currently 6 states, 56 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 58 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 43 locations, 3 error locations. TIMEOUT Result, 51.8s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 24.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 568 SDtfs, 2284 SDslu, 5118 SDs, 0 SdLazy, 9285 SolverSat, 1042 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1085 GetRequests, 417 SyntacticMatches, 48 SemanticMatches, 619 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 6103 ImplicationChecksByTransitivity, 29.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=16, 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.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 369 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 1237 NumberOfCodeBlocks, 1237 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1208 ConstructedInterpolants, 185 QuantifiedInterpolants, 2119943 SizeOfPredicates, 202 NumberOfNonLiveVariables, 1897 ConjunctsInSsa, 495 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 98/443 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-03-28-152.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-03-28-152.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-03-28-152.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_22-03-28-152.csv Completed graceful shutdown