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-c17473d-m [2018-02-04 12:54:09,332 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:54:09,333 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:54:09,344 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:54:09,345 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:54:09,346 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:54:09,347 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:54:09,348 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:54:09,349 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:54:09,350 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:54:09,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:54:09,351 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:54:09,352 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:54:09,353 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:54:09,354 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:54:09,356 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:54:09,357 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:54:09,359 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:54:09,360 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:54:09,361 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:54:09,362 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:54:09,363 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:54:09,363 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:54:09,364 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:54:09,364 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:54:09,365 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:54:09,366 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:54:09,366 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:54:09,366 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:54:09,367 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:54:09,367 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:54:09,367 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-04 12:54:09,377 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:54:09,377 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:54:09,378 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:54:09,378 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:54:09,378 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:54:09,379 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:54:09,379 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:54:09,379 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:54:09,379 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:54:09,379 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:54:09,379 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:54:09,380 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:54:09,380 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:54:09,380 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:54:09,380 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:54:09,380 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:54:09,380 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:54:09,380 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:54:09,381 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:54:09,381 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:54:09,381 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:54:09,381 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:54:09,381 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:54:09,381 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:54:09,409 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:54:09,422 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:54:09,425 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:54:09,427 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:54:09,427 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:54:09,428 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-04 12:54:09,577 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:54:09,578 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:54:09,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:54:09,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:54:09,585 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:54:09,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:54:09" (1/1) ... [2018-02-04 12:54:09,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309783a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:54:09, skipping insertion in model container [2018-02-04 12:54:09,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:54:09" (1/1) ... [2018-02-04 12:54:09,602 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:54:09,633 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:54:09,720 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:54:09,731 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:54:09,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:54:09 WrapperNode [2018-02-04 12:54:09,738 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:54:09,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:54:09,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:54:09,739 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:54:09,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:54:09" (1/1) ... [2018-02-04 12:54:09,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:54:09" (1/1) ... [2018-02-04 12:54:09,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:54:09" (1/1) ... [2018-02-04 12:54:09,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:54:09" (1/1) ... [2018-02-04 12:54:09,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:54:09" (1/1) ... [2018-02-04 12:54:09,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:54:09" (1/1) ... [2018-02-04 12:54:09,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:54:09" (1/1) ... [2018-02-04 12:54:09,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:54:09,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:54:09,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:54:09,768 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:54:09,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:54:09" (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-04 12:54:09,805 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:54:09,806 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:54:09,806 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 12:54:09,806 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:54:09,806 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 12:54:09,806 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 12:54:09,806 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:54:09,806 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:54:09,806 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:54:09,806 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:54:09,806 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:54:09,806 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-02-04 12:54:09,807 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-02-04 12:54:09,807 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 12:54:09,807 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 12:54:09,807 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-02-04 12:54:09,807 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 12:54:09,807 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:54:09,807 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:54:09,807 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:54:09,891 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 12:54:09,976 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:54:09,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:54:09 BoogieIcfgContainer [2018-02-04 12:54:09,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:54:09,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:54:09,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:54:09,980 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:54:09,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:54:09" (1/3) ... [2018-02-04 12:54:09,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5d1586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:54:09, skipping insertion in model container [2018-02-04 12:54:09,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:54:09" (2/3) ... [2018-02-04 12:54:09,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5d1586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:54:09, skipping insertion in model container [2018-02-04 12:54:09,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:54:09" (3/3) ... [2018-02-04 12:54:09,982 INFO L107 eAbstractionObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-02-04 12:54:09,987 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:54:09,992 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-04 12:54:10,013 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:54:10,013 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:54:10,013 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:54:10,014 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:54:10,014 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:54:10,014 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:54:10,014 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:54:10,014 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:54:10,014 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:54:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-02-04 12:54:10,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 12:54:10,034 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:54:10,035 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 12:54:10,035 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-04 12:54:10,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2931467, now seen corresponding path program 1 times [2018-02-04 12:54:10,041 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:54:10,042 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:54:10,071 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:10,072 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:54:10,072 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:54:10,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:54:10,149 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-04 12:54:10,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:54:10,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:54:10,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:54:10,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:54:10,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:54:10,163 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-02-04 12:54:10,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:54:10,253 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-02-04 12:54:10,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:54:10,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 12:54:10,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:54:10,261 INFO L225 Difference]: With dead ends: 60 [2018-02-04 12:54:10,261 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 12:54:10,262 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-04 12:54:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 12:54:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-04 12:54:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 12:54:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-02-04 12:54:10,335 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 4 [2018-02-04 12:54:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:54:10,336 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-02-04 12:54:10,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:54:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-02-04 12:54:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-04 12:54:10,336 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:54:10,336 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-04 12:54:10,336 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-04 12:54:10,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2931468, now seen corresponding path program 1 times [2018-02-04 12:54:10,337 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:54:10,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:54:10,338 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:10,338 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:54:10,338 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:54:10,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:54:10,385 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-04 12:54:10,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:54:10,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:54:10,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:54:10,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:54:10,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:54:10,388 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 3 states. [2018-02-04 12:54:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:54:10,446 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-02-04 12:54:10,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:54:10,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-04 12:54:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:54:10,448 INFO L225 Difference]: With dead ends: 53 [2018-02-04 12:54:10,448 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 12:54:10,449 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-04 12:54:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 12:54:10,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 12:54:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 12:54:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-02-04 12:54:10,454 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 4 [2018-02-04 12:54:10,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:54:10,454 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-02-04 12:54:10,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:54:10,455 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-02-04 12:54:10,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:54:10,455 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:54:10,456 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:54:10,456 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-04 12:54:10,456 INFO L82 PathProgramCache]: Analyzing trace with hash -240006955, now seen corresponding path program 1 times [2018-02-04 12:54:10,456 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:54:10,456 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:54:10,457 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:10,457 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:54:10,457 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:54:10,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:54:10,537 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-04 12:54:10,537 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:54:10,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:54:10,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:54:10,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:54:10,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:54:10,538 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 3 states. [2018-02-04 12:54:10,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:54:10,578 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-02-04 12:54:10,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:54:10,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-02-04 12:54:10,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:54:10,579 INFO L225 Difference]: With dead ends: 51 [2018-02-04 12:54:10,579 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 12:54:10,579 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-04 12:54:10,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 12:54:10,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 12:54:10,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 12:54:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-02-04 12:54:10,583 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 14 [2018-02-04 12:54:10,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:54:10,584 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-02-04 12:54:10,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:54:10,584 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-02-04 12:54:10,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:54:10,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:54:10,584 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:54:10,585 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-04 12:54:10,585 INFO L82 PathProgramCache]: Analyzing trace with hash -240006954, now seen corresponding path program 1 times [2018-02-04 12:54:10,585 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:54:10,585 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:54:10,586 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:10,586 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:54:10,586 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:54:10,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:54:10,658 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-04 12:54:10,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:54:10,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:54:10,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:54:10,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:54:10,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:54:10,659 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 4 states. [2018-02-04 12:54:10,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:54:10,687 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-02-04 12:54:10,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:54:10,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 12:54:10,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:54:10,688 INFO L225 Difference]: With dead ends: 49 [2018-02-04 12:54:10,688 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 12:54:10,688 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-04 12:54:10,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 12:54:10,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 12:54:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 12:54:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-02-04 12:54:10,692 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 14 [2018-02-04 12:54:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:54:10,693 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-02-04 12:54:10,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:54:10,693 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-02-04 12:54:10,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 12:54:10,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:54:10,693 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:54:10,693 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-04 12:54:10,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1149718964, now seen corresponding path program 1 times [2018-02-04 12:54:10,694 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:54:10,694 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:54:10,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:10,695 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:54:10,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:54:10,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:54:10,846 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-04 12:54:10,846 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:54:10,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:54:10,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:54:10,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:54:10,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:54:10,848 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 5 states. [2018-02-04 12:54:10,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:54:10,906 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-02-04 12:54:10,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:54:10,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 12:54:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:54:10,907 INFO L225 Difference]: With dead ends: 47 [2018-02-04 12:54:10,907 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 12:54:10,907 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-04 12:54:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 12:54:10,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-04 12:54:10,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 12:54:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-02-04 12:54:10,910 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 15 [2018-02-04 12:54:10,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:54:10,910 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-02-04 12:54:10,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:54:10,910 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-02-04 12:54:10,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 12:54:10,911 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:54:10,911 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-04 12:54:10,911 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-04 12:54:10,911 INFO L82 PathProgramCache]: Analyzing trace with hash 536104684, now seen corresponding path program 1 times [2018-02-04 12:54:10,911 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:54:10,911 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:54:10,912 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:10,912 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:54:10,912 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:54:10,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:54:10,954 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-04 12:54:10,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:54:10,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:54:10,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:54:10,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:54:10,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:54:10,955 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 3 states. [2018-02-04 12:54:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:54:10,985 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-02-04 12:54:10,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:54:10,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-02-04 12:54:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:54:10,986 INFO L225 Difference]: With dead ends: 45 [2018-02-04 12:54:10,986 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 12:54:10,986 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-04 12:54:10,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 12:54:10,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 12:54:10,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 12:54:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-02-04 12:54:10,990 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 27 [2018-02-04 12:54:10,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:54:10,991 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-02-04 12:54:10,991 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:54:10,991 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-02-04 12:54:10,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 12:54:10,992 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:54:10,992 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-04 12:54:10,992 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-04 12:54:10,992 INFO L82 PathProgramCache]: Analyzing trace with hash 536104685, now seen corresponding path program 1 times [2018-02-04 12:54:10,992 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:54:10,992 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:54:10,993 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:10,993 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:54:10,993 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:54:11,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:54:11,087 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-04 12:54:11,087 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:54:11,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:54:11,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:54:11,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:54:11,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:54:11,088 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 8 states. [2018-02-04 12:54:11,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:54:11,231 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-02-04 12:54:11,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:54:11,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-02-04 12:54:11,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:54:11,233 INFO L225 Difference]: With dead ends: 44 [2018-02-04 12:54:11,233 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 12:54:11,233 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-04 12:54:11,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 12:54:11,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-04 12:54:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 12:54:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-02-04 12:54:11,236 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 27 [2018-02-04 12:54:11,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:54:11,236 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-02-04 12:54:11,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:54:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-02-04 12:54:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 12:54:11,237 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:54:11,237 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-04 12:54:11,237 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-04 12:54:11,237 INFO L82 PathProgramCache]: Analyzing trace with hash 536104686, now seen corresponding path program 1 times [2018-02-04 12:54:11,237 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:54:11,238 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:54:11,238 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:11,238 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:54:11,241 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:54:11,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:54:11,287 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-04 12:54:11,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:54:11,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:54:11,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:54:11,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:54:11,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:54:11,288 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 3 states. [2018-02-04 12:54:11,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:54:11,313 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-02-04 12:54:11,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:54:11,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-02-04 12:54:11,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:54:11,323 INFO L225 Difference]: With dead ends: 42 [2018-02-04 12:54:11,323 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 12:54:11,323 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-04 12:54:11,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 12:54:11,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-04 12:54:11,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 12:54:11,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-02-04 12:54:11,326 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 27 [2018-02-04 12:54:11,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:54:11,326 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-02-04 12:54:11,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:54:11,326 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-02-04 12:54:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 12:54:11,327 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:54:11,327 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-04 12:54:11,327 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-04 12:54:11,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1677513941, now seen corresponding path program 1 times [2018-02-04 12:54:11,327 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:54:11,327 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:54:11,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:11,328 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:54:11,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:54:11,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:54:11,377 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-04 12:54:11,377 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:54:11,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:54:11,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:54:11,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:54:11,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:54:11,378 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 4 states. [2018-02-04 12:54:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:54:11,388 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-02-04 12:54:11,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:54:11,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-04 12:54:11,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:54:11,389 INFO L225 Difference]: With dead ends: 48 [2018-02-04 12:54:11,389 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 12:54:11,389 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-04 12:54:11,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 12:54:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-04 12:54:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 12:54:11,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-02-04 12:54:11,392 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 35 [2018-02-04 12:54:11,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:54:11,392 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-02-04 12:54:11,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:54:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-02-04 12:54:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 12:54:11,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:54:11,393 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-04 12:54:11,393 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-04 12:54:11,393 INFO L82 PathProgramCache]: Analyzing trace with hash -656412319, now seen corresponding path program 1 times [2018-02-04 12:54:11,393 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:54:11,393 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:54:11,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:11,394 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:54:11,394 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:54:11,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:54:11,440 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-04 12:54:11,441 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:54:11,441 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-04 12:54:11,449 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:54:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:54:11,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:54:11,533 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-04 12:54:11,557 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:54:11,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-02-04 12:54:11,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:54:11,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:54:11,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:54:11,558 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 8 states. [2018-02-04 12:54:11,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:54:11,579 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-02-04 12:54:11,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:54:11,583 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-02-04 12:54:11,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:54:11,584 INFO L225 Difference]: With dead ends: 50 [2018-02-04 12:54:11,584 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 12:54:11,584 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-04 12:54:11,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 12:54:11,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 12:54:11,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 12:54:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-02-04 12:54:11,587 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 37 [2018-02-04 12:54:11,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:54:11,587 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-02-04 12:54:11,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:54:11,587 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-02-04 12:54:11,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 12:54:11,587 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:54:11,587 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-04 12:54:11,587 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-04 12:54:11,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2111815019, now seen corresponding path program 2 times [2018-02-04 12:54:11,588 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:54:11,588 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:54:11,589 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:11,589 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:54:11,589 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:54:11,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:54:11,666 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-04 12:54:11,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:54:11,666 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-04 12:54:11,674 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:54:11,717 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:54:11,718 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:54:11,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:54:11,742 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-04 12:54:11,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:54:11,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-02-04 12:54:11,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:54:11,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:54:11,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:54:11,773 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 10 states. [2018-02-04 12:54:11,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:54:11,805 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-02-04 12:54:11,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:54:11,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-02-04 12:54:11,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:54:11,806 INFO L225 Difference]: With dead ends: 52 [2018-02-04 12:54:11,806 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 12:54:11,806 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-04 12:54:11,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 12:54:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 12:54:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 12:54:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-02-04 12:54:11,809 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 39 [2018-02-04 12:54:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:54:11,810 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-02-04 12:54:11,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:54:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-02-04 12:54:11,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 12:54:11,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:54:11,810 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-04 12:54:11,811 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-04 12:54:11,811 INFO L82 PathProgramCache]: Analyzing trace with hash 304342049, now seen corresponding path program 3 times [2018-02-04 12:54:11,811 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:54:11,811 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:54:11,811 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:11,811 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:54:11,811 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:54:11,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:54:11,873 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-04 12:54:11,873 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:54:11,873 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-04 12:54:11,878 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:54:11,938 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 12:54:11,938 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:54:11,941 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:54:11,976 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-04 12:54:12,007 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:54:12,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-02-04 12:54:12,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:54:12,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:54:12,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:54:12,008 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 12 states. [2018-02-04 12:54:12,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:54:12,046 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-02-04 12:54:12,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:54:12,047 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-02-04 12:54:12,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:54:12,047 INFO L225 Difference]: With dead ends: 54 [2018-02-04 12:54:12,047 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 12:54:12,048 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-04 12:54:12,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 12:54:12,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 12:54:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 12:54:12,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-02-04 12:54:12,050 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 41 [2018-02-04 12:54:12,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:54:12,051 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-02-04 12:54:12,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:54:12,051 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-02-04 12:54:12,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 12:54:12,051 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:54:12,051 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-04 12:54:12,051 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-04 12:54:12,052 INFO L82 PathProgramCache]: Analyzing trace with hash 747384917, now seen corresponding path program 4 times [2018-02-04 12:54:12,052 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:54:12,052 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:54:12,052 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:12,052 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:54:12,053 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:54:12,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:54:12,793 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-04 12:54:12,793 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:54:12,793 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-04 12:54:12,798 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:54:12,826 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:54:12,826 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:54:12,830 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:54:12,897 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-04 12:54:12,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-04 12:54:12,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:12,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:12,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:12,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-02-04 12:54:17,311 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-04 12:54:17,315 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-04 12:54:17,318 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:17,321 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-04 12:54:17,326 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:17,327 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:17,329 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-04 12:54:17,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:17,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:17,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:17,334 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:17,339 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-04 12:54:17,339 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:17,351 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:17,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:17,365 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:17,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:17,395 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-04 12:54:17,395 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:189, output treesize:78 [2018-02-04 12:54:17,427 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-04 12:54:17,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:17,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:17,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-02-04 12:54:19,752 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 95 DAG size of output 33 [2018-02-04 12:54:19,766 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-04 12:54:19,769 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-04 12:54:19,772 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:19,773 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-04 12:54:19,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:19,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:19,780 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-04 12:54:19,782 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:19,783 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:19,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:19,784 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:19,789 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-04 12:54:19,789 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,801 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,814 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,851 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-04 12:54:19,852 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:189, output treesize:78 [2018-02-04 12:54:19,941 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-04 12:54:19,944 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-04 12:54:19,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:19,954 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-04 12:54:19,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:76, output treesize:3 [2018-02-04 12:54:19,987 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-04 12:54:20,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:54:20,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 35 [2018-02-04 12:54:20,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 12:54:20,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 12:54:20,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1075, Unknown=14, NotChecked=0, Total=1260 [2018-02-04 12:54:20,013 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 36 states. [2018-02-04 12:54:31,239 WARN L146 SmtUtils]: Spent 301ms on a formula simplification. DAG size of input: 84 DAG size of output 72 [2018-02-04 12:54:36,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:54:36,678 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2018-02-04 12:54:36,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 12:54:36,678 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-02-04 12:54:36,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:54:36,681 INFO L225 Difference]: With dead ends: 97 [2018-02-04 12:54:36,681 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 12:54:36,682 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=428, Invalid=2848, Unknown=30, NotChecked=0, Total=3306 [2018-02-04 12:54:36,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 12:54:36,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 74. [2018-02-04 12:54:36,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 12:54:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2018-02-04 12:54:36,691 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 43 [2018-02-04 12:54:36,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:54:36,692 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2018-02-04 12:54:36,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 12:54:36,692 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2018-02-04 12:54:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 12:54:36,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:54:36,694 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-04 12:54:36,694 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-04 12:54:36,694 INFO L82 PathProgramCache]: Analyzing trace with hash 747384918, now seen corresponding path program 1 times [2018-02-04 12:54:36,694 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:54:36,694 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:54:36,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:36,695 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:54:36,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:54:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:54:36,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:54:37,434 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-04 12:54:37,434 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:54:37,434 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-04 12:54:37,439 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:54:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:54:37,475 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:54:37,484 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-04 12:54:37,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:37,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:37,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 12:54:37,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:37,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:37,508 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-04 12:54:37,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:37,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:37,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-02-04 12:54:37,534 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-04 12:54:37,535 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-04 12:54:37,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:37,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:37,551 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-04 12:54:37,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-04 12:54:37,586 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-04 12:54:37,588 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-04 12:54:37,589 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-04 12:54:37,592 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-04 12:54:37,597 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-04 12:54:37,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-02-04 12:54:38,099 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 110 DAG size of output 46 [2018-02-04 12:54:38,119 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-04 12:54:38,158 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-04 12:54:38,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,162 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-04 12:54:38,165 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,170 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-04 12:54:38,172 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,173 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,173 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,174 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,174 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,175 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,180 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-04 12:54:38,180 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:38,203 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:38,208 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:38,215 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:38,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:54:38,246 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-04 12:54:38,246 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:226, output treesize:99 [2018-02-04 12:54:38,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,305 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-04 12:54:38,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:38,318 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-04 12:54:38,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:91, output treesize:77 [2018-02-04 12:54:38,375 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,377 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,382 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-04 12:54:38,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 12:54:38,406 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-04 12:54:38,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:86, output treesize:174 [2018-02-04 12:54:38,511 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-04 12:54:38,516 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,518 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,525 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-04 12:54:38,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:38,550 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-04 12:54:38,551 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-04 12:54:38,566 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-04 12:54:38,567 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-04 12:54:38,581 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-04 12:54:38,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, 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-04 12:54:38,614 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,614 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,616 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,616 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:54:38,620 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-04 12:54:38,621 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:54:38,643 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-04 12:54:38,644 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-04 12:54:38,658 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-04 12:54:38,659 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-04 12:54:38,676 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-04 12:54:38,703 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-04 12:54:38,703 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:174, output treesize:95 [2018-02-04 12:55:20,509 WARN L146 SmtUtils]: Spent 40909ms on a formula simplification. DAG size of input: 421 DAG size of output 179 [2018-02-04 12:55:20,528 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-04 12:55:20,540 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,541 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,542 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,542 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,550 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-04 12:55:20,553 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,554 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,555 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,557 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,558 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,576 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-04 12:55:20,580 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,580 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,606 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-04 12:55:20,611 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 12:55:20,611 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:20,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,689 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,690 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,709 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-04 12:55:20,710 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-02-04 12:55:20,788 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,804 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-04 12:55:20,805 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-04 12:55:20,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,859 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,864 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,865 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,866 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,867 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,868 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:20,901 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-04 12:55:20,902 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2018-02-04 12:55:20,963 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:20,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:21,009 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:21,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:55:21,470 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,491 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-04 12:55:21,499 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-04 12:55:21,501 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,502 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-04 12:55:21,510 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,511 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,511 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,514 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-04 12:55:21,516 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,518 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,523 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-04 12:55:21,524 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:21,533 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:21,538 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:21,561 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:21,619 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:55:21,922 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,941 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-04 12:55:21,944 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-04 12:55:21,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,948 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-04 12:55:21,950 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,951 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,951 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,953 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-04 12:55:21,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,957 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,957 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,959 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:21,963 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-04 12:55:21,963 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:21,974 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:21,981 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:22,000 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:22,035 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:22,270 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-04 12:55:22,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,276 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,282 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-04 12:55:22,285 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,285 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,286 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,287 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,287 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,299 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-04 12:55:22,303 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,305 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,305 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:55:22,310 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:55:22,311 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-04 12:55:22,314 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,314 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,315 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,316 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,316 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,328 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-04 12:55:22,329 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-02-04 12:55:22,360 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:22,396 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,398 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,400 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,400 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,401 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,425 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-04 12:55:22,430 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,430 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,436 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,458 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-04 12:55:22,459 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 4 xjuncts. [2018-02-04 12:55:22,554 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,555 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,555 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,556 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,557 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,558 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,570 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-04 12:55:22,570 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-02-04 12:55:22,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,635 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,638 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:22,680 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-04 12:55:22,682 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 8 xjuncts. [2018-02-04 12:55:22,753 INFO L267 ElimStorePlain]: Start of recursive call 25: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:22,766 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:22,794 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:22,828 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:55:22,948 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-04 12:55:22,948 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 21 variables, input treesize:1029, output treesize:547 [2018-02-04 12:55:23,255 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 192 DAG size of output 92 [2018-02-04 12:55:23,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,275 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-04 12:55:23,280 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,281 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,281 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,285 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-04 12:55:23,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:23,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,338 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,339 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,340 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,345 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-04 12:55:23,345 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:23,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,391 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,392 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,395 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-04 12:55:23,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:23,433 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-04 12:55:23,433 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:23,464 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-04 12:55:23,464 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:23,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:23,510 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-04 12:55:23,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,525 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,529 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:23,540 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-04 12:55:23,540 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:23,565 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-04 12:55:23,565 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:23,576 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-04 12:55:23,577 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:23,584 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:23,593 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-04 12:55:23,593 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 11 variables, input treesize:251, output treesize:32 [2018-02-04 12:55:23,654 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-04 12:55:23,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:55:23,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2018-02-04 12:55:23,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-04 12:55:23,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-04 12:55:23,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1993, Unknown=12, NotChecked=0, Total=2256 [2018-02-04 12:55:23,672 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand 48 states. [2018-02-04 12:55:24,309 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 101 DAG size of output 70 [2018-02-04 12:55:24,715 WARN L146 SmtUtils]: Spent 265ms on a formula simplification. DAG size of input: 145 DAG size of output 93 [2018-02-04 12:55:25,843 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 77 DAG size of output 62 [2018-02-04 12:55:26,154 WARN L146 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 111 DAG size of output 85 [2018-02-04 12:55:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:55:28,538 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2018-02-04 12:55:28,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 12:55:28,538 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 43 [2018-02-04 12:55:28,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:55:28,538 INFO L225 Difference]: With dead ends: 94 [2018-02-04 12:55:28,538 INFO L226 Difference]: Without dead ends: 94 [2018-02-04 12:55:28,539 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1532 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=609, Invalid=5066, Unknown=25, NotChecked=0, Total=5700 [2018-02-04 12:55:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-04 12:55:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-02-04 12:55:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 12:55:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2018-02-04 12:55:28,545 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 43 [2018-02-04 12:55:28,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:55:28,545 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2018-02-04 12:55:28,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-04 12:55:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2018-02-04 12:55:28,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 12:55:28,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:55:28,547 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-04 12:55:28,547 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-04 12:55:28,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1348121705, now seen corresponding path program 1 times [2018-02-04 12:55:28,547 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:55:28,547 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:55:28,548 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:55:28,548 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:55:28,548 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:55:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:55:28,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:55:29,982 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-04 12:55:29,983 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:55:29,983 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-04 12:55:29,988 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:55:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:55:30,016 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:55:30,075 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-04 12:55:30,077 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-04 12:55:30,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:30,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:30,085 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-04 12:55:30,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:45 [2018-02-04 12:55:30,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:30,130 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-04 12:55:30,132 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:30,132 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-04 12:55:30,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:30,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:30,143 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-04 12:55:30,145 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-04 12:55:30,146 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-04 12:55:30,149 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-04 12:55:30,154 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-04 12:55:30,154 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:25 [2018-02-04 12:55:34,907 WARN L146 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 115 DAG size of output 53 [2018-02-04 12:55:34,927 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-04 12:55:34,930 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-04 12:55:34,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:34,934 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-04 12:55:34,936 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:34,937 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:34,938 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:34,941 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-04 12:55:34,944 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:34,944 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:34,945 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:34,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:34,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:34,947 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:34,952 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-04 12:55:34,952 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:34,962 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:34,968 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:34,977 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:35,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:35,029 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-04 12:55:35,034 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:239, output treesize:121 [2018-02-04 12:55:35,409 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,409 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-04 12:55:35,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,412 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-04 12:55:35,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,433 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-04 12:55:35,435 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-04 12:55:35,435 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:35,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:35,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,443 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-04 12:55:35,445 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,445 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-04 12:55:35,445 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:35,450 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:35,459 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:55:35,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:55:35,491 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-04 12:55:35,494 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,495 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:55:35,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,498 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:55:35,499 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,499 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,501 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:55:35,515 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-04 12:55:35,515 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-04 12:55:35,546 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,547 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,547 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,548 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,548 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,549 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,552 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-04 12:55:35,552 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:35,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 32 treesize of output 26 [2018-02-04 12:55:35,568 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-04 12:55:35,579 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-04 12:55:35,609 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-04 12:55:35,613 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,614 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,616 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,617 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:35,623 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-04 12:55:35,624 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:35,656 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-04 12:55:35,656 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-04 12:55:35,671 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-04 12:55:35,671 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-04 12:55:35,686 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-04 12:55:35,718 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-04 12:55:35,718 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:130, output treesize:119 [2018-02-04 12:55:40,659 WARN L146 SmtUtils]: Spent 498ms on a formula simplification. DAG size of input: 137 DAG size of output 75 [2018-02-04 12:55:40,694 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-04 12:55:40,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:40,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:40,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:40,701 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:40,701 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:40,706 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-04 12:55:40,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:40,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:40,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:40,712 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:55:40,720 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-04 12:55:40,723 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:40,723 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:55:40,727 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-04 12:55:40,730 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:40,730 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 12:55:40,732 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-04 12:55:40,732 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:40,741 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:40,749 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:40,760 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:40,939 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-04 12:55:40,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:40,944 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-04 12:55:40,948 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:40,950 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:40,951 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:40,956 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-04 12:55:40,960 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:40,961 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:40,962 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:40,963 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:40,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:40,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:40,971 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-04 12:55:40,972 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:40,983 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:40,990 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:41,007 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:41,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:41,087 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-04 12:55:41,088 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:313, output treesize:198 [2018-02-04 12:55:41,259 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-04 12:55:41,264 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:41,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:41,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:41,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:41,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:41,271 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-04 12:55:41,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:41,533 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-04 12:55:41,533 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:41,690 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:41,692 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:41,693 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:41,694 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:41,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:41,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:41,701 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:41,702 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:41,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:41,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:41,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:41,706 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:41,707 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:55:41,727 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-04 12:55:41,728 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:41,864 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-04 12:55:41,864 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:42,011 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-04 12:55:42,011 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:42,041 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-04 12:55:42,041 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 12:55:42,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:55:42,091 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-04 12:55:42,091 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:178, output treesize:47 [2018-02-04 12:55:42,139 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-04 12:55:42,142 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-04 12:55:42,155 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-04 12:55:42,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:55:42,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24] total 49 [2018-02-04 12:55:42,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-04 12:55:42,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-04 12:55:42,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2056, Unknown=28, NotChecked=186, Total=2450 [2018-02-04 12:55:42,173 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand 50 states. [2018-02-04 12:55:47,363 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 112 DAG size of output 83 [2018-02-04 12:55:54,323 WARN L146 SmtUtils]: Spent 4580ms on a formula simplification. DAG size of input: 138 DAG size of output 101 [2018-02-04 12:55:58,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:55:58,466 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2018-02-04 12:55:58,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 12:55:58,467 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 47 [2018-02-04 12:55:58,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:55:58,467 INFO L225 Difference]: With dead ends: 97 [2018-02-04 12:55:58,468 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 12:55:58,469 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1550 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=495, Invalid=5624, Unknown=51, NotChecked=310, Total=6480 [2018-02-04 12:55:58,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 12:55:58,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-04 12:55:58,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 12:55:58,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2018-02-04 12:55:58,474 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 47 [2018-02-04 12:55:58,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:55:58,474 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2018-02-04 12:55:58,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-04 12:55:58,474 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2018-02-04 12:55:58,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 12:55:58,475 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:55:58,475 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-04 12:55:58,475 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-04 12:55:58,476 INFO L82 PathProgramCache]: Analyzing trace with hash -335490378, now seen corresponding path program 5 times [2018-02-04 12:55:58,476 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:55:58,476 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:55:58,477 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:55:58,477 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:55:58,477 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:55:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:55:58,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:55:58,529 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-04 12:55:58,529 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:55:58,529 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-04 12:55:58,539 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:56:02,105 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-02-04 12:56:02,105 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:56:02,110 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:56:02,196 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-04 12:56:02,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:56:02,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 18 [2018-02-04 12:56:02,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 12:56:02,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 12:56:02,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2018-02-04 12:56:02,218 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 18 states. [2018-02-04 12:56:02,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:56:02,290 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2018-02-04 12:56:02,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 12:56:02,290 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-04 12:56:02,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:56:02,291 INFO L225 Difference]: With dead ends: 68 [2018-02-04 12:56:02,291 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 12:56:02,291 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-04 12:56:02,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 12:56:02,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 12:56:02,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 12:56:02,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 12:56:02,292 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-02-04 12:56:02,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:56:02,292 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 12:56:02,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 12:56:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 12:56:02,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 12:56:02,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:56:02 BoogieIcfgContainer [2018-02-04 12:56:02,296 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:56:02,297 INFO L168 Benchmark]: Toolchain (without parser) took 112719.62 ms. Allocated memory was 408.4 MB in the beginning and 817.9 MB in the end (delta: 409.5 MB). Free memory was 365.3 MB in the beginning and 657.6 MB in the end (delta: -292.3 MB). Peak memory consumption was 117.1 MB. Max. memory is 5.3 GB. [2018-02-04 12:56:02,298 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 408.4 MB. Free memory is still 371.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:56:02,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.49 ms. Allocated memory is still 408.4 MB. Free memory was 365.3 MB in the beginning and 354.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 5.3 GB. [2018-02-04 12:56:02,298 INFO L168 Benchmark]: Boogie Preprocessor took 28.78 ms. Allocated memory is still 408.4 MB. Free memory was 354.5 MB in the beginning and 353.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:56:02,298 INFO L168 Benchmark]: RCFGBuilder took 209.27 ms. Allocated memory is still 408.4 MB. Free memory was 353.2 MB in the beginning and 331.2 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-02-04 12:56:02,299 INFO L168 Benchmark]: TraceAbstraction took 112319.00 ms. Allocated memory was 408.4 MB in the beginning and 817.9 MB in the end (delta: 409.5 MB). Free memory was 329.9 MB in the beginning and 657.6 MB in the end (delta: -327.8 MB). Peak memory consumption was 81.7 MB. Max. memory is 5.3 GB. [2018-02-04 12:56:02,303 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 408.4 MB. Free memory is still 371.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 159.49 ms. Allocated memory is still 408.4 MB. Free memory was 365.3 MB in the beginning and 354.5 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.78 ms. Allocated memory is still 408.4 MB. Free memory was 354.5 MB in the beginning and 353.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 209.27 ms. Allocated memory is still 408.4 MB. Free memory was 353.2 MB in the beginning and 331.2 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 112319.00 ms. Allocated memory was 408.4 MB in the beginning and 817.9 MB in the end (delta: 409.5 MB). Free memory was 329.9 MB in the beginning and 657.6 MB in the end (delta: -327.8 MB). Peak memory consumption was 81.7 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, 112.2s OverallTime, 16 OverallIterations, 13 TraceHistogramMax, 38.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 525 SDtfs, 500 SDslu, 1648 SDs, 0 SdLazy, 2434 SolverSat, 350 SolverUnsat, 54 SolverUnknown, 0 SolverNotchecked, 18.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 542 GetRequests, 242 SyntacticMatches, 17 SemanticMatches, 283 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4214 ImplicationChecksByTransitivity, 40.2s 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, 4.0s SatisfiabilityAnalysisTime, 69.0s 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-04_12-56-02-310.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-04_12-56-02-310.csv Received shutdown request...