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-0232_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 23:10:07,244 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 23:10:07,246 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 23:10:07,259 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 23:10:07,259 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 23:10:07,260 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 23:10:07,261 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 23:10:07,262 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 23:10:07,264 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 23:10:07,265 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 23:10:07,265 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 23:10:07,265 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 23:10:07,266 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 23:10:07,267 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 23:10:07,268 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 23:10:07,270 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 23:10:07,271 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 23:10:07,273 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 23:10:07,274 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 23:10:07,275 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 23:10:07,277 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 23:10:07,277 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 23:10:07,277 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 23:10:07,278 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 23:10:07,278 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 23:10:07,279 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 23:10:07,280 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 23:10:07,280 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 23:10:07,280 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 23:10:07,280 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 23:10:07,281 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 23:10:07,281 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 23:10:07,289 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 23:10:07,289 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 23:10:07,290 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 23:10:07,290 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 23:10:07,290 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 23:10:07,290 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 23:10:07,290 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 23:10:07,291 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 23:10:07,291 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 23:10:07,291 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 23:10:07,291 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 23:10:07,291 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 23:10:07,291 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 23:10:07,291 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 23:10:07,291 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 23:10:07,291 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 23:10:07,291 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 23:10:07,292 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 23:10:07,292 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 23:10:07,292 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 23:10:07,292 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 23:10:07,292 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 23:10:07,292 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 23:10:07,292 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 23:10:07,292 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 23:10:07,325 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 23:10:07,333 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 23:10:07,335 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 23:10:07,336 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 23:10:07,337 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 23:10:07,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-free.i [2018-02-03 23:10:07,445 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 23:10:07,446 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 23:10:07,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 23:10:07,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 23:10:07,450 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 23:10:07,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:10:07" (1/1) ... [2018-02-03 23:10:07,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11580fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:07, skipping insertion in model container [2018-02-03 23:10:07,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:10:07" (1/1) ... [2018-02-03 23:10:07,462 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:10:07,487 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:10:07,570 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:10:07,583 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:10:07,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:07 WrapperNode [2018-02-03 23:10:07,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 23:10:07,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 23:10:07,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 23:10:07,590 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 23:10:07,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:07" (1/1) ... [2018-02-03 23:10:07,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:07" (1/1) ... [2018-02-03 23:10:07,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:07" (1/1) ... [2018-02-03 23:10:07,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:07" (1/1) ... [2018-02-03 23:10:07,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:07" (1/1) ... [2018-02-03 23:10:07,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:07" (1/1) ... [2018-02-03 23:10:07,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:07" (1/1) ... [2018-02-03 23:10:07,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 23:10:07,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 23:10:07,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 23:10:07,615 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 23:10:07,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:07" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 23:10:07,665 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 23:10:07,665 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 23:10:07,665 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-03 23:10:07,665 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 23:10:07,665 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-03 23:10:07,666 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-03 23:10:07,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 23:10:07,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 23:10:07,666 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 23:10:07,666 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-03 23:10:07,666 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-03 23:10:07,666 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 23:10:07,666 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-03 23:10:07,667 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 23:10:07,667 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 23:10:07,667 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 23:10:07,980 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 23:10:07,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:10:07 BoogieIcfgContainer [2018-02-03 23:10:07,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 23:10:07,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 23:10:07,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 23:10:07,984 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 23:10:07,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 11:10:07" (1/3) ... [2018-02-03 23:10:07,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c352feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:10:07, skipping insertion in model container [2018-02-03 23:10:07,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:10:07" (2/3) ... [2018-02-03 23:10:07,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c352feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:10:07, skipping insertion in model container [2018-02-03 23:10:07,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:10:07" (3/3) ... [2018-02-03 23:10:07,987 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-free.i [2018-02-03 23:10:07,991 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 23:10:07,996 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 53 error locations. [2018-02-03 23:10:08,025 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 23:10:08,025 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 23:10:08,026 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 23:10:08,026 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 23:10:08,026 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 23:10:08,026 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 23:10:08,026 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 23:10:08,026 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 23:10:08,027 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 23:10:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states. [2018-02-03 23:10:08,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-03 23:10:08,047 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:08,048 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:08,048 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:08,052 INFO L82 PathProgramCache]: Analyzing trace with hash 842410072, now seen corresponding path program 1 times [2018-02-03 23:10:08,053 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:08,054 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:08,096 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:08,096 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:08,096 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:08,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:08,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:08,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:08,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:10:08,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:10:08,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:10:08,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:10:08,194 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 3 states. [2018-02-03 23:10:08,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:08,385 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-02-03 23:10:08,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:10:08,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-03 23:10:08,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:08,392 INFO L225 Difference]: With dead ends: 115 [2018-02-03 23:10:08,393 INFO L226 Difference]: Without dead ends: 112 [2018-02-03 23:10:08,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:10:08,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-03 23:10:08,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-02-03 23:10:08,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-03 23:10:08,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2018-02-03 23:10:08,421 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 7 [2018-02-03 23:10:08,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:08,422 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2018-02-03 23:10:08,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:10:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-02-03 23:10:08,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-03 23:10:08,422 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:08,422 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:08,423 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:08,423 INFO L82 PathProgramCache]: Analyzing trace with hash 842410073, now seen corresponding path program 1 times [2018-02-03 23:10:08,423 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:08,423 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:08,424 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:08,424 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:08,424 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:08,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:08,487 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:08,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:10:08,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:10:08,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:10:08,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:10:08,489 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 3 states. [2018-02-03 23:10:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:08,567 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2018-02-03 23:10:08,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:10:08,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-03 23:10:08,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:08,568 INFO L225 Difference]: With dead ends: 110 [2018-02-03 23:10:08,569 INFO L226 Difference]: Without dead ends: 110 [2018-02-03 23:10:08,569 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:10:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-03 23:10:08,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-02-03 23:10:08,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-03 23:10:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-02-03 23:10:08,576 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 7 [2018-02-03 23:10:08,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:08,576 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-02-03 23:10:08,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:10:08,577 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-02-03 23:10:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 23:10:08,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:08,577 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:08,577 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:08,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1112643303, now seen corresponding path program 1 times [2018-02-03 23:10:08,578 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:08,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:08,579 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:08,579 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:08,579 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:08,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:08,638 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:08,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:10:08,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:10:08,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:10:08,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:10:08,639 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 5 states. [2018-02-03 23:10:08,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:08,863 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-02-03 23:10:08,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:10:08,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-03 23:10:08,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:08,864 INFO L225 Difference]: With dead ends: 106 [2018-02-03 23:10:08,864 INFO L226 Difference]: Without dead ends: 106 [2018-02-03 23:10:08,865 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-03 23:10:08,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-03 23:10:08,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-02-03 23:10:08,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-03 23:10:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-02-03 23:10:08,870 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 13 [2018-02-03 23:10:08,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:08,870 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-02-03 23:10:08,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:10:08,870 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-02-03 23:10:08,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 23:10:08,871 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:08,871 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:08,871 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:08,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1112643304, now seen corresponding path program 1 times [2018-02-03 23:10:08,871 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:08,871 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:08,872 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:08,872 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:08,872 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:08,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:08,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:08,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 23:10:08,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 23:10:08,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 23:10:08,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:10:08,971 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 7 states. [2018-02-03 23:10:09,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:09,168 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2018-02-03 23:10:09,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:10:09,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-02-03 23:10:09,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:09,169 INFO L225 Difference]: With dead ends: 135 [2018-02-03 23:10:09,169 INFO L226 Difference]: Without dead ends: 135 [2018-02-03 23:10:09,169 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:10:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-03 23:10:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2018-02-03 23:10:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-03 23:10:09,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2018-02-03 23:10:09,174 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 13 [2018-02-03 23:10:09,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:09,174 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2018-02-03 23:10:09,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 23:10:09,174 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2018-02-03 23:10:09,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 23:10:09,175 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:09,175 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:09,175 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:09,175 INFO L82 PathProgramCache]: Analyzing trace with hash 132204114, now seen corresponding path program 1 times [2018-02-03 23:10:09,175 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:09,176 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:09,176 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:09,176 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:09,176 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:09,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:09,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:09,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:10:09,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:10:09,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:10:09,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:10:09,205 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand 4 states. [2018-02-03 23:10:09,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:09,269 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-02-03 23:10:09,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:10:09,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-03 23:10:09,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:09,270 INFO L225 Difference]: With dead ends: 121 [2018-02-03 23:10:09,270 INFO L226 Difference]: Without dead ends: 121 [2018-02-03 23:10:09,270 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:10:09,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-03 23:10:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-02-03 23:10:09,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-03 23:10:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. [2018-02-03 23:10:09,274 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 133 transitions. Word has length 14 [2018-02-03 23:10:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:09,274 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 133 transitions. [2018-02-03 23:10:09,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:10:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 133 transitions. [2018-02-03 23:10:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 23:10:09,275 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:09,275 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:09,275 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:09,275 INFO L82 PathProgramCache]: Analyzing trace with hash 132204115, now seen corresponding path program 1 times [2018-02-03 23:10:09,275 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:09,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:09,276 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:09,276 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:09,276 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:09,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:09,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:09,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:10:09,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:10:09,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:10:09,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:10:09,317 INFO L87 Difference]: Start difference. First operand 121 states and 133 transitions. Second operand 4 states. [2018-02-03 23:10:09,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:09,373 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-02-03 23:10:09,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:10:09,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-03 23:10:09,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:09,374 INFO L225 Difference]: With dead ends: 117 [2018-02-03 23:10:09,374 INFO L226 Difference]: Without dead ends: 117 [2018-02-03 23:10:09,374 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:10:09,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-03 23:10:09,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-02-03 23:10:09,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-03 23:10:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-02-03 23:10:09,378 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 14 [2018-02-03 23:10:09,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:09,378 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-02-03 23:10:09,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:10:09,378 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-02-03 23:10:09,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-03 23:10:09,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:09,378 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:09,378 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:09,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1054600686, now seen corresponding path program 1 times [2018-02-03 23:10:09,379 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:09,379 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:09,379 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:09,380 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:09,380 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:09,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:09,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:09,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 23:10:09,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 23:10:09,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 23:10:09,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:10:09,446 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 8 states. [2018-02-03 23:10:09,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:09,604 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-02-03 23:10:09,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 23:10:09,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-03 23:10:09,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:09,605 INFO L225 Difference]: With dead ends: 114 [2018-02-03 23:10:09,605 INFO L226 Difference]: Without dead ends: 114 [2018-02-03 23:10:09,605 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-02-03 23:10:09,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-03 23:10:09,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-03 23:10:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-03 23:10:09,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-02-03 23:10:09,609 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 19 [2018-02-03 23:10:09,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:09,610 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-02-03 23:10:09,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 23:10:09,610 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-02-03 23:10:09,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-03 23:10:09,611 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:09,611 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:09,611 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:09,611 INFO L82 PathProgramCache]: Analyzing trace with hash -564310853, now seen corresponding path program 1 times [2018-02-03 23:10:09,611 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:09,611 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:09,612 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:09,612 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:09,612 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:09,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:09,700 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:09,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 23:10:09,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 23:10:09,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 23:10:09,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-03 23:10:09,701 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 6 states. [2018-02-03 23:10:09,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:09,810 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-02-03 23:10:09,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 23:10:09,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-03 23:10:09,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:09,811 INFO L225 Difference]: With dead ends: 115 [2018-02-03 23:10:09,811 INFO L226 Difference]: Without dead ends: 115 [2018-02-03 23:10:09,811 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:10:09,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-03 23:10:09,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 108. [2018-02-03 23:10:09,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-03 23:10:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-02-03 23:10:09,815 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 27 [2018-02-03 23:10:09,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:09,815 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-02-03 23:10:09,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 23:10:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-02-03 23:10:09,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 23:10:09,815 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:09,815 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, 1, 1, 1] [2018-02-03 23:10:09,816 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:09,816 INFO L82 PathProgramCache]: Analyzing trace with hash -882655928, now seen corresponding path program 1 times [2018-02-03 23:10:09,816 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:09,816 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:09,816 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:09,816 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:09,816 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:09,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:09,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:09,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 23:10:09,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 23:10:09,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 23:10:09,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:10:09,874 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 7 states. [2018-02-03 23:10:09,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:09,989 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2018-02-03 23:10:09,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 23:10:09,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-03 23:10:09,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:09,991 INFO L225 Difference]: With dead ends: 129 [2018-02-03 23:10:09,991 INFO L226 Difference]: Without dead ends: 129 [2018-02-03 23:10:09,991 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-03 23:10:09,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-03 23:10:09,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 107. [2018-02-03 23:10:09,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-03 23:10:09,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-02-03 23:10:09,994 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 30 [2018-02-03 23:10:09,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:09,994 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-02-03 23:10:09,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 23:10:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-02-03 23:10:09,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 23:10:09,995 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:09,995 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, 1, 1, 1] [2018-02-03 23:10:09,995 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:09,995 INFO L82 PathProgramCache]: Analyzing trace with hash -882655927, now seen corresponding path program 1 times [2018-02-03 23:10:09,995 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:09,995 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:09,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:09,996 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:09,996 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:10,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:10,109 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:10,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 23:10:10,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 23:10:10,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 23:10:10,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:10:10,110 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 9 states. [2018-02-03 23:10:10,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:10,322 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2018-02-03 23:10:10,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-03 23:10:10,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-02-03 23:10:10,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:10,323 INFO L225 Difference]: With dead ends: 135 [2018-02-03 23:10:10,323 INFO L226 Difference]: Without dead ends: 135 [2018-02-03 23:10:10,323 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-02-03 23:10:10,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-03 23:10:10,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 106. [2018-02-03 23:10:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-03 23:10:10,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-02-03 23:10:10,325 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 30 [2018-02-03 23:10:10,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:10,325 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-02-03 23:10:10,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 23:10:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-02-03 23:10:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-03 23:10:10,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:10,326 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] [2018-02-03 23:10:10,327 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:10,327 INFO L82 PathProgramCache]: Analyzing trace with hash -575262126, now seen corresponding path program 1 times [2018-02-03 23:10:10,327 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:10,327 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:10,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:10,328 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:10,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:10,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:10,423 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:10,424 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:10,432 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:10,458 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:10,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:10,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-03 23:10:10,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:10,546 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:10,550 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:10,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:10:10,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:10,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:10,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-03 23:10:10,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:10,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:10:10,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-02-03 23:10:10,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-03 23:10:10,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-03 23:10:10,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-02-03 23:10:10,601 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 13 states. [2018-02-03 23:10:10,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:10,856 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-02-03 23:10:10,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 23:10:10,856 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-02-03 23:10:10,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:10,857 INFO L225 Difference]: With dead ends: 103 [2018-02-03 23:10:10,857 INFO L226 Difference]: Without dead ends: 103 [2018-02-03 23:10:10,857 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-02-03 23:10:10,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-03 23:10:10,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2018-02-03 23:10:10,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-03 23:10:10,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-02-03 23:10:10,859 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 32 [2018-02-03 23:10:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:10,859 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-02-03 23:10:10,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-03 23:10:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-02-03 23:10:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-03 23:10:10,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:10,860 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, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:10,860 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:10,861 INFO L82 PathProgramCache]: Analyzing trace with hash -552202616, now seen corresponding path program 1 times [2018-02-03 23:10:10,861 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:10,861 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:10,862 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:10,862 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:10,862 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:10,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:10,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:10,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:10,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 23:10:10,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:10:10,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:10:10,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:10:10,913 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 5 states. [2018-02-03 23:10:10,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:10,978 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-02-03 23:10:10,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:10:10,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-03 23:10:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:10,979 INFO L225 Difference]: With dead ends: 106 [2018-02-03 23:10:10,979 INFO L226 Difference]: Without dead ends: 106 [2018-02-03 23:10:10,979 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-03 23:10:10,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-03 23:10:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2018-02-03 23:10:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-03 23:10:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-02-03 23:10:10,982 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 33 [2018-02-03 23:10:10,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:10,982 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-02-03 23:10:10,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:10:10,983 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-02-03 23:10:10,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-03 23:10:10,983 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:10,983 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, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:10,984 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:10,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1412958943, now seen corresponding path program 1 times [2018-02-03 23:10:10,984 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:10,984 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:10,985 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:10,985 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:10,985 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:10,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:11,021 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:11,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:10:11,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:10:11,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:10:11,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:10:11,022 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 5 states. [2018-02-03 23:10:11,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:11,114 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-02-03 23:10:11,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:10:11,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-03 23:10:11,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:11,115 INFO L225 Difference]: With dead ends: 102 [2018-02-03 23:10:11,115 INFO L226 Difference]: Without dead ends: 102 [2018-02-03 23:10:11,115 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:10:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-03 23:10:11,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-02-03 23:10:11,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-03 23:10:11,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2018-02-03 23:10:11,118 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 33 [2018-02-03 23:10:11,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:11,118 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2018-02-03 23:10:11,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:10:11,118 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2018-02-03 23:10:11,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-03 23:10:11,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:11,119 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, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:11,119 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:11,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1412958942, now seen corresponding path program 1 times [2018-02-03 23:10:11,119 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:11,119 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:11,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:11,120 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:11,120 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:11,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:11,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:11,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:11,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-03 23:10:11,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 23:10:11,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 23:10:11,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-03 23:10:11,278 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 11 states. [2018-02-03 23:10:11,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:11,504 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2018-02-03 23:10:11,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 23:10:11,504 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-02-03 23:10:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:11,504 INFO L225 Difference]: With dead ends: 104 [2018-02-03 23:10:11,504 INFO L226 Difference]: Without dead ends: 104 [2018-02-03 23:10:11,505 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-02-03 23:10:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-03 23:10:11,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-02-03 23:10:11,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-03 23:10:11,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-02-03 23:10:11,508 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 33 [2018-02-03 23:10:11,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:11,508 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-02-03 23:10:11,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 23:10:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-02-03 23:10:11,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-03 23:10:11,509 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:11,509 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:11,509 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:11,509 INFO L82 PathProgramCache]: Analyzing trace with hash -852054260, now seen corresponding path program 1 times [2018-02-03 23:10:11,509 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:11,510 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:11,510 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:11,510 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:11,510 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:11,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:11,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:11,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:11,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-03 23:10:11,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-03 23:10:11,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-03 23:10:11,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-03 23:10:11,799 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 15 states. [2018-02-03 23:10:12,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:12,380 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-02-03 23:10:12,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-03 23:10:12,381 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-02-03 23:10:12,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:12,382 INFO L225 Difference]: With dead ends: 139 [2018-02-03 23:10:12,382 INFO L226 Difference]: Without dead ends: 139 [2018-02-03 23:10:12,382 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-02-03 23:10:12,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-03 23:10:12,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 111. [2018-02-03 23:10:12,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-03 23:10:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-02-03 23:10:12,385 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 34 [2018-02-03 23:10:12,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:12,385 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-02-03 23:10:12,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-03 23:10:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-02-03 23:10:12,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-03 23:10:12,386 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:12,386 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:12,386 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:12,390 INFO L82 PathProgramCache]: Analyzing trace with hash -852054259, now seen corresponding path program 1 times [2018-02-03 23:10:12,390 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:12,390 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:12,391 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:12,391 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:12,391 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:12,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:12,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:12,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-03 23:10:12,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-03 23:10:12,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-03 23:10:12,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-03 23:10:12,641 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 15 states. [2018-02-03 23:10:13,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:13,243 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2018-02-03 23:10:13,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-03 23:10:13,243 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-02-03 23:10:13,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:13,244 INFO L225 Difference]: With dead ends: 142 [2018-02-03 23:10:13,244 INFO L226 Difference]: Without dead ends: 142 [2018-02-03 23:10:13,245 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2018-02-03 23:10:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-03 23:10:13,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 111. [2018-02-03 23:10:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-03 23:10:13,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2018-02-03 23:10:13,248 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 34 [2018-02-03 23:10:13,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:13,248 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2018-02-03 23:10:13,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-03 23:10:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-02-03 23:10:13,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-03 23:10:13,249 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:13,249 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:13,249 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:13,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1908491397, now seen corresponding path program 1 times [2018-02-03 23:10:13,249 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:13,250 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:13,250 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:13,250 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:13,250 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:13,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:13,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:13,320 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:13,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 23:10:13,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 23:10:13,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 23:10:13,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:10:13,327 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 8 states. [2018-02-03 23:10:13,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:13,396 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-02-03 23:10:13,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 23:10:13,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-02-03 23:10:13,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:13,397 INFO L225 Difference]: With dead ends: 108 [2018-02-03 23:10:13,397 INFO L226 Difference]: Without dead ends: 108 [2018-02-03 23:10:13,397 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-03 23:10:13,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-03 23:10:13,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-02-03 23:10:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-03 23:10:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2018-02-03 23:10:13,399 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 35 [2018-02-03 23:10:13,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:13,400 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2018-02-03 23:10:13,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 23:10:13,400 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-02-03 23:10:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-03 23:10:13,400 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:13,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:13,401 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:13,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1514610189, now seen corresponding path program 1 times [2018-02-03 23:10:13,401 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:13,401 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:13,402 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:13,402 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:13,402 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:13,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:13,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:13,694 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:13,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-03 23:10:13,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-03 23:10:13,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-03 23:10:13,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-03 23:10:13,695 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 15 states. [2018-02-03 23:10:14,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:14,369 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2018-02-03 23:10:14,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-03 23:10:14,369 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-02-03 23:10:14,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:14,370 INFO L225 Difference]: With dead ends: 151 [2018-02-03 23:10:14,370 INFO L226 Difference]: Without dead ends: 151 [2018-02-03 23:10:14,370 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=748, Unknown=0, NotChecked=0, Total=930 [2018-02-03 23:10:14,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-03 23:10:14,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 125. [2018-02-03 23:10:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-03 23:10:14,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-02-03 23:10:14,373 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 36 [2018-02-03 23:10:14,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:14,373 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-02-03 23:10:14,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-03 23:10:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-02-03 23:10:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-03 23:10:14,373 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:14,374 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:14,374 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:14,374 INFO L82 PathProgramCache]: Analyzing trace with hash -291724377, now seen corresponding path program 1 times [2018-02-03 23:10:14,374 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:14,374 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:14,375 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:14,375 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:14,375 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:14,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:14,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:14,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 23:10:14,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 23:10:14,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 23:10:14,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:10:14,434 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 8 states. [2018-02-03 23:10:14,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:14,521 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-02-03 23:10:14,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 23:10:14,521 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-02-03 23:10:14,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:14,522 INFO L225 Difference]: With dead ends: 124 [2018-02-03 23:10:14,522 INFO L226 Difference]: Without dead ends: 124 [2018-02-03 23:10:14,522 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-03 23:10:14,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-03 23:10:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-03 23:10:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-03 23:10:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2018-02-03 23:10:14,524 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 37 [2018-02-03 23:10:14,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:14,524 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2018-02-03 23:10:14,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 23:10:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2018-02-03 23:10:14,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-03 23:10:14,524 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:14,524 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:14,524 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:14,524 INFO L82 PathProgramCache]: Analyzing trace with hash -291724376, now seen corresponding path program 1 times [2018-02-03 23:10:14,524 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:14,524 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:14,525 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:14,525 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:14,525 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:14,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:14,833 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:14,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-03 23:10:14,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-03 23:10:14,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-03 23:10:14,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-02-03 23:10:14,834 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 15 states. [2018-02-03 23:10:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:15,344 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-02-03 23:10:15,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-03 23:10:15,344 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-02-03 23:10:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:15,345 INFO L225 Difference]: With dead ends: 134 [2018-02-03 23:10:15,345 INFO L226 Difference]: Without dead ends: 134 [2018-02-03 23:10:15,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2018-02-03 23:10:15,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-03 23:10:15,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2018-02-03 23:10:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-03 23:10:15,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-02-03 23:10:15,348 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 37 [2018-02-03 23:10:15,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:15,349 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-02-03 23:10:15,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-03 23:10:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-02-03 23:10:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-03 23:10:15,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:15,349 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:15,350 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:15,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1900218884, now seen corresponding path program 1 times [2018-02-03 23:10:15,350 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:15,350 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:15,350 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:15,351 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:15,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:15,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:15,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:15,468 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:15,468 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:15,475 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:15,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:15,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:10:15,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:10:15,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:15,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:15,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:15,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-03 23:10:15,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-03 23:10:15,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:15,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:15,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-02-03 23:10:15,664 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 25 treesize of output 35 [2018-02-03 23:10:15,668 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 26 treesize of output 25 [2018-02-03 23:10:15,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:15,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:15,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:15,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-02-03 23:10:15,736 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 28 treesize of output 28 [2018-02-03 23:10:15,740 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 5 [2018-02-03 23:10:15,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:15,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:15,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:15,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-02-03 23:10:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:15,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:10:15,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 19 [2018-02-03 23:10:15,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-03 23:10:15,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-03 23:10:15,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-02-03 23:10:15,777 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 20 states. [2018-02-03 23:10:16,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:16,217 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-02-03 23:10:16,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 23:10:16,217 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-02-03 23:10:16,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:16,218 INFO L225 Difference]: With dead ends: 124 [2018-02-03 23:10:16,218 INFO L226 Difference]: Without dead ends: 124 [2018-02-03 23:10:16,218 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2018-02-03 23:10:16,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-03 23:10:16,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-03 23:10:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-03 23:10:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2018-02-03 23:10:16,220 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 38 [2018-02-03 23:10:16,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:16,220 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2018-02-03 23:10:16,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-03 23:10:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2018-02-03 23:10:16,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-03 23:10:16,221 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:16,221 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:16,221 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:16,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1900218883, now seen corresponding path program 1 times [2018-02-03 23:10:16,221 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:16,222 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:16,222 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:16,222 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:16,223 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:16,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:16,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:16,391 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:16,391 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:16,396 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:16,416 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:16,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:10:16,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:10:16,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:16,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:16,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:10:16,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:10:16,458 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:16,459 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:16,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:16,464 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-02-03 23:10:16,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:16,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:16,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-03 23:10:16,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:16,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-03 23:10:16,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:16,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:16,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-02-03 23:10:16,610 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 33 treesize of output 41 [2018-02-03 23:10:16,613 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 34 treesize of output 33 [2018-02-03 23:10:16,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:16,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:16,645 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 23 treesize of output 33 [2018-02-03 23:10:16,647 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 24 treesize of output 23 [2018-02-03 23:10:16,647 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:16,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:16,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:16,665 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-02-03 23:10:16,696 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 36 treesize of output 34 [2018-02-03 23:10:16,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-02-03 23:10:16,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:16,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:16,720 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 26 treesize of output 26 [2018-02-03 23:10:16,722 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 22 treesize of output 15 [2018-02-03 23:10:16,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:16,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-03 23:10:16,730 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:16,738 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 18 treesize of output 3 [2018-02-03 23:10:16,738 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:16,741 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:16,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:16,745 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-02-03 23:10:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:16,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:10:16,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 21 [2018-02-03 23:10:16,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-03 23:10:16,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-03 23:10:16,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=405, Unknown=1, NotChecked=0, Total=462 [2018-02-03 23:10:16,785 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 22 states. [2018-02-03 23:10:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:17,311 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-02-03 23:10:17,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 23:10:17,311 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2018-02-03 23:10:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:17,312 INFO L225 Difference]: With dead ends: 123 [2018-02-03 23:10:17,312 INFO L226 Difference]: Without dead ends: 123 [2018-02-03 23:10:17,313 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=866, Unknown=1, NotChecked=0, Total=1056 [2018-02-03 23:10:17,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-03 23:10:17,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-02-03 23:10:17,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-03 23:10:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-02-03 23:10:17,315 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 38 [2018-02-03 23:10:17,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:17,315 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-02-03 23:10:17,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-03 23:10:17,315 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-02-03 23:10:17,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-03 23:10:17,315 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:17,316 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:17,316 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:17,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1174251320, now seen corresponding path program 1 times [2018-02-03 23:10:17,316 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:17,316 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:17,316 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:17,316 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:17,316 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:17,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:17,440 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:17,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-03 23:10:17,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 23:10:17,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 23:10:17,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:10:17,441 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 12 states. [2018-02-03 23:10:17,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:17,605 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-02-03 23:10:17,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 23:10:17,605 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-02-03 23:10:17,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:17,606 INFO L225 Difference]: With dead ends: 130 [2018-02-03 23:10:17,606 INFO L226 Difference]: Without dead ends: 130 [2018-02-03 23:10:17,606 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-02-03 23:10:17,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-03 23:10:17,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-02-03 23:10:17,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-03 23:10:17,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2018-02-03 23:10:17,609 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 39 [2018-02-03 23:10:17,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:17,609 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2018-02-03 23:10:17,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 23:10:17,609 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2018-02-03 23:10:17,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-03 23:10:17,610 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:17,610 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:17,610 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:17,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1194268638, now seen corresponding path program 1 times [2018-02-03 23:10:17,610 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:17,610 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:17,611 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:17,611 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:17,611 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:17,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:18,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:18,135 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:18,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-03 23:10:18,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-03 23:10:18,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-03 23:10:18,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-02-03 23:10:18,136 INFO L87 Difference]: Start difference. First operand 128 states and 135 transitions. Second operand 19 states. [2018-02-03 23:10:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:18,737 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-02-03 23:10:18,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-03 23:10:18,737 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-02-03 23:10:18,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:18,738 INFO L225 Difference]: With dead ends: 138 [2018-02-03 23:10:18,738 INFO L226 Difference]: Without dead ends: 138 [2018-02-03 23:10:18,739 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-02-03 23:10:18,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-03 23:10:18,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 131. [2018-02-03 23:10:18,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-03 23:10:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-02-03 23:10:18,742 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 44 [2018-02-03 23:10:18,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:18,742 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-02-03 23:10:18,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-03 23:10:18,743 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-02-03 23:10:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-03 23:10:18,751 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:18,751 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:18,751 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:18,752 INFO L82 PathProgramCache]: Analyzing trace with hash -936632417, now seen corresponding path program 1 times [2018-02-03 23:10:18,752 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:18,752 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:18,753 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:18,753 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:18,753 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:18,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:19,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:19,629 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:10:19,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-03 23:10:19,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-03 23:10:19,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-03 23:10:19,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-02-03 23:10:19,630 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 22 states. [2018-02-03 23:10:20,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:20,620 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2018-02-03 23:10:20,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-03 23:10:20,621 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-02-03 23:10:20,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:20,621 INFO L225 Difference]: With dead ends: 137 [2018-02-03 23:10:20,621 INFO L226 Difference]: Without dead ends: 117 [2018-02-03 23:10:20,622 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=125, Invalid=1135, Unknown=0, NotChecked=0, Total=1260 [2018-02-03 23:10:20,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-03 23:10:20,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-02-03 23:10:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-03 23:10:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-02-03 23:10:20,625 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 46 [2018-02-03 23:10:20,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:20,625 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-02-03 23:10:20,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-03 23:10:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-02-03 23:10:20,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-03 23:10:20,625 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:20,626 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:20,626 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:20,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1548731934, now seen corresponding path program 1 times [2018-02-03 23:10:20,626 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:20,626 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:20,627 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:20,627 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:20,627 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:20,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:20,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:20,736 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:20,741 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:20,769 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:20,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:10:20,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:10:20,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:20,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:20,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:20,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-02-03 23:10:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:20,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:10:20,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 17 [2018-02-03 23:10:20,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-03 23:10:20,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-03 23:10:20,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-02-03 23:10:20,888 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 17 states. [2018-02-03 23:10:21,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:21,188 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-02-03 23:10:21,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-03 23:10:21,188 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-02-03 23:10:21,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:21,189 INFO L225 Difference]: With dead ends: 95 [2018-02-03 23:10:21,189 INFO L226 Difference]: Without dead ends: 95 [2018-02-03 23:10:21,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2018-02-03 23:10:21,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-03 23:10:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-03 23:10:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-03 23:10:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-02-03 23:10:21,191 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 53 [2018-02-03 23:10:21,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:21,191 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-02-03 23:10:21,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-03 23:10:21,191 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-02-03 23:10:21,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-03 23:10:21,192 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:21,192 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:21,192 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:21,192 INFO L82 PathProgramCache]: Analyzing trace with hash -2027547752, now seen corresponding path program 1 times [2018-02-03 23:10:21,192 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:21,192 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:21,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:21,193 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:21,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:21,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:21,954 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:21,954 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:21,959 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:21,986 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:21,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:10:21,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:21,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:21,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 23:10:22,095 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 13 treesize of output 10 [2018-02-03 23:10:22,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-03 23:10:22,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-02-03 23:10:22,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:10:22,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:10:22,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,157 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 19 treesize of output 43 [2018-02-03 23:10:22,159 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 28 treesize of output 27 [2018-02-03 23:10:22,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,171 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,176 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-02-03 23:10:22,201 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:22,201 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:22,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-03 23:10:22,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:44 [2018-02-03 23:10:22,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:10:22,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:10:22,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:135 [2018-02-03 23:10:22,689 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:22,690 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:22,690 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:22,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 29 [2018-02-03 23:10:22,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,700 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 80 treesize of output 72 [2018-02-03 23:10:22,702 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 72 treesize of output 64 [2018-02-03 23:10:22,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:22,708 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:22,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 75 [2018-02-03 23:10:22,723 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 29 treesize of output 36 [2018-02-03 23:10:22,725 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:22,725 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:10:22,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2018-02-03 23:10:22,726 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,730 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,741 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:10:22,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 87 [2018-02-03 23:10:22,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 60 treesize of output 51 [2018-02-03 23:10:22,744 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,750 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,754 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:22,761 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:178, output treesize:78 [2018-02-03 23:10:22,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-02-03 23:10:22,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2018-02-03 23:10:22,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:22,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:60 [2018-02-03 23:10:22,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-02-03 23:10:22,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:22,902 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:10:22,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2018-02-03 23:10:22,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-03 23:10:22,913 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-03 23:10:22,918 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:22,924 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:3 [2018-02-03 23:10:22,941 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:22,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:10:22,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 41 [2018-02-03 23:10:22,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-03 23:10:22,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-03 23:10:22,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1586, Unknown=0, NotChecked=0, Total=1722 [2018-02-03 23:10:22,970 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 42 states. [2018-02-03 23:10:25,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:25,373 INFO L93 Difference]: Finished difference Result 153 states and 160 transitions. [2018-02-03 23:10:25,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-03 23:10:25,373 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 54 [2018-02-03 23:10:25,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:25,374 INFO L225 Difference]: With dead ends: 153 [2018-02-03 23:10:25,374 INFO L226 Difference]: Without dead ends: 153 [2018-02-03 23:10:25,375 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2285 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=612, Invalid=6698, Unknown=0, NotChecked=0, Total=7310 [2018-02-03 23:10:25,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-03 23:10:25,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 94. [2018-02-03 23:10:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-03 23:10:25,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2018-02-03 23:10:25,378 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 54 [2018-02-03 23:10:25,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:25,378 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-02-03 23:10:25,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-03 23:10:25,378 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-02-03 23:10:25,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-03 23:10:25,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:25,379 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:25,379 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:25,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2027547751, now seen corresponding path program 1 times [2018-02-03 23:10:25,379 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:25,379 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:25,380 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:25,380 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:25,380 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:25,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:26,418 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:26,418 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:26,423 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:26,445 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:26,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:10:26,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:26,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:26,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 23:10:26,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:10:26,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:26,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:26,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-02-03 23:10:26,571 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 13 treesize of output 10 [2018-02-03 23:10:26,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-03 23:10:26,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:26,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:26,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:26,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-02-03 23:10:26,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:10:26,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:10:26,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:26,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:26,631 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 21 treesize of output 33 [2018-02-03 23:10:26,634 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 22 treesize of output 21 [2018-02-03 23:10:26,634 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:26,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:26,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:26,655 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:44 [2018-02-03 23:10:26,684 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:26,684 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:26,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-03 23:10:26,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:26,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:26,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:46 [2018-02-03 23:10:27,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:10:27,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:10:27,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:27,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:27,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:27,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:112 [2018-02-03 23:10:27,295 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:27,296 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:27,297 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:27,298 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:27,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 71 [2018-02-03 23:10:27,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:27,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-02-03 23:10:27,318 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 44 treesize of output 40 [2018-02-03 23:10:27,318 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:27,321 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:27,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 86 [2018-02-03 23:10:27,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-02-03 23:10:27,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-02-03 23:10:27,344 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:27,351 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:27,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:27,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:27,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 87 [2018-02-03 23:10:27,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2018-02-03 23:10:27,367 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:27,375 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:27,381 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:27,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:27,392 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:157, output treesize:128 [2018-02-03 23:10:27,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-03 23:10:27,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-03 23:10:27,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:27,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:27,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:27,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:137, output treesize:126 [2018-02-03 23:10:27,559 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:27,560 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:27,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 76 [2018-02-03 23:10:27,565 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2018-02-03 23:10:27,566 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-03 23:10:27,592 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 42 treesize of output 35 [2018-02-03 23:10:27,593 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:27,594 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 36 treesize of output 29 [2018-02-03 23:10:27,594 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:27,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 52 [2018-02-03 23:10:27,619 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-02-03 23:10:27,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 32 [2018-02-03 23:10:27,624 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:27,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts. [2018-02-03 23:10:27,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 5 xjuncts. [2018-02-03 23:10:27,690 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:127, output treesize:177 [2018-02-03 23:10:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:27,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:10:27,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 47 [2018-02-03 23:10:27,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-03 23:10:27,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-03 23:10:27,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2081, Unknown=1, NotChecked=0, Total=2256 [2018-02-03 23:10:27,815 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 48 states. [2018-02-03 23:10:28,925 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 109 DAG size of output 83 [2018-02-03 23:10:31,236 WARN L146 SmtUtils]: Spent 2146ms on a formula simplification. DAG size of input: 77 DAG size of output 60 [2018-02-03 23:10:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:31,830 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-02-03 23:10:31,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-03 23:10:31,831 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 54 [2018-02-03 23:10:31,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:31,831 INFO L225 Difference]: With dead ends: 95 [2018-02-03 23:10:31,831 INFO L226 Difference]: Without dead ends: 95 [2018-02-03 23:10:31,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=414, Invalid=4415, Unknown=1, NotChecked=0, Total=4830 [2018-02-03 23:10:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-03 23:10:31,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-02-03 23:10:31,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-03 23:10:31,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2018-02-03 23:10:31,834 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 54 [2018-02-03 23:10:31,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:31,835 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2018-02-03 23:10:31,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-03 23:10:31,835 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-02-03 23:10:31,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-03 23:10:31,835 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:31,835 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:31,835 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:31,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1441763225, now seen corresponding path program 1 times [2018-02-03 23:10:31,836 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:31,836 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:31,836 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:31,836 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:31,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:31,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:32,523 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:32,523 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:32,529 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:32,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:32,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:10:32,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 23:10:32,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:32,640 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:32,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:10:32,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-02-03 23:10:32,688 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 13 treesize of output 10 [2018-02-03 23:10:32,689 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 10 treesize of output 9 [2018-02-03 23:10:32,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-02-03 23:10:32,732 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 20 treesize of output 32 [2018-02-03 23:10:32,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 26 [2018-02-03 23:10:32,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 23:10:32,764 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 17 treesize of output 16 [2018-02-03 23:10:32,764 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:10:32,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:10:32,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:10:32,786 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,787 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:10:32,798 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:46, output treesize:72 [2018-02-03 23:10:32,838 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-03 23:10:32,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:32,847 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:32,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-03 23:10:32,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:32,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:45 [2018-02-03 23:10:33,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:10:33,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:10:33,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:33,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:117, output treesize:134 [2018-02-03 23:10:33,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:33,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:33,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:33,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-02-03 23:10:33,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2018-02-03 23:10:33,362 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 54 treesize of output 50 [2018-02-03 23:10:33,362 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,365 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 78 [2018-02-03 23:10:33,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-02-03 23:10:33,385 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:33,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 53 [2018-02-03 23:10:33,386 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,390 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,400 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:33,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 76 [2018-02-03 23:10:33,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-02-03 23:10:33,404 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,410 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,416 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,424 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:178, output treesize:110 [2018-02-03 23:10:33,617 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 111 treesize of output 95 [2018-02-03 23:10:33,618 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 95 treesize of output 76 [2018-02-03 23:10:33,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:123, output treesize:88 [2018-02-03 23:10:33,682 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:33,683 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:33,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 57 [2018-02-03 23:10:33,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:33,692 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 48 [2018-02-03 23:10:33,693 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:10:33,701 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 12 treesize of output 4 [2018-02-03 23:10:33,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,703 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 6 treesize of output 4 [2018-02-03 23:10:33,704 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,708 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:10 [2018-02-03 23:10:33,737 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:33,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2018-02-03 23:10:33,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:33,744 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 3 xjuncts. [2018-02-03 23:10:33,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2018-02-03 23:10:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:33,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:10:33,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30] total 49 [2018-02-03 23:10:33,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-03 23:10:33,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-03 23:10:33,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2283, Unknown=1, NotChecked=0, Total=2450 [2018-02-03 23:10:33,823 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 50 states. [2018-02-03 23:10:36,079 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 85 DAG size of output 72 [2018-02-03 23:10:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:37,460 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2018-02-03 23:10:37,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-03 23:10:37,460 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 56 [2018-02-03 23:10:37,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:37,461 INFO L225 Difference]: With dead ends: 150 [2018-02-03 23:10:37,461 INFO L226 Difference]: Without dead ends: 150 [2018-02-03 23:10:37,462 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2007 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=606, Invalid=6364, Unknown=2, NotChecked=0, Total=6972 [2018-02-03 23:10:37,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-03 23:10:37,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 107. [2018-02-03 23:10:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-03 23:10:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-02-03 23:10:37,465 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 56 [2018-02-03 23:10:37,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:37,465 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-02-03 23:10:37,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-03 23:10:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-02-03 23:10:37,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-03 23:10:37,467 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:37,467 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:37,467 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:37,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1744987036, now seen corresponding path program 1 times [2018-02-03 23:10:37,467 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:37,467 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:37,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:37,468 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:37,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:37,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:38,232 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:38,232 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:38,237 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:38,265 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:38,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:10:38,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:38,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:38,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 23:10:38,418 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 13 treesize of output 10 [2018-02-03 23:10:38,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-03 23:10:38,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:38,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:38,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:38,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2018-02-03 23:10:38,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:10:38,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:10:38,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:38,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:38,473 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 25 treesize of output 37 [2018-02-03 23:10:38,475 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 26 treesize of output 25 [2018-02-03 23:10:38,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:38,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 23 treesize of output 31 [2018-02-03 23:10:38,490 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-03 23:10:38,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-03 23:10:38,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-03 23:10:38,509 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:41, output treesize:71 [2018-02-03 23:10:38,553 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:38,554 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:38,554 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 46 treesize of output 53 [2018-02-03 23:10:38,558 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 35 treesize of output 36 [2018-02-03 23:10:38,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:38,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:38,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:38,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:87, output treesize:46 [2018-02-03 23:10:38,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:10:38,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:10:38,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:38,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:38,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:38,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:106 [2018-02-03 23:10:39,102 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:39,103 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:39,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:39,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:39,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2018-02-03 23:10:39,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:39,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 72 [2018-02-03 23:10:39,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-02-03 23:10:39,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-03 23:10:39,125 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:39,128 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:39,136 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:39,137 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:39,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 75 [2018-02-03 23:10:39,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-02-03 23:10:39,140 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:39,146 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:39,150 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:39,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-02-03 23:10:39,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-02-03 23:10:39,161 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:39,163 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:39,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:39,169 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:151, output treesize:84 [2018-02-03 23:10:39,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-03 23:10:39,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-02-03 23:10:39,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:39,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:39,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:39,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:107, output treesize:96 [2018-02-03 23:10:39,408 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:39,409 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:39,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 143 [2018-02-03 23:10:39,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:39,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:10:39,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:317, output treesize:181 [2018-02-03 23:10:39,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:39,486 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:39,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 62 [2018-02-03 23:10:39,498 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 42 [2018-02-03 23:10:39,499 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:10:39,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-02-03 23:10:39,507 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:39,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-02-03 23:10:39,511 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:39,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:39,524 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:39,525 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:39,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 56 [2018-02-03 23:10:39,536 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 42 [2018-02-03 23:10:39,537 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-03 23:10:39,548 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 19 treesize of output 10 [2018-02-03 23:10:39,548 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:39,553 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 7 treesize of output 5 [2018-02-03 23:10:39,553 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:39,556 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:39,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-03 23:10:39,573 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:181, output treesize:22 [2018-02-03 23:10:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:39,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:10:39,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 51 [2018-02-03 23:10:39,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-03 23:10:39,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-03 23:10:39,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2496, Unknown=1, NotChecked=0, Total=2652 [2018-02-03 23:10:39,684 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 52 states. [2018-02-03 23:10:47,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:47,148 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-02-03 23:10:47,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-03 23:10:47,148 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 57 [2018-02-03 23:10:47,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:47,149 INFO L225 Difference]: With dead ends: 128 [2018-02-03 23:10:47,149 INFO L226 Difference]: Without dead ends: 128 [2018-02-03 23:10:47,150 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1556 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=469, Invalid=5848, Unknown=3, NotChecked=0, Total=6320 [2018-02-03 23:10:47,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-03 23:10:47,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 106. [2018-02-03 23:10:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-03 23:10:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2018-02-03 23:10:47,151 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 57 [2018-02-03 23:10:47,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:47,151 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2018-02-03 23:10:47,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-03 23:10:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-02-03 23:10:47,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-03 23:10:47,152 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:47,152 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:47,152 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:47,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1895295932, now seen corresponding path program 1 times [2018-02-03 23:10:47,152 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:47,152 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:47,153 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:47,153 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:47,153 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:47,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:47,246 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:47,246 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:47,251 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:47,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:47,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:10:47,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:10:47,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:47,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:47,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:47,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-02-03 23:10:47,314 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:47,315 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:47,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-03 23:10:47,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:47,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:47,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-02-03 23:10:47,329 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 24 treesize of output 18 [2018-02-03 23:10:47,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-02-03 23:10:47,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:47,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:47,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:47,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2018-02-03 23:10:47,342 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:47,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-03 23:10:47,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:47,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:47,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-03 23:10:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:47,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:10:47,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 15 [2018-02-03 23:10:47,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-03 23:10:47,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-03 23:10:47,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-02-03 23:10:47,400 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand 16 states. [2018-02-03 23:10:47,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:10:47,642 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2018-02-03 23:10:47,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-03 23:10:47,642 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-02-03 23:10:47,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:10:47,643 INFO L225 Difference]: With dead ends: 127 [2018-02-03 23:10:47,643 INFO L226 Difference]: Without dead ends: 127 [2018-02-03 23:10:47,644 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2018-02-03 23:10:47,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-03 23:10:47,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 105. [2018-02-03 23:10:47,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-03 23:10:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-02-03 23:10:47,646 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 59 [2018-02-03 23:10:47,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:10:47,646 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-02-03 23:10:47,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-03 23:10:47,646 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-02-03 23:10:47,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-03 23:10:47,646 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:10:47,647 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:10:47,647 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-03 23:10:47,647 INFO L82 PathProgramCache]: Analyzing trace with hash -689631826, now seen corresponding path program 1 times [2018-02-03 23:10:47,647 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:10:47,647 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:10:47,648 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:47,648 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:47,648 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:10:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:47,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:10:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:10:49,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:10:49,039 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:10:49,044 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:10:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:10:49,075 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:10:49,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:10:49,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:49,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:49,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 23:10:49,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:49,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:49,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:10:49,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:49,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:49,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-02-03 23:10:49,264 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 13 treesize of output 10 [2018-02-03 23:10:49,265 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 10 treesize of output 9 [2018-02-03 23:10:49,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:49,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:49,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:49,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-02-03 23:10:49,318 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 20 treesize of output 32 [2018-02-03 23:10:49,320 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 21 treesize of output 20 [2018-02-03 23:10:49,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:49,335 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 2 case distinctions, treesize of input 18 treesize of output 26 [2018-02-03 23:10:49,335 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 23:10:49,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:10:49,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:10:49,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:10:49,356 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:49,357 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:49,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:10:49,367 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:41, output treesize:71 [2018-02-03 23:10:49,411 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-03 23:10:49,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:49,418 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:49,418 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:49,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-03 23:10:49,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:49,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:10:49,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:44 [2018-02-03 23:10:51,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:51,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:51,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-03 23:10:51,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:51,724 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:10:51,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 107 [2018-02-03 23:10:51,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2018-02-03 23:10:51,732 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:10:51,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 71 [2018-02-03 23:10:51,744 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 20 treesize of output 12 [2018-02-03 23:10:51,744 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:10:51,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:51,753 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:10:51,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 95 [2018-02-03 23:10:51,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-02-03 23:10:51,758 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_13 term size 11 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-03 23:10:51,761 INFO L168 Benchmark]: Toolchain (without parser) took 44315.42 ms. Allocated memory was 398.5 MB in the beginning and 1.1 GB in the end (delta: 655.9 MB). Free memory was 355.3 MB in the beginning and 616.9 MB in the end (delta: -261.5 MB). Peak memory consumption was 394.4 MB. Max. memory is 5.3 GB. [2018-02-03 23:10:51,761 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 398.5 MB. Free memory is still 361.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 23:10:51,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.66 ms. Allocated memory is still 398.5 MB. Free memory was 355.3 MB in the beginning and 344.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-03 23:10:51,762 INFO L168 Benchmark]: Boogie Preprocessor took 24.62 ms. Allocated memory is still 398.5 MB. Free memory was 344.8 MB in the beginning and 343.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-03 23:10:51,762 INFO L168 Benchmark]: RCFGBuilder took 365.79 ms. Allocated memory is still 398.5 MB. Free memory was 343.4 MB in the beginning and 310.9 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. [2018-02-03 23:10:51,762 INFO L168 Benchmark]: TraceAbstraction took 43778.81 ms. Allocated memory was 398.5 MB in the beginning and 1.1 GB in the end (delta: 655.9 MB). Free memory was 310.9 MB in the beginning and 616.9 MB in the end (delta: -306.0 MB). Peak memory consumption was 349.9 MB. Max. memory is 5.3 GB. [2018-02-03 23:10:51,763 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.10 ms. Allocated memory is still 398.5 MB. Free memory is still 361.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 143.66 ms. Allocated memory is still 398.5 MB. Free memory was 355.3 MB in the beginning and 344.8 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.62 ms. Allocated memory is still 398.5 MB. Free memory was 344.8 MB in the beginning and 343.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 365.79 ms. Allocated memory is still 398.5 MB. Free memory was 343.4 MB in the beginning and 310.9 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 43778.81 ms. Allocated memory was 398.5 MB in the beginning and 1.1 GB in the end (delta: 655.9 MB). Free memory was 310.9 MB in the beginning and 616.9 MB in the end (delta: -306.0 MB). Peak memory consumption was 349.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_13 term size 11 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_13 term size 11: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_23-10-51-766.csv Received shutdown request...