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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 23:38:34,540 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 23:38:34,541 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 23:38:34,552 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 23:38:34,552 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 23:38:34,553 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 23:38:34,554 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 23:38:34,555 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 23:38:34,556 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 23:38:34,557 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 23:38:34,558 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 23:38:34,558 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 23:38:34,559 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 23:38:34,560 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 23:38:34,560 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 23:38:34,562 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 23:38:34,564 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 23:38:34,565 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 23:38:34,566 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 23:38:34,567 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 23:38:34,569 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 23:38:34,569 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 23:38:34,570 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 23:38:34,571 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 23:38:34,571 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 23:38:34,572 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 23:38:34,572 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 23:38:34,573 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 23:38:34,573 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 23:38:34,573 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 23:38:34,574 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 23:38:34,574 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 23:38:34,584 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 23:38:34,584 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 23:38:34,585 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 23:38:34,586 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 23:38:34,586 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 23:38:34,586 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 23:38:34,586 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 23:38:34,586 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 23:38:34,586 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 23:38:34,587 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 23:38:34,587 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 23:38:34,587 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 23:38:34,587 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 23:38:34,587 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 23:38:34,587 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 23:38:34,588 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 23:38:34,588 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 23:38:34,588 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 23:38:34,588 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 23:38:34,588 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 23:38:34,588 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 23:38:34,589 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 23:38:34,589 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 23:38:34,589 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 23:38:34,589 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 23:38:34,618 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 23:38:34,628 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 23:38:34,632 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 23:38:34,633 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 23:38:34,633 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 23:38:34,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-02-03 23:38:34,780 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 23:38:34,781 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 23:38:34,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 23:38:34,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 23:38:34,788 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 23:38:34,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:38:34" (1/1) ... [2018-02-03 23:38:34,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e017f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:38:34, skipping insertion in model container [2018-02-03 23:38:34,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:38:34" (1/1) ... [2018-02-03 23:38:34,806 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:38:34,836 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:38:34,922 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:38:34,934 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:38:34,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:38:34 WrapperNode [2018-02-03 23:38:34,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 23:38:34,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 23:38:34,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 23:38:34,943 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 23:38:34,957 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:38:34" (1/1) ... [2018-02-03 23:38:34,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:38:34" (1/1) ... [2018-02-03 23:38:34,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:38:34" (1/1) ... [2018-02-03 23:38:34,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:38:34" (1/1) ... [2018-02-03 23:38:34,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:38:34" (1/1) ... [2018-02-03 23:38:34,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:38:34" (1/1) ... [2018-02-03 23:38:34,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:38:34" (1/1) ... [2018-02-03 23:38:34,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 23:38:34,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 23:38:34,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 23:38:34,974 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 23:38:34,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:38:34" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-03 23:38:35,011 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 23:38:35,011 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 23:38:35,011 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-03 23:38:35,012 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 23:38:35,012 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-03 23:38:35,012 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-03 23:38:35,012 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 23:38:35,012 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 23:38:35,012 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 23:38:35,012 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 23:38:35,012 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 23:38:35,012 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-02-03 23:38:35,012 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-02-03 23:38:35,012 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-03 23:38:35,012 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-03 23:38:35,012 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-02-03 23:38:35,013 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-03 23:38:35,013 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 23:38:35,013 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 23:38:35,013 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 23:38:35,111 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-03 23:38:35,213 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 23:38:35,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:38:35 BoogieIcfgContainer [2018-02-03 23:38:35,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 23:38:35,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 23:38:35,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 23:38:35,216 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 23:38:35,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 11:38:34" (1/3) ... [2018-02-03 23:38:35,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e0cd8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:38:35, skipping insertion in model container [2018-02-03 23:38:35,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:38:34" (2/3) ... [2018-02-03 23:38:35,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e0cd8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:38:35, skipping insertion in model container [2018-02-03 23:38:35,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:38:35" (3/3) ... [2018-02-03 23:38:35,218 INFO L107 eAbstractionObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-02-03 23:38:35,223 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 23:38:35,227 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-03 23:38:35,256 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 23:38:35,256 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 23:38:35,256 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 23:38:35,257 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 23:38:35,257 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 23:38:35,257 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 23:38:35,257 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 23:38:35,257 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 23:38:35,258 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 23:38:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-02-03 23:38:35,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-03 23:38:35,277 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:38:35,277 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-03 23:38:35,278 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-03 23:38:35,281 INFO L82 PathProgramCache]: Analyzing trace with hash 2931467, now seen corresponding path program 1 times [2018-02-03 23:38:35,282 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:38:35,282 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:38:35,311 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:35,312 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:38:35,312 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:38:35,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:38:35,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:38:35,397 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:38:35,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:38:35,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:38:35,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:38:35,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:38:35,409 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-02-03 23:38:35,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:38:35,487 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-02-03 23:38:35,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:38:35,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-03 23:38:35,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:38:35,495 INFO L225 Difference]: With dead ends: 60 [2018-02-03 23:38:35,496 INFO L226 Difference]: Without dead ends: 57 [2018-02-03 23:38:35,497 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:38:35,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-03 23:38:35,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-03 23:38:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-03 23:38:35,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-02-03 23:38:35,583 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 4 [2018-02-03 23:38:35,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:38:35,583 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-02-03 23:38:35,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:38:35,584 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-02-03 23:38:35,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-03 23:38:35,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:38:35,584 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-03 23:38:35,584 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-03 23:38:35,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2931468, now seen corresponding path program 1 times [2018-02-03 23:38:35,585 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:38:35,585 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:38:35,586 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:35,586 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:38:35,586 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:38:35,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:38:35,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:38:35,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:38:35,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:38:35,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:38:35,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:38:35,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:38:35,634 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 3 states. [2018-02-03 23:38:35,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:38:35,679 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-02-03 23:38:35,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:38:35,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-03 23:38:35,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:38:35,680 INFO L225 Difference]: With dead ends: 53 [2018-02-03 23:38:35,680 INFO L226 Difference]: Without dead ends: 53 [2018-02-03 23:38:35,681 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:38:35,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-03 23:38:35,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-03 23:38:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-03 23:38:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-02-03 23:38:35,685 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 4 [2018-02-03 23:38:35,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:38:35,686 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-02-03 23:38:35,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:38:35,686 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-02-03 23:38:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 23:38:35,687 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:38:35,687 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:38:35,687 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-03 23:38:35,687 INFO L82 PathProgramCache]: Analyzing trace with hash -240006955, now seen corresponding path program 1 times [2018-02-03 23:38:35,687 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:38:35,687 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:38:35,688 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:35,688 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:38:35,688 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:38:35,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:38:35,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:38:35,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:38:35,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:38:35,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:38:35,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:38:35,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:38:35,769 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 3 states. [2018-02-03 23:38:35,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:38:35,804 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-02-03 23:38:35,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:38:35,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-02-03 23:38:35,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:38:35,805 INFO L225 Difference]: With dead ends: 51 [2018-02-03 23:38:35,805 INFO L226 Difference]: Without dead ends: 51 [2018-02-03 23:38:35,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:38:35,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-03 23:38:35,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-03 23:38:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-03 23:38:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-02-03 23:38:35,808 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 14 [2018-02-03 23:38:35,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:38:35,808 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-02-03 23:38:35,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:38:35,808 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-02-03 23:38:35,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 23:38:35,809 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:38:35,809 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:38:35,809 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-03 23:38:35,809 INFO L82 PathProgramCache]: Analyzing trace with hash -240006954, now seen corresponding path program 1 times [2018-02-03 23:38:35,809 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:38:35,809 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:38:35,810 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:35,810 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:38:35,810 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:38:35,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:38:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:38:35,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:38:35,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:38:35,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:38:35,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:38:35,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:38:35,874 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 4 states. [2018-02-03 23:38:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:38:35,902 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-02-03 23:38:35,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:38:35,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-03 23:38:35,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:38:35,903 INFO L225 Difference]: With dead ends: 49 [2018-02-03 23:38:35,903 INFO L226 Difference]: Without dead ends: 49 [2018-02-03 23:38:35,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:38:35,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-03 23:38:35,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-03 23:38:35,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-03 23:38:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-02-03 23:38:35,907 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 14 [2018-02-03 23:38:35,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:38:35,908 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-02-03 23:38:35,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:38:35,908 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-02-03 23:38:35,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-03 23:38:35,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:38:35,908 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:38:35,908 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-03 23:38:35,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1149718964, now seen corresponding path program 1 times [2018-02-03 23:38:35,909 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:38:35,909 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:38:35,910 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:35,910 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:38:35,910 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:38:35,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:38:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:38:36,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:38:36,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:38:36,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:38:36,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:38:36,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:38:36,039 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 5 states. [2018-02-03 23:38:36,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:38:36,097 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-02-03 23:38:36,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:38:36,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-03 23:38:36,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:38:36,098 INFO L225 Difference]: With dead ends: 47 [2018-02-03 23:38:36,098 INFO L226 Difference]: Without dead ends: 47 [2018-02-03 23:38:36,098 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-03 23:38:36,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-03 23:38:36,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-03 23:38:36,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-03 23:38:36,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-02-03 23:38:36,102 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 15 [2018-02-03 23:38:36,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:38:36,102 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-02-03 23:38:36,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:38:36,103 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-02-03 23:38:36,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-03 23:38:36,103 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:38:36,103 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:38:36,103 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-03 23:38:36,104 INFO L82 PathProgramCache]: Analyzing trace with hash 536104684, now seen corresponding path program 1 times [2018-02-03 23:38:36,104 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:38:36,104 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:38:36,105 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:36,105 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:38:36,105 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:38:36,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:38:36,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:38:36,142 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:38:36,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:38:36,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:38:36,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:38:36,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:38:36,143 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 3 states. [2018-02-03 23:38:36,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:38:36,162 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-02-03 23:38:36,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:38:36,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-02-03 23:38:36,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:38:36,163 INFO L225 Difference]: With dead ends: 45 [2018-02-03 23:38:36,163 INFO L226 Difference]: Without dead ends: 45 [2018-02-03 23:38:36,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:38:36,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-03 23:38:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-03 23:38:36,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-03 23:38:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-02-03 23:38:36,165 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 27 [2018-02-03 23:38:36,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:38:36,166 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-02-03 23:38:36,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:38:36,166 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-02-03 23:38:36,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-03 23:38:36,167 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:38:36,167 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:38:36,167 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-03 23:38:36,167 INFO L82 PathProgramCache]: Analyzing trace with hash 536104685, now seen corresponding path program 1 times [2018-02-03 23:38:36,167 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:38:36,167 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:38:36,168 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:36,168 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:38:36,168 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:38:36,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:38:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:38:36,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:38:36,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 23:38:36,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 23:38:36,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 23:38:36,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:38:36,244 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 8 states. [2018-02-03 23:38:36,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:38:36,380 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-02-03 23:38:36,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 23:38:36,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-02-03 23:38:36,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:38:36,381 INFO L225 Difference]: With dead ends: 44 [2018-02-03 23:38:36,381 INFO L226 Difference]: Without dead ends: 44 [2018-02-03 23:38:36,382 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:38:36,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-03 23:38:36,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-03 23:38:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-03 23:38:36,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-02-03 23:38:36,383 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 27 [2018-02-03 23:38:36,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:38:36,384 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-02-03 23:38:36,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 23:38:36,384 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-02-03 23:38:36,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-03 23:38:36,384 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:38:36,384 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:38:36,384 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-03 23:38:36,384 INFO L82 PathProgramCache]: Analyzing trace with hash 536104686, now seen corresponding path program 1 times [2018-02-03 23:38:36,384 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:38:36,385 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:38:36,385 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:36,385 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:38:36,385 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:38:36,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:38:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:38:36,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:38:36,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:38:36,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:38:36,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:38:36,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:38:36,433 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 3 states. [2018-02-03 23:38:36,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:38:36,463 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-02-03 23:38:36,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:38:36,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-02-03 23:38:36,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:38:36,464 INFO L225 Difference]: With dead ends: 42 [2018-02-03 23:38:36,464 INFO L226 Difference]: Without dead ends: 42 [2018-02-03 23:38:36,465 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:38:36,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-03 23:38:36,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-03 23:38:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-03 23:38:36,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-02-03 23:38:36,467 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 27 [2018-02-03 23:38:36,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:38:36,467 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-02-03 23:38:36,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:38:36,467 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-02-03 23:38:36,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-03 23:38:36,468 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:38:36,468 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-03 23:38:36,468 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-03 23:38:36,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1677513941, now seen corresponding path program 1 times [2018-02-03 23:38:36,468 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:38:36,468 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:38:36,469 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:36,469 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:38:36,469 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:38:36,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:38:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-03 23:38:36,529 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:38:36,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:38:36,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:38:36,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:38:36,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:38:36,530 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 4 states. [2018-02-03 23:38:36,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:38:36,543 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-02-03 23:38:36,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:38:36,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-03 23:38:36,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:38:36,544 INFO L225 Difference]: With dead ends: 48 [2018-02-03 23:38:36,544 INFO L226 Difference]: Without dead ends: 44 [2018-02-03 23:38:36,544 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:38:36,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-03 23:38:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-03 23:38:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-03 23:38:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-02-03 23:38:36,547 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 35 [2018-02-03 23:38:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:38:36,547 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-02-03 23:38:36,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:38:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-02-03 23:38:36,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-03 23:38:36,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:38:36,548 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-03 23:38:36,548 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-03 23:38:36,549 INFO L82 PathProgramCache]: Analyzing trace with hash -656412319, now seen corresponding path program 1 times [2018-02-03 23:38:36,549 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:38:36,549 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:38:36,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:36,550 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:38:36,550 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:38:36,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:38:36,630 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-03 23:38:36,630 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:38:36,630 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 23:38:36,647 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:38:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:38:36,681 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:38:36,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-03 23:38:36,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:38:36,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-02-03 23:38:36,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 23:38:36,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 23:38:36,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:38:36,730 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 8 states. [2018-02-03 23:38:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:38:36,755 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-02-03 23:38:36,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:38:36,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-02-03 23:38:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:38:36,757 INFO L225 Difference]: With dead ends: 50 [2018-02-03 23:38:36,757 INFO L226 Difference]: Without dead ends: 46 [2018-02-03 23:38:36,757 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:38:36,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-03 23:38:36,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-03 23:38:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-03 23:38:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-02-03 23:38:36,760 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 37 [2018-02-03 23:38:36,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:38:36,760 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-02-03 23:38:36,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 23:38:36,761 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-02-03 23:38:36,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-03 23:38:36,761 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:38:36,761 INFO L351 BasicCegarLoop]: trace histogram [4, 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] [2018-02-03 23:38:36,762 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-03 23:38:36,762 INFO L82 PathProgramCache]: Analyzing trace with hash -2111815019, now seen corresponding path program 2 times [2018-02-03 23:38:36,762 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:38:36,762 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:38:36,767 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:36,767 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:38:36,767 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:38:36,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:38:36,858 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-03 23:38:36,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:38:36,858 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 23:38:36,865 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 23:38:36,912 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 23:38:36,913 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:38:36,915 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:38:36,941 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-03 23:38:36,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:38:36,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-02-03 23:38:36,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 23:38:36,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 23:38:36,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-02-03 23:38:36,973 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 10 states. [2018-02-03 23:38:37,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:38:37,011 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-02-03 23:38:37,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:38:37,012 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-02-03 23:38:37,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:38:37,012 INFO L225 Difference]: With dead ends: 52 [2018-02-03 23:38:37,012 INFO L226 Difference]: Without dead ends: 48 [2018-02-03 23:38:37,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:38:37,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-03 23:38:37,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-03 23:38:37,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-03 23:38:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-02-03 23:38:37,016 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 39 [2018-02-03 23:38:37,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:38:37,016 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-02-03 23:38:37,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 23:38:37,016 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-02-03 23:38:37,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-03 23:38:37,017 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:38:37,017 INFO L351 BasicCegarLoop]: trace histogram [6, 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] [2018-02-03 23:38:37,017 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-03 23:38:37,017 INFO L82 PathProgramCache]: Analyzing trace with hash 304342049, now seen corresponding path program 3 times [2018-02-03 23:38:37,018 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:38:37,018 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:38:37,018 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:37,019 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:38:37,019 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:38:37,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:38:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-03 23:38:37,087 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:38:37,087 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 23:38:37,092 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 23:38:37,146 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-03 23:38:37,146 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:38:37,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:38:37,171 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-03 23:38:37,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:38:37,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-02-03 23:38:37,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 23:38:37,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 23:38:37,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:38:37,189 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 12 states. [2018-02-03 23:38:37,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:38:37,227 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-02-03 23:38:37,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 23:38:37,227 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-02-03 23:38:37,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:38:37,227 INFO L225 Difference]: With dead ends: 54 [2018-02-03 23:38:37,227 INFO L226 Difference]: Without dead ends: 50 [2018-02-03 23:38:37,228 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-02-03 23:38:37,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-03 23:38:37,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-03 23:38:37,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-03 23:38:37,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-02-03 23:38:37,229 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 41 [2018-02-03 23:38:37,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:38:37,230 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-02-03 23:38:37,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 23:38:37,230 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-02-03 23:38:37,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-03 23:38:37,230 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:38:37,231 INFO L351 BasicCegarLoop]: trace histogram [8, 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] [2018-02-03 23:38:37,231 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-03 23:38:37,231 INFO L82 PathProgramCache]: Analyzing trace with hash 747384917, now seen corresponding path program 4 times [2018-02-03 23:38:37,231 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:38:37,231 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:38:37,232 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:37,232 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:38:37,232 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:38:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:38:37,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:38:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-03 23:38:38,030 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:38:38,030 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 23:38:38,035 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-03 23:38:38,061 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-03 23:38:38,061 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:38:38,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:38:38,122 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-02-03 23:38:38,124 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-02-03 23:38:38,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:38:38,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:38:38,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:38:38,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-02-03 23:38:42,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 54 [2018-02-03 23:38:42,625 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 57 [2018-02-03 23:38:42,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:38:42,633 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2018-02-03 23:38:42,637 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:38:42,638 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:38:42,641 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 78 [2018-02-03 23:38:42,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:38:42,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:38:42,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:38:42,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:38:42,662 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 109 [2018-02-03 23:38:42,663 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:38:42,674 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:38:42,680 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:38:42,686 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:38:42,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:38:42,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-03 23:38:42,713 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:189, output treesize:78 [2018-02-03 23:38:42,753 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 7 treesize of output 5 [2018-02-03 23:38:42,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:38:42,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:38:42,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-02-03 23:38:45,067 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 95 DAG size of output 33 [2018-02-03 23:38:45,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 54 [2018-02-03 23:38:45,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 57 [2018-02-03 23:38:45,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:38:45,097 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2018-02-03 23:38:45,106 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:38:45,107 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:38:45,110 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 78 [2018-02-03 23:38:45,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:38:45,123 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:38:45,124 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:38:45,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:38:45,132 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 109 [2018-02-03 23:38:45,133 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:38:45,151 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:38:45,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:38:45,172 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:38:45,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:38:45,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-03 23:38:45,220 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:189, output treesize:78 [2018-02-03 23:38:45,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 49 [2018-02-03 23:38:45,301 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 0 case distinctions, treesize of input 20 treesize of output 3 [2018-02-03 23:38:45,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:38:45,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:38:45,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:38:45,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:76, output treesize:3 [2018-02-03 23:38:45,334 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 32 refuted. 11 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-03 23:38:45,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:38:45,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 35 [2018-02-03 23:38:45,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-03 23:38:45,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-03 23:38:45,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1075, Unknown=14, NotChecked=0, Total=1260 [2018-02-03 23:38:45,365 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 36 states. [2018-02-03 23:38:56,343 WARN L146 SmtUtils]: Spent 255ms on a formula simplification. DAG size of input: 84 DAG size of output 72 [2018-02-03 23:39:03,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:39:03,713 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2018-02-03 23:39:03,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-03 23:39:03,714 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-02-03 23:39:03,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:39:03,716 INFO L225 Difference]: With dead ends: 97 [2018-02-03 23:39:03,716 INFO L226 Difference]: Without dead ends: 97 [2018-02-03 23:39:03,717 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=426, Invalid=2851, Unknown=29, NotChecked=0, Total=3306 [2018-02-03 23:39:03,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-03 23:39:03,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 74. [2018-02-03 23:39:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-03 23:39:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2018-02-03 23:39:03,724 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 43 [2018-02-03 23:39:03,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:39:03,725 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2018-02-03 23:39:03,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-03 23:39:03,725 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2018-02-03 23:39:03,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-03 23:39:03,726 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:39:03,726 INFO L351 BasicCegarLoop]: trace histogram [8, 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] [2018-02-03 23:39:03,726 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-03 23:39:03,727 INFO L82 PathProgramCache]: Analyzing trace with hash 747384918, now seen corresponding path program 1 times [2018-02-03 23:39:03,727 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:39:03,727 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:39:03,727 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:39:03,728 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:39:03,728 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:39:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:39:03,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:39:04,389 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-03 23:39:04,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:39:04,389 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 23:39:04,403 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:39:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:39:04,436 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:39:04,440 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-02-03 23:39:04,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:04,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:04,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-03 23:39:04,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:04,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:04,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-03 23:39:04,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:04,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:04,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-02-03 23:39:04,503 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-02-03 23:39:04,504 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-02-03 23:39:04,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:04,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:04,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:04,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-03 23:39:04,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-02-03 23:39:04,538 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-02-03 23:39:04,539 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:39:04,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:39:04,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:39:04,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-02-03 23:39:05,030 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 110 DAG size of output 46 [2018-02-03 23:39:05,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 68 [2018-02-03 23:39:05,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 69 [2018-02-03 23:39:05,056 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,057 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 57 [2018-02-03 23:39:05,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,061 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,064 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 76 [2018-02-03 23:39:05,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,068 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,069 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,070 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,070 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,071 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,078 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 105 [2018-02-03 23:39:05,078 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:05,091 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:05,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:05,107 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:05,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:05,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-03 23:39:05,157 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:226, output treesize:99 [2018-02-03 23:39:05,210 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-02-03 23:39:05,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:05,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:39:05,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:91, output treesize:77 [2018-02-03 23:39:05,279 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,281 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-02-03 23:39:05,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-03 23:39:05,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-03 23:39:05,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:86, output treesize:174 [2018-02-03 23:39:05,386 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 1 case distinctions, treesize of input 88 treesize of output 76 [2018-02-03 23:39:05,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,390 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,392 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,393 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2018-02-03 23:39:05,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:05,419 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-02-03 23:39:05,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:39:05,435 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-02-03 23:39:05,435 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:39:05,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-03 23:39:05,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 75 [2018-02-03 23:39:05,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,486 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,486 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,487 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,487 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:05,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 79 [2018-02-03 23:39:05,492 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:05,515 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 31 treesize of output 29 [2018-02-03 23:39:05,515 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:39:05,531 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 27 treesize of output 25 [2018-02-03 23:39:05,532 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:39:05,545 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-03 23:39:05,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-02-03 23:39:05,572 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:174, output treesize:95 [2018-02-03 23:39:39,635 WARN L146 SmtUtils]: Spent 33216ms on a formula simplification. DAG size of input: 421 DAG size of output 179 [2018-02-03 23:39:39,656 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 3 case distinctions, treesize of input 140 treesize of output 122 [2018-02-03 23:39:39,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,661 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,662 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 178 [2018-02-03 23:39:39,673 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,677 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 143 [2018-02-03 23:39:39,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,701 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 173 [2018-02-03 23:39:39,742 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-03 23:39:39,742 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:39,838 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,838 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,839 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 188 [2018-02-03 23:39:39,862 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-02-03 23:39:39,933 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,934 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,934 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,936 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,936 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:39,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 139 [2018-02-03 23:39:39,950 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-03 23:39:40,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,006 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,012 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 81 treesize of output 212 [2018-02-03 23:39:40,047 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2018-02-03 23:39:40,119 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:40,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:40,172 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:40,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:39:40,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 137 treesize of output 133 [2018-02-03 23:39:40,695 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 144 [2018-02-03 23:39:40,697 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,698 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2018-02-03 23:39:40,701 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,701 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,702 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,704 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 66 [2018-02-03 23:39:40,707 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,707 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,708 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,709 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,709 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:40,715 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 93 [2018-02-03 23:39:40,715 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:40,725 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:40,730 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:40,751 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:40,801 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:39:41,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 124 [2018-02-03 23:39:41,115 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 135 [2018-02-03 23:39:41,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,118 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2018-02-03 23:39:41,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,121 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,124 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 66 [2018-02-03 23:39:41,126 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,127 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,127 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,133 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 93 [2018-02-03 23:39:41,133 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:41,152 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:41,158 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:41,176 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:41,220 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:41,456 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 3 case distinctions, treesize of input 131 treesize of output 113 [2018-02-03 23:39:41,459 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,461 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 169 [2018-02-03 23:39:41,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 143 [2018-02-03 23:39:41,492 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,492 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,494 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:39:41,499 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:39:41,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 144 [2018-02-03 23:39:41,503 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,504 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,504 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,506 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,506 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 126 [2018-02-03 23:39:41,520 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-02-03 23:39:41,555 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:41,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 173 [2018-02-03 23:39:41,613 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,613 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,614 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,616 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,616 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 151 treesize of output 208 [2018-02-03 23:39:41,641 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 4 xjuncts. [2018-02-03 23:39:41,734 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,734 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,735 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,736 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,737 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,737 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 133 [2018-02-03 23:39:41,750 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-02-03 23:39:41,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,802 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,803 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,805 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,809 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,810 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,810 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:41,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 81 treesize of output 212 [2018-02-03 23:39:41,847 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 8 xjuncts. [2018-02-03 23:39:41,910 INFO L267 ElimStorePlain]: Start of recursive call 25: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:41,922 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:41,949 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:41,982 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:39:42,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 4 dim-2 vars, End of recursive call: 20 dim-0 vars, and 4 xjuncts. [2018-02-03 23:39:42,083 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 21 variables, input treesize:1029, output treesize:547 [2018-02-03 23:39:42,327 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 192 DAG size of output 92 [2018-02-03 23:39:42,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 113 [2018-02-03 23:39:42,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2018-02-03 23:39:42,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:42,422 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,422 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,424 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,424 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 101 [2018-02-03 23:39:42,428 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:42,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,474 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2018-02-03 23:39:42,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:42,513 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 37 treesize of output 30 [2018-02-03 23:39:42,514 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:42,545 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 29 treesize of output 22 [2018-02-03 23:39:42,546 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:42,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:42,611 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 1 case distinctions, treesize of input 121 treesize of output 95 [2018-02-03 23:39:42,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,620 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,620 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,627 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:42,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 96 [2018-02-03 23:39:42,656 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:42,679 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 34 treesize of output 25 [2018-02-03 23:39:42,679 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:42,692 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 30 treesize of output 21 [2018-02-03 23:39:42,692 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:42,699 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:42,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-03 23:39:42,708 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 11 variables, input treesize:251, output treesize:32 [2018-02-03 23:39:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 45 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:39:42,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:39:42,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2018-02-03 23:39:42,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-03 23:39:42,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-03 23:39:42,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1993, Unknown=12, NotChecked=0, Total=2256 [2018-02-03 23:39:42,789 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand 48 states. [2018-02-03 23:39:43,378 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 101 DAG size of output 70 [2018-02-03 23:39:43,705 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 145 DAG size of output 93 [2018-02-03 23:39:44,498 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 38 DAG size of output 38 [2018-02-03 23:39:44,818 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 77 DAG size of output 62 [2018-02-03 23:39:45,177 WARN L146 SmtUtils]: Spent 250ms on a formula simplification. DAG size of input: 111 DAG size of output 85 [2018-02-03 23:39:47,248 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 135 DAG size of output 133 [2018-02-03 23:39:47,504 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 149 DAG size of output 136 [2018-02-03 23:39:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:39:47,543 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2018-02-03 23:39:47,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-03 23:39:47,543 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 43 [2018-02-03 23:39:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:39:47,544 INFO L225 Difference]: With dead ends: 94 [2018-02-03 23:39:47,544 INFO L226 Difference]: Without dead ends: 94 [2018-02-03 23:39:47,545 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1531 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=611, Invalid=5062, Unknown=27, NotChecked=0, Total=5700 [2018-02-03 23:39:47,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-03 23:39:47,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-02-03 23:39:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-03 23:39:47,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2018-02-03 23:39:47,549 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 43 [2018-02-03 23:39:47,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:39:47,549 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2018-02-03 23:39:47,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-03 23:39:47,549 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2018-02-03 23:39:47,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-03 23:39:47,550 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:39:47,550 INFO L351 BasicCegarLoop]: trace histogram [8, 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-02-03 23:39:47,550 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-03 23:39:47,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1348121705, now seen corresponding path program 1 times [2018-02-03 23:39:47,550 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:39:47,550 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:39:47,551 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:39:47,551 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:39:47,551 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:39:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:39:47,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:39:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 47 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-03 23:39:49,063 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:39:49,063 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 23:39:49,068 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:39:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:39:49,093 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:39:49,148 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-02-03 23:39:49,149 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-02-03 23:39:49,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:49,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:49,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:49,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:45 [2018-02-03 23:39:49,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:49,196 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-02-03 23:39:49,212 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:49,212 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 25 treesize of output 29 [2018-02-03 23:39:49,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:49,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:49,224 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 26 treesize of output 20 [2018-02-03 23:39:49,226 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-02-03 23:39:49,226 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:39:49,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:39:49,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:39:49,236 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:25 [2018-02-03 23:39:53,891 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 115 DAG size of output 53 [2018-02-03 23:39:53,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 79 [2018-02-03 23:39:53,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 82 [2018-02-03 23:39:53,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:53,921 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2018-02-03 23:39:53,923 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:53,924 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:53,925 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:53,929 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 71 [2018-02-03 23:39:53,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:53,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:53,933 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:53,934 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:53,934 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:53,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:53,940 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 99 [2018-02-03 23:39:53,940 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:53,951 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:53,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:53,967 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:54,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:54,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-03 23:39:54,021 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:239, output treesize:121 [2018-02-03 23:39:54,340 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,341 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-02-03 23:39:54,343 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,343 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 57 [2018-02-03 23:39:54,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,370 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 52 [2018-02-03 23:39:54,372 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 40 [2018-02-03 23:39:54,373 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:54,379 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:54,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-02-03 23:39:54,383 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 36 [2018-02-03 23:39:54,383 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:54,388 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:54,398 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:39:54,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:39:54,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 73 [2018-02-03 23:39:54,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,435 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:39:54,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,436 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,436 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,437 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:39:54,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,440 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,440 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:39:54,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 100 [2018-02-03 23:39:54,455 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:39:54,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,486 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,486 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,487 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,492 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2018-02-03 23:39:54,492 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:54,511 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-02-03 23:39:54,511 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:39:54,522 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-03 23:39:54,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 81 [2018-02-03 23:39:54,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,532 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,533 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,533 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,534 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,535 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:54,539 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 70 [2018-02-03 23:39:54,540 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:54,568 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-02-03 23:39:54,570 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:39:54,588 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 30 treesize of output 27 [2018-02-03 23:39:54,588 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:39:54,611 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-03 23:39:54,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-02-03 23:39:54,655 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:130, output treesize:119 [2018-02-03 23:39:59,564 WARN L146 SmtUtils]: Spent 439ms on a formula simplification. DAG size of input: 137 DAG size of output 75 [2018-02-03 23:39:59,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 148 treesize of output 147 [2018-02-03 23:39:59,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:59,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:59,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:59,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:59,613 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:59,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 114 [2018-02-03 23:39:59,621 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:59,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:59,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:59,623 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:39:59,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 111 [2018-02-03 23:39:59,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:59,634 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:39:59,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 92 [2018-02-03 23:39:59,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:59,640 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:39:59,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 78 [2018-02-03 23:39:59,642 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:59,652 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:59,662 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:59,677 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:59,899 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 147 [2018-02-03 23:39:59,902 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:59,904 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2018-02-03 23:39:59,918 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:59,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:59,920 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:59,926 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 66 [2018-02-03 23:39:59,929 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:59,930 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:59,931 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:59,931 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:59,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:59,933 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:39:59,939 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 93 [2018-02-03 23:39:59,939 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-03 23:39:59,950 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:59,958 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:39:59,976 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:00,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:00,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:00,063 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:313, output treesize:198 [2018-02-03 23:40:00,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 139 [2018-02-03 23:40:00,282 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:00,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:00,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:00,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:00,285 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:00,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-02-03 23:40:00,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:00,528 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 63 treesize of output 50 [2018-02-03 23:40:00,528 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:00,696 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:00,698 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:00,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:00,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:00,701 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:00,702 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:00,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:00,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:00,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:00,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:00,706 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:00,707 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:00,708 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:40:00,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 112 treesize of output 119 [2018-02-03 23:40:00,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:00,870 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 59 treesize of output 46 [2018-02-03 23:40:00,870 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:01,046 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 59 treesize of output 46 [2018-02-03 23:40:01,046 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:01,079 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 55 treesize of output 42 [2018-02-03 23:40:01,079 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-03 23:40:01,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:40:01,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:40:01,128 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:178, output treesize:47 [2018-02-03 23:40:01,183 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#p~0.base| Int) (|main_#t~mem3.base| Int)) (let ((.cse0 (store |c_old(#valid)| |foo_~#p~0.base| 1))) (let ((.cse1 (store (store .cse0 |main_#t~mem3.base| 1) |foo_~#p~0.base| 0))) (and (= (select .cse0 |main_#t~mem3.base|) 0) (not (= |main_#t~mem3.base| 0)) (= |c_#valid| (store (store .cse1 |c_main_~#p~1.base| 1) |main_#t~mem3.base| 0)) (= (select |c_old(#valid)| |foo_~#p~0.base|) 0) (= (select .cse1 |c_main_~#p~1.base|) 0))))) is different from true [2018-02-03 23:40:01,186 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#p~0.base| Int) (|main_#t~mem3.base| Int) (|main_~#p~1.base| Int)) (let ((.cse0 (store |c_old(#valid)| |foo_~#p~0.base| 1))) (let ((.cse1 (store (store .cse0 |main_#t~mem3.base| 1) |foo_~#p~0.base| 0))) (and (= (select .cse0 |main_#t~mem3.base|) 0) (not (= |main_#t~mem3.base| 0)) (= (store (store (store .cse1 |main_~#p~1.base| 1) |main_#t~mem3.base| 0) |main_~#p~1.base| 0) |c_#valid|) (= (select |c_old(#valid)| |foo_~#p~0.base|) 0) (= (select .cse1 |main_~#p~1.base|) 0))))) is different from true [2018-02-03 23:40:01,199 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 34 refuted. 11 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-03 23:40:01,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:40:01,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24] total 49 [2018-02-03 23:40:01,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-03 23:40:01,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-03 23:40:01,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2055, Unknown=29, NotChecked=186, Total=2450 [2018-02-03 23:40:01,217 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand 50 states. [2018-02-03 23:40:10,650 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 112 DAG size of output 83 [2018-02-03 23:40:15,558 WARN L146 SmtUtils]: Spent 4367ms on a formula simplification. DAG size of input: 138 DAG size of output 101 [2018-02-03 23:40:21,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:21,172 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2018-02-03 23:40:21,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-03 23:40:21,175 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 47 [2018-02-03 23:40:21,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:21,176 INFO L225 Difference]: With dead ends: 97 [2018-02-03 23:40:21,176 INFO L226 Difference]: Without dead ends: 81 [2018-02-03 23:40:21,177 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1550 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=495, Invalid=5626, Unknown=49, NotChecked=310, Total=6480 [2018-02-03 23:40:21,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-03 23:40:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-03 23:40:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-03 23:40:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2018-02-03 23:40:21,182 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 47 [2018-02-03 23:40:21,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:21,182 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2018-02-03 23:40:21,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-03 23:40:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2018-02-03 23:40:21,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-03 23:40:21,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:40:21,183 INFO L351 BasicCegarLoop]: trace histogram [13, 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] [2018-02-03 23:40:21,184 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-03 23:40:21,184 INFO L82 PathProgramCache]: Analyzing trace with hash -335490378, now seen corresponding path program 5 times [2018-02-03 23:40:21,184 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:40:21,184 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:40:21,184 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:21,184 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:40:21,185 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:40:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:40:21,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:40:21,235 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 31 proven. 56 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-03 23:40:21,236 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:40:21,236 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 23:40:21,248 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-03 23:40:24,621 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-02-03 23:40:24,621 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:40:24,626 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:40:24,687 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 90 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-03 23:40:24,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:40:24,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 18 [2018-02-03 23:40:24,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-03 23:40:24,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-03 23:40:24,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-02-03 23:40:24,708 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 18 states. [2018-02-03 23:40:24,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:40:24,769 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2018-02-03 23:40:24,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 23:40:24,769 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-03 23:40:24,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:40:24,769 INFO L225 Difference]: With dead ends: 68 [2018-02-03 23:40:24,769 INFO L226 Difference]: Without dead ends: 0 [2018-02-03 23:40:24,769 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2018-02-03 23:40:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-03 23:40:24,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-03 23:40:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-03 23:40:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-03 23:40:24,770 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-02-03 23:40:24,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:40:24,770 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-03 23:40:24,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-03 23:40:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-03 23:40:24,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-03 23:40:24,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 11:40:24 BoogieIcfgContainer [2018-02-03 23:40:24,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 23:40:24,775 INFO L168 Benchmark]: Toolchain (without parser) took 109994.50 ms. Allocated memory was 395.8 MB in the beginning and 913.8 MB in the end (delta: 518.0 MB). Free memory was 352.7 MB in the beginning and 416.2 MB in the end (delta: -63.5 MB). Peak memory consumption was 454.5 MB. Max. memory is 5.3 GB. [2018-02-03 23:40:24,776 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 395.8 MB. Free memory is still 358.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 23:40:24,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.62 ms. Allocated memory is still 395.8 MB. Free memory was 352.7 MB in the beginning and 342.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-03 23:40:24,776 INFO L168 Benchmark]: Boogie Preprocessor took 30.69 ms. Allocated memory is still 395.8 MB. Free memory was 342.1 MB in the beginning and 339.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-03 23:40:24,777 INFO L168 Benchmark]: RCFGBuilder took 239.28 ms. Allocated memory is still 395.8 MB. Free memory was 339.5 MB in the beginning and 317.4 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. [2018-02-03 23:40:24,777 INFO L168 Benchmark]: TraceAbstraction took 109560.63 ms. Allocated memory was 395.8 MB in the beginning and 913.8 MB in the end (delta: 518.0 MB). Free memory was 317.4 MB in the beginning and 416.2 MB in the end (delta: -98.9 MB). Peak memory consumption was 419.1 MB. Max. memory is 5.3 GB. [2018-02-03 23:40:24,778 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.15 ms. Allocated memory is still 395.8 MB. Free memory is still 358.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.62 ms. Allocated memory is still 395.8 MB. Free memory was 352.7 MB in the beginning and 342.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.69 ms. Allocated memory is still 395.8 MB. Free memory was 342.1 MB in the beginning and 339.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 239.28 ms. Allocated memory is still 395.8 MB. Free memory was 339.5 MB in the beginning and 317.4 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 109560.63 ms. Allocated memory was 395.8 MB in the beginning and 913.8 MB in the end (delta: 518.0 MB). Free memory was 317.4 MB in the beginning and 416.2 MB in the end (delta: -98.9 MB). Peak memory consumption was 419.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 746]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 23 error locations. SAFE Result, 109.5s OverallTime, 16 OverallIterations, 13 TraceHistogramMax, 43.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 525 SDtfs, 497 SDslu, 1650 SDs, 0 SdLazy, 2438 SolverSat, 350 SolverUnsat, 58 SolverUnknown, 0 SolverNotchecked, 23.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 242 SyntacticMatches, 17 SemanticMatches, 283 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4213 ImplicationChecksByTransitivity, 39.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=14, 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 26 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 61.3s InterpolantComputationTime, 763 NumberOfCodeBlocks, 762 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 740 ConstructedInterpolants, 72 QuantifiedInterpolants, 560517 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1739 ConjunctsInSsa, 208 ConjunctsInUnsatCore, 23 InterpolantComputations, 9 PerfectInterpolantSequences, 260/639 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_23-40-24-785.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_23-40-24-785.csv Received shutdown request...