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-a74eeac-m [2018-02-02 18:49:40,588 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:49:40,589 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:49:40,599 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:49:40,600 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:49:40,600 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:49:40,601 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:49:40,602 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:49:40,603 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:49:40,604 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:49:40,604 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:49:40,605 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:49:40,605 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:49:40,606 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:49:40,607 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:49:40,609 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:49:40,611 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:49:40,612 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:49:40,613 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:49:40,614 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:49:40,616 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:49:40,616 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:49:40,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:49:40,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:49:40,618 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:49:40,618 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:49:40,619 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:49:40,619 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:49:40,619 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:49:40,619 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:49:40,620 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:49:40,620 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-02 18:49:40,630 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:49:40,630 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:49:40,631 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:49:40,631 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:49:40,631 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:49:40,631 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:49:40,632 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:49:40,632 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:49:40,632 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:49:40,632 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:49:40,632 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:49:40,632 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:49:40,632 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:49:40,633 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:49:40,633 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:49:40,633 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:49:40,633 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:49:40,633 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:49:40,633 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:49:40,634 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:49:40,634 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:49:40,634 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:49:40,634 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:49:40,634 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:49:40,634 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:49:40,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:49:40,671 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:49:40,674 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:49:40,676 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:49:40,676 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:49:40,676 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-02 18:49:40,818 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:49:40,819 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:49:40,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:49:40,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:49:40,824 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:49:40,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:49:40" (1/1) ... [2018-02-02 18:49:40,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a2fa17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:49:40, skipping insertion in model container [2018-02-02 18:49:40,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:49:40" (1/1) ... [2018-02-02 18:49:40,836 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:49:40,865 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:49:40,946 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:49:40,958 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:49:40,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:49:40 WrapperNode [2018-02-02 18:49:40,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:49:40,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:49:40,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:49:40,966 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:49:40,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:49:40" (1/1) ... [2018-02-02 18:49:40,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:49:40" (1/1) ... [2018-02-02 18:49:40,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:49:40" (1/1) ... [2018-02-02 18:49:40,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:49:40" (1/1) ... [2018-02-02 18:49:40,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:49:40" (1/1) ... [2018-02-02 18:49:40,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:49:40" (1/1) ... [2018-02-02 18:49:40,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:49:40" (1/1) ... [2018-02-02 18:49:40,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:49:40,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:49:40,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:49:40,990 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:49:40,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:49:40" (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-02 18:49:41,026 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:49:41,026 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:49:41,027 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-02 18:49:41,027 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:49:41,027 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 18:49:41,027 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 18:49:41,027 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 18:49:41,027 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 18:49:41,027 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:49:41,027 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:49:41,027 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:49:41,027 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-02-02 18:49:41,027 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-02-02 18:49:41,027 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 18:49:41,028 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 18:49:41,028 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-02-02 18:49:41,028 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-02 18:49:41,028 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:49:41,028 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:49:41,028 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:49:41,131 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 18:49:41,232 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:49:41,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:49:41 BoogieIcfgContainer [2018-02-02 18:49:41,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:49:41,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:49:41,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:49:41,235 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:49:41,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:49:40" (1/3) ... [2018-02-02 18:49:41,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348ecb5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:49:41, skipping insertion in model container [2018-02-02 18:49:41,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:49:40" (2/3) ... [2018-02-02 18:49:41,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348ecb5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:49:41, skipping insertion in model container [2018-02-02 18:49:41,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:49:41" (3/3) ... [2018-02-02 18:49:41,237 INFO L107 eAbstractionObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-02-02 18:49:41,242 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:49:41,247 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-02 18:49:41,268 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:49:41,268 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:49:41,269 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:49:41,269 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:49:41,269 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:49:41,269 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:49:41,269 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:49:41,269 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:49:41,269 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:49:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-02-02 18:49:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 18:49:41,284 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:49:41,285 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 18:49:41,285 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-02 18:49:41,288 INFO L82 PathProgramCache]: Analyzing trace with hash 2931467, now seen corresponding path program 1 times [2018-02-02 18:49:41,289 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:49:41,289 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:49:41,319 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:41,319 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:49:41,319 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:49:41,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:49:41,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-02 18:49:41,387 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:49:41,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:49:41,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:49:41,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:49:41,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:49:41,398 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-02-02 18:49:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:49:41,554 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-02-02 18:49:41,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:49:41,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 18:49:41,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:49:41,563 INFO L225 Difference]: With dead ends: 60 [2018-02-02 18:49:41,563 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 18:49:41,564 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-02 18:49:41,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 18:49:41,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-02 18:49:41,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 18:49:41,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-02-02 18:49:41,588 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 4 [2018-02-02 18:49:41,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:49:41,588 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-02-02 18:49:41,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:49:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-02-02 18:49:41,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 18:49:41,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:49:41,588 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 18:49:41,588 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-02 18:49:41,589 INFO L82 PathProgramCache]: Analyzing trace with hash 2931468, now seen corresponding path program 1 times [2018-02-02 18:49:41,589 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:49:41,589 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:49:41,589 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:41,590 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:49:41,590 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:49:41,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:49:41,636 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-02 18:49:41,636 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:49:41,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:49:41,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:49:41,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:49:41,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:49:41,638 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 3 states. [2018-02-02 18:49:41,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:49:41,679 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-02-02 18:49:41,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:49:41,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 18:49:41,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:49:41,680 INFO L225 Difference]: With dead ends: 53 [2018-02-02 18:49:41,680 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 18:49:41,681 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:49:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 18:49:41,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-02 18:49:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 18:49:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-02-02 18:49:41,686 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 4 [2018-02-02 18:49:41,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:49:41,686 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-02-02 18:49:41,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:49:41,686 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-02-02 18:49:41,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 18:49:41,687 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:49:41,687 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:49:41,687 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 18:49:41,687 INFO L82 PathProgramCache]: Analyzing trace with hash -240006955, now seen corresponding path program 1 times [2018-02-02 18:49:41,687 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:49:41,687 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:49:41,688 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:41,688 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:49:41,689 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:49:41,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:49:41,764 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-02 18:49:41,764 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:49:41,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:49:41,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:49:41,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:49:41,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:49:41,765 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 3 states. [2018-02-02 18:49:41,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:49:41,804 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-02-02 18:49:41,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:49:41,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-02-02 18:49:41,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:49:41,805 INFO L225 Difference]: With dead ends: 51 [2018-02-02 18:49:41,805 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 18:49:41,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:49:41,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 18:49:41,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 18:49:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 18:49:41,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-02-02 18:49:41,808 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 14 [2018-02-02 18:49:41,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:49:41,808 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-02-02 18:49:41,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:49:41,809 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-02-02 18:49:41,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 18:49:41,809 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:49:41,809 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:49:41,809 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-02 18:49:41,809 INFO L82 PathProgramCache]: Analyzing trace with hash -240006954, now seen corresponding path program 1 times [2018-02-02 18:49:41,809 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:49:41,809 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:49:41,810 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:41,810 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:49:41,810 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:49:41,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:49:41,871 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-02 18:49:41,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:49:41,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:49:41,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:49:41,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:49:41,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:49:41,872 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 4 states. [2018-02-02 18:49:41,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:49:41,907 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-02-02 18:49:41,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:49:41,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 18:49:41,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:49:41,908 INFO L225 Difference]: With dead ends: 49 [2018-02-02 18:49:41,908 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 18:49:41,909 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-02 18:49:41,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 18:49:41,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-02 18:49:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 18:49:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-02-02 18:49:41,913 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 14 [2018-02-02 18:49:41,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:49:41,913 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-02-02 18:49:41,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:49:41,913 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-02-02 18:49:41,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 18:49:41,914 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:49:41,914 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:49:41,914 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-02 18:49:41,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1149718964, now seen corresponding path program 1 times [2018-02-02 18:49:41,914 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:49:41,914 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:49:41,915 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:41,915 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:49:41,915 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:49:41,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:49:42,063 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-02 18:49:42,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:49:42,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:49:42,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:49:42,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:49:42,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:49:42,064 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 5 states. [2018-02-02 18:49:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:49:42,134 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-02-02 18:49:42,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:49:42,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 18:49:42,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:49:42,135 INFO L225 Difference]: With dead ends: 47 [2018-02-02 18:49:42,135 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 18:49:42,135 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-02 18:49:42,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 18:49:42,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-02 18:49:42,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 18:49:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-02-02 18:49:42,139 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 15 [2018-02-02 18:49:42,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:49:42,139 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-02-02 18:49:42,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:49:42,140 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-02-02 18:49:42,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 18:49:42,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:49:42,141 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-02 18:49:42,141 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-02 18:49:42,141 INFO L82 PathProgramCache]: Analyzing trace with hash 536104684, now seen corresponding path program 1 times [2018-02-02 18:49:42,141 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:49:42,141 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:49:42,142 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:42,142 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:49:42,142 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:49:42,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:49:42,183 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-02 18:49:42,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:49:42,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:49:42,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:49:42,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:49:42,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:49:42,184 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 3 states. [2018-02-02 18:49:42,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:49:42,208 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-02-02 18:49:42,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:49:42,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-02-02 18:49:42,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:49:42,209 INFO L225 Difference]: With dead ends: 45 [2018-02-02 18:49:42,209 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 18:49:42,210 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-02 18:49:42,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 18:49:42,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-02 18:49:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 18:49:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-02-02 18:49:42,214 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 27 [2018-02-02 18:49:42,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:49:42,215 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-02-02 18:49:42,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:49:42,215 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-02-02 18:49:42,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 18:49:42,216 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:49:42,216 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-02 18:49:42,216 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-02 18:49:42,216 INFO L82 PathProgramCache]: Analyzing trace with hash 536104685, now seen corresponding path program 1 times [2018-02-02 18:49:42,216 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:49:42,216 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:49:42,217 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:42,217 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:49:42,217 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:49:42,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:49:42,291 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-02 18:49:42,292 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:49:42,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 18:49:42,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 18:49:42,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 18:49:42,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:49:42,292 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 8 states. [2018-02-02 18:49:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:49:42,422 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-02-02 18:49:42,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 18:49:42,422 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-02-02 18:49:42,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:49:42,423 INFO L225 Difference]: With dead ends: 44 [2018-02-02 18:49:42,423 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 18:49:42,423 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-02 18:49:42,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 18:49:42,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-02 18:49:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 18:49:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-02-02 18:49:42,428 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 27 [2018-02-02 18:49:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:49:42,429 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-02-02 18:49:42,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 18:49:42,429 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-02-02 18:49:42,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 18:49:42,429 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:49:42,429 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-02 18:49:42,429 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-02 18:49:42,429 INFO L82 PathProgramCache]: Analyzing trace with hash 536104686, now seen corresponding path program 1 times [2018-02-02 18:49:42,429 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:49:42,429 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:49:42,430 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:42,430 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:49:42,430 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:49:42,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:49:42,476 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-02 18:49:42,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:49:42,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:49:42,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:49:42,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:49:42,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:49:42,477 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 3 states. [2018-02-02 18:49:42,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:49:42,500 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-02-02 18:49:42,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:49:42,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-02-02 18:49:42,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:49:42,501 INFO L225 Difference]: With dead ends: 42 [2018-02-02 18:49:42,501 INFO L226 Difference]: Without dead ends: 42 [2018-02-02 18:49:42,502 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-02 18:49:42,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-02 18:49:42,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-02 18:49:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 18:49:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-02-02 18:49:42,504 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 27 [2018-02-02 18:49:42,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:49:42,505 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-02-02 18:49:42,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:49:42,505 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-02-02 18:49:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 18:49:42,506 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:49:42,506 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-02 18:49:42,506 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-02 18:49:42,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1677513941, now seen corresponding path program 1 times [2018-02-02 18:49:42,506 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:49:42,506 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:49:42,507 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:42,507 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:49:42,507 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:49:42,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:49:42,575 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-02 18:49:42,576 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:49:42,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:49:42,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:49:42,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:49:42,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:49:42,577 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 4 states. [2018-02-02 18:49:42,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:49:42,589 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-02-02 18:49:42,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:49:42,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-02-02 18:49:42,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:49:42,590 INFO L225 Difference]: With dead ends: 48 [2018-02-02 18:49:42,590 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 18:49:42,591 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-02 18:49:42,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 18:49:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-02 18:49:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 18:49:42,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-02-02 18:49:42,593 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 35 [2018-02-02 18:49:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:49:42,594 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-02-02 18:49:42,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:49:42,594 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-02-02 18:49:42,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 18:49:42,595 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:49:42,595 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-02 18:49:42,595 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-02 18:49:42,595 INFO L82 PathProgramCache]: Analyzing trace with hash -656412319, now seen corresponding path program 1 times [2018-02-02 18:49:42,595 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:49:42,595 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:49:42,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:42,596 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:49:42,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:49:42,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:49:42,646 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-02 18:49:42,647 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:49:42,647 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-02 18:49:42,655 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:49:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:49:42,697 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:49:42,730 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-02 18:49:42,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:49:42,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-02-02 18:49:42,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 18:49:42,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 18:49:42,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:49:42,762 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 8 states. [2018-02-02 18:49:42,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:49:42,781 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-02-02 18:49:42,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:49:42,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-02-02 18:49:42,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:49:42,783 INFO L225 Difference]: With dead ends: 50 [2018-02-02 18:49:42,783 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 18:49:42,783 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-02 18:49:42,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 18:49:42,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-02 18:49:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 18:49:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-02-02 18:49:42,786 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 37 [2018-02-02 18:49:42,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:49:42,786 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-02-02 18:49:42,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 18:49:42,786 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-02-02 18:49:42,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 18:49:42,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:49:42,787 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-02 18:49:42,787 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-02 18:49:42,788 INFO L82 PathProgramCache]: Analyzing trace with hash -2111815019, now seen corresponding path program 2 times [2018-02-02 18:49:42,788 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:49:42,788 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:49:42,789 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:42,789 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:49:42,789 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:49:42,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:49:42,869 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-02 18:49:42,870 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:49:42,870 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-02 18:49:42,877 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:49:42,912 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 18:49:42,912 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:49:42,914 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:49:42,935 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-02 18:49:42,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:49:42,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-02-02 18:49:42,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 18:49:42,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 18:49:42,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:49:42,953 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 10 states. [2018-02-02 18:49:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:49:42,996 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-02-02 18:49:42,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:49:42,998 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-02-02 18:49:42,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:49:42,998 INFO L225 Difference]: With dead ends: 52 [2018-02-02 18:49:42,999 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 18:49:42,999 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-02 18:49:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 18:49:43,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-02 18:49:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 18:49:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-02-02 18:49:43,002 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 39 [2018-02-02 18:49:43,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:49:43,002 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-02-02 18:49:43,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 18:49:43,007 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-02-02 18:49:43,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 18:49:43,008 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:49:43,008 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-02 18:49:43,008 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-02 18:49:43,009 INFO L82 PathProgramCache]: Analyzing trace with hash 304342049, now seen corresponding path program 3 times [2018-02-02 18:49:43,009 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:49:43,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:49:43,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:43,010 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:49:43,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:49:43,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:49:43,101 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-02 18:49:43,102 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:49:43,102 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-02 18:49:43,109 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 18:49:43,187 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-02 18:49:43,187 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:49:43,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:49:43,218 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-02 18:49:43,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:49:43,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-02-02 18:49:43,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 18:49:43,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 18:49:43,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:49:43,236 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 12 states. [2018-02-02 18:49:43,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:49:43,289 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-02-02 18:49:43,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 18:49:43,290 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-02-02 18:49:43,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:49:43,290 INFO L225 Difference]: With dead ends: 54 [2018-02-02 18:49:43,290 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 18:49:43,290 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-02 18:49:43,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 18:49:43,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 18:49:43,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 18:49:43,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-02-02 18:49:43,292 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 41 [2018-02-02 18:49:43,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:49:43,293 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-02-02 18:49:43,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 18:49:43,293 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-02-02 18:49:43,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 18:49:43,294 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:49:43,294 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-02 18:49:43,294 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-02 18:49:43,294 INFO L82 PathProgramCache]: Analyzing trace with hash 747384917, now seen corresponding path program 4 times [2018-02-02 18:49:43,294 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:49:43,294 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:49:43,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:43,295 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:49:43,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:49:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:49:43,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:49:44,009 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-02 18:49:44,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:49:44,009 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-02 18:49:44,014 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 18:49:44,048 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 18:49:44,048 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:49:44,053 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:49:44,114 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-02 18:49:44,117 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-02 18:49:44,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:44,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:44,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:44,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-02-02 18:49:50,595 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-02 18:49:50,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02 18:49:50,601 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:50,604 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-02 18:49:50,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:50,608 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:50,611 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-02 18:49:50,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:50,616 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:50,617 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:50,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:50,625 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-02 18:49:50,626 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:50,636 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:50,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:50,648 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:50,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:50,674 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-02 18:49:50,674 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:189, output treesize:78 [2018-02-02 18:49:50,759 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-02 18:49:50,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:50,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:50,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-02-02 18:49:51,122 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 95 DAG size of output 33 [2018-02-02 18:49:51,138 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-02 18:49:51,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02 18:49:51,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:51,147 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-02 18:49:51,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:51,151 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:51,154 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-02 18:49:51,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:51,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:51,159 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:51,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:49:51,165 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-02 18:49:51,165 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:51,178 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:51,184 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:51,191 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:51,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:51,226 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-02 18:49:51,226 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:189, output treesize:78 [2018-02-02 18:49:51,287 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-02 18:49:51,289 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-02 18:49:51,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:49:51,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:49:51,299 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-02 18:49:51,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:76, output treesize:3 [2018-02-02 18:49:51,324 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-02 18:49:51,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:49:51,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 35 [2018-02-02 18:49:51,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 18:49:51,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 18:49:51,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1075, Unknown=14, NotChecked=0, Total=1260 [2018-02-02 18:49:51,355 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 36 states. [2018-02-02 18:50:02,495 WARN L146 SmtUtils]: Spent 288ms on a formula simplification. DAG size of input: 84 DAG size of output 72 [2018-02-02 18:50:08,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:50:08,044 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2018-02-02 18:50:08,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 18:50:08,045 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-02-02 18:50:08,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:50:08,047 INFO L225 Difference]: With dead ends: 97 [2018-02-02 18:50:08,047 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 18:50:08,049 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=2849, Unknown=29, NotChecked=0, Total=3306 [2018-02-02 18:50:08,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 18:50:08,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 74. [2018-02-02 18:50:08,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 18:50:08,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2018-02-02 18:50:08,057 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 43 [2018-02-02 18:50:08,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:50:08,057 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2018-02-02 18:50:08,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 18:50:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2018-02-02 18:50:08,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 18:50:08,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:50:08,059 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-02 18:50:08,059 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-02 18:50:08,059 INFO L82 PathProgramCache]: Analyzing trace with hash 747384918, now seen corresponding path program 1 times [2018-02-02 18:50:08,060 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:50:08,060 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:50:08,060 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:08,060 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:50:08,060 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:50:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:08,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:50:08,764 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-02 18:50:08,764 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:50:08,764 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-02 18:50:08,771 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:50:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:50:08,811 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:50:08,821 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-02 18:50:08,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-02 18:50:08,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:08,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:08,845 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-02 18:50:08,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-02-02 18:50:08,873 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-02 18:50:08,874 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-02 18:50:08,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:08,895 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-02 18:50:08,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-02 18:50:08,927 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-02 18:50:08,928 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-02 18:50:08,929 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-02 18:50:08,932 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-02 18:50:08,940 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-02 18:50:08,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-02-02 18:50:09,467 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 110 DAG size of output 46 [2018-02-02 18:50:09,488 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-02 18:50:09,491 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-02 18:50:09,494 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,496 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-02 18:50:09,500 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,509 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,510 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,513 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-02 18:50:09,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,517 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,518 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,520 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,520 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,521 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,528 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-02 18:50:09,528 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:09,554 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:09,562 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:09,571 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:09,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:09,624 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-02 18:50:09,624 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:226, output treesize:99 [2018-02-02 18:50:09,691 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,692 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-02 18:50:09,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:09,703 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-02 18:50:09,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:91, output treesize:77 [2018-02-02 18:50:09,755 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,757 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,761 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-02 18:50:09,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:09,785 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-02 18:50:09,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:86, output treesize:174 [2018-02-02 18:50:09,878 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-02 18:50:09,882 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,882 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,883 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,883 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,884 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,884 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,888 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-02 18:50:09,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:09,913 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-02 18:50:09,913 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-02 18:50:09,930 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-02 18:50:09,930 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-02 18:50:09,955 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-02 18:50:09,991 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-02 18:50:09,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,996 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,996 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:09,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:10,001 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-02 18:50:10,001 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:10,026 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-02 18:50:10,027 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-02 18:50:10,043 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-02 18:50:10,044 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-02 18:50:10,061 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-02 18:50:10,091 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-02 18:50:10,091 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:174, output treesize:95 [2018-02-02 18:50:12,236 WARN L146 SmtUtils]: Spent 2065ms on a formula simplification. DAG size of input: 63 DAG size of output 29 [2018-02-02 18:50:12,412 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 34 DAG size of output 30 [2018-02-02 18:50:56,644 WARN L146 SmtUtils]: Spent 43463ms on a formula simplification. DAG size of input: 421 DAG size of output 179 [2018-02-02 18:50:56,662 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-02 18:50:56,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,669 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,676 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-02 18:50:56,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,681 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,683 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,684 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,702 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-02 18:50:56,706 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,707 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,707 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,708 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,712 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,733 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-02 18:50:56,737 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 18:50:56,737 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:56,823 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,823 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,824 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,825 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,825 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,826 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,826 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,827 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,828 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,852 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-02 18:50:56,853 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-02-02 18:50:56,928 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,929 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,929 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,930 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,931 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,931 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,944 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-02 18:50:56,945 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:56,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,997 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:56,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,001 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,002 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,002 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,005 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,006 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,037 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-02 18:50:57,039 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2018-02-02 18:50:57,110 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,163 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:50:57,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,695 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-02 18:50:57,697 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-02 18:50:57,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,700 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-02 18:50:57,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,706 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-02 18:50:57,708 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,709 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,709 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,715 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:57,719 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-02 18:50:57,719 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,729 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,734 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,758 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:57,816 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:50:58,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,146 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-02 18:50:58,148 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-02 18:50:58,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,151 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-02 18:50:58,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,155 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,157 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-02 18:50:58,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,162 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,168 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-02 18:50:58,168 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:58,186 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:58,191 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:58,220 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:58,256 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:58,492 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-02 18:50:58,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,495 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,506 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-02 18:50:58,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,509 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,510 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,511 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,526 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-02 18:50:58,529 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,531 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:58,537 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:50:58,538 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-02 18:50:58,541 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,542 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,542 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,545 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,558 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-02 18:50:58,558 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:58,590 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:58,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,618 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,621 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,647 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-02 18:50:58,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,651 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,654 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,654 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,679 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-02 18:50:58,680 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 4 xjuncts. [2018-02-02 18:50:58,774 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,790 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-02 18:50:58,790 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-02-02 18:50:58,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,843 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,843 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,851 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,851 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:58,889 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-02 18:50:58,891 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 8 xjuncts. [2018-02-02 18:50:58,960 INFO L267 ElimStorePlain]: Start of recursive call 25: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:58,973 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:59,001 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:59,037 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:50:59,149 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-02 18:50:59,149 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 21 variables, input treesize:1029, output treesize:547 [2018-02-02 18:50:59,472 WARN L146 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 192 DAG size of output 92 [2018-02-02 18:50:59,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,490 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-02 18:50:59,496 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,497 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,502 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-02 18:50:59,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:59,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,568 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,568 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,569 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,569 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,570 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,574 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-02 18:50:59,575 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:59,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,629 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-02 18:50:59,629 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:59,668 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-02 18:50:59,669 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:59,704 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-02 18:50:59,704 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:59,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:59,765 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-02 18:50:59,771 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,772 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,772 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,773 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,773 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,777 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,780 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:50:59,798 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-02 18:50:59,798 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:59,825 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-02 18:50:59,826 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:59,838 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-02 18:50:59,838 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 18:50:59,846 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:50:59,855 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-02 18:50:59,855 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 11 variables, input treesize:251, output treesize:32 [2018-02-02 18:50:59,922 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-02 18:50:59,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:50:59,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2018-02-02 18:50:59,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 18:50:59,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 18:50:59,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1993, Unknown=12, NotChecked=0, Total=2256 [2018-02-02 18:50:59,940 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand 48 states. [2018-02-02 18:51:00,947 WARN L146 SmtUtils]: Spent 228ms on a formula simplification. DAG size of input: 145 DAG size of output 93 [2018-02-02 18:51:01,945 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 38 DAG size of output 38 [2018-02-02 18:51:02,380 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 77 DAG size of output 62 [2018-02-02 18:51:02,754 WARN L146 SmtUtils]: Spent 269ms on a formula simplification. DAG size of input: 111 DAG size of output 85 [2018-02-02 18:51:03,861 WARN L146 SmtUtils]: Spent 196ms on a formula simplification. DAG size of input: 135 DAG size of output 133 [2018-02-02 18:51:04,207 WARN L146 SmtUtils]: Spent 234ms on a formula simplification. DAG size of input: 149 DAG size of output 136 [2018-02-02 18:51:04,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:51:04,251 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2018-02-02 18:51:04,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 18:51:04,252 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 43 [2018-02-02 18:51:04,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:51:04,252 INFO L225 Difference]: With dead ends: 94 [2018-02-02 18:51:04,252 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 18:51:04,253 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1532 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=611, Invalid=5063, Unknown=26, NotChecked=0, Total=5700 [2018-02-02 18:51:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 18:51:04,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-02-02 18:51:04,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-02 18:51:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2018-02-02 18:51:04,257 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 43 [2018-02-02 18:51:04,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:51:04,258 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2018-02-02 18:51:04,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 18:51:04,258 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2018-02-02 18:51:04,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 18:51:04,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:51:04,258 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-02 18:51:04,258 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-02 18:51:04,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1348121705, now seen corresponding path program 1 times [2018-02-02 18:51:04,259 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:51:04,259 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:51:04,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:04,259 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:04,260 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:51:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:04,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:51:05,754 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-02 18:51:05,755 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:51:05,755 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-02 18:51:05,759 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:51:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:51:05,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:51:05,851 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-02 18:51:05,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02 18:51:05,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:05,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:05,861 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-02 18:51:05,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:45 [2018-02-02 18:51:05,915 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:05,915 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-02 18:51:05,917 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:05,917 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-02 18:51:05,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:05,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:05,928 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-02 18:51:05,930 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-02 18:51:05,931 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-02 18:51:05,935 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-02 18:51:05,944 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-02 18:51:05,944 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:25 [2018-02-02 18:51:10,669 WARN L146 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 115 DAG size of output 53 [2018-02-02 18:51:10,693 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-02 18:51:10,697 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-02 18:51:10,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,701 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-02 18:51:10,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,705 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,706 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,710 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-02 18:51:10,713 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,713 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,715 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,715 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:10,721 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-02 18:51:10,721 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:10,733 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:10,739 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:10,750 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:10,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:10,806 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-02 18:51:10,806 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:239, output treesize:121 [2018-02-02 18:51:11,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,159 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-02 18:51:11,162 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,162 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-02 18:51:11,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,184 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,185 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,185 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-02 18:51:11,188 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-02 18:51:11,188 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:11,194 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:11,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-02 18:51:11,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,199 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-02 18:51:11,199 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:11,204 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:11,214 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:51:11,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:51:11,252 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-02 18:51:11,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,255 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:11,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,257 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:11,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,259 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:11,273 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-02 18:51:11,274 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-02 18:51:11,313 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,313 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,314 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,315 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,315 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,316 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,319 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-02 18:51:11,320 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:11,338 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-02 18:51:11,338 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-02 18:51:11,350 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-02 18:51:11,358 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-02 18:51:11,362 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,367 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:11,373 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-02 18:51:11,374 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:11,413 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-02 18:51:11,414 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-02 18:51:11,436 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-02 18:51:11,436 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-02 18:51:11,452 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-02 18:51:11,490 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-02 18:51:11,491 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:130, output treesize:119 [2018-02-02 18:51:16,487 WARN L146 SmtUtils]: Spent 516ms on a formula simplification. DAG size of input: 137 DAG size of output 75 [2018-02-02 18:51:16,538 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-02 18:51:16,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,545 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,546 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,553 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-02 18:51:16,557 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,558 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,558 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,559 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,566 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-02 18:51:16,569 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,570 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,574 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-02 18:51:16,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,577 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 18:51:16,579 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-02 18:51:16,579 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,589 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,612 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,819 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-02 18:51:16,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,824 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-02 18:51:16,828 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,831 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,837 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-02 18:51:16,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,842 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,843 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,844 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:16,853 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-02 18:51:16,853 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,867 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,874 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,891 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:16,978 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-02 18:51:16,978 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:313, output treesize:198 [2018-02-02 18:51:17,137 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-02 18:51:17,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:17,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:17,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:17,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:17,145 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:17,149 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-02 18:51:17,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:17,471 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-02 18:51:17,471 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:17,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:17,632 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:17,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:17,633 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:17,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:17,636 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:17,637 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:17,637 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:17,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:17,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:17,641 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:17,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:17,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:51:17,660 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-02 18:51:17,661 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:17,828 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-02 18:51:17,829 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:18,018 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-02 18:51:18,018 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:18,050 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-02 18:51:18,051 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 18:51:18,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:51:18,104 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-02 18:51:18,104 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:178, output treesize:47 [2018-02-02 18:51:18,162 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-02 18:51:18,166 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-02 18:51:18,179 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-02 18:51:18,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:51:18,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24] total 49 [2018-02-02 18:51:18,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-02 18:51:18,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-02 18:51:18,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2054, Unknown=30, NotChecked=186, Total=2450 [2018-02-02 18:51:18,198 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand 50 states. Received shutdown request... [2018-02-02 18:51:23,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 18:51:23,078 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 18:51:23,082 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 18:51:23,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 06:51:23 BoogieIcfgContainer [2018-02-02 18:51:23,083 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 18:51:23,083 INFO L168 Benchmark]: Toolchain (without parser) took 102264.85 ms. Allocated memory was 399.5 MB in the beginning and 823.1 MB in the end (delta: 423.6 MB). Free memory was 356.2 MB in the beginning and 571.2 MB in the end (delta: -215.0 MB). Peak memory consumption was 208.7 MB. Max. memory is 5.3 GB. [2018-02-02 18:51:23,084 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 399.5 MB. Free memory is still 361.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:51:23,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.04 ms. Allocated memory is still 399.5 MB. Free memory was 356.2 MB in the beginning and 345.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:51:23,085 INFO L168 Benchmark]: Boogie Preprocessor took 24.27 ms. Allocated memory is still 399.5 MB. Free memory was 345.6 MB in the beginning and 343.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:51:23,085 INFO L168 Benchmark]: RCFGBuilder took 242.08 ms. Allocated memory is still 399.5 MB. Free memory was 343.0 MB in the beginning and 320.4 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:51:23,085 INFO L168 Benchmark]: TraceAbstraction took 101849.88 ms. Allocated memory was 399.5 MB in the beginning and 823.1 MB in the end (delta: 423.6 MB). Free memory was 320.4 MB in the beginning and 571.2 MB in the end (delta: -250.8 MB). Peak memory consumption was 172.8 MB. Max. memory is 5.3 GB. [2018-02-02 18:51:23,086 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.12 ms. Allocated memory is still 399.5 MB. Free memory is still 361.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 146.04 ms. Allocated memory is still 399.5 MB. Free memory was 356.2 MB in the beginning and 345.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.27 ms. Allocated memory is still 399.5 MB. Free memory was 345.6 MB in the beginning and 343.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 242.08 ms. Allocated memory is still 399.5 MB. Free memory was 343.0 MB in the beginning and 320.4 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 101849.88 ms. Allocated memory was 399.5 MB in the beginning and 823.1 MB in the end (delta: 423.6 MB). Free memory was 320.4 MB in the beginning and 571.2 MB in the end (delta: -250.8 MB). Peak memory consumption was 172.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 743). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 743). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 751). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 751). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 751). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 751). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - TimeoutResultAtElement [Line: 746]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 746). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 15 states, 50 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 60 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 23 error locations. TIMEOUT Result, 101.8s OverallTime, 15 OverallIterations, 8 TraceHistogramMax, 26.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 481 SDtfs, 413 SDslu, 1256 SDs, 0 SdLazy, 1826 SolverSat, 278 SolverUnsat, 42 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 202 SyntacticMatches, 17 SemanticMatches, 240 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3335 ImplicationChecksByTransitivity, 35.0s 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, 14 MinimizatonAttempts, 26 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 74.2s InterpolantComputationTime, 667 NumberOfCodeBlocks, 666 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 646 ConstructedInterpolants, 72 QuantifiedInterpolants, 552339 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1455 ConjunctsInSsa, 197 ConjunctsInUnsatCore, 21 InterpolantComputations, 9 PerfectInterpolantSequences, 107/421 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout 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-02_18-51-23-093.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-02_18-51-23-093.csv Completed graceful shutdown