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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:05:32,287 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:05:32,289 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:05:32,301 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:05:32,301 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:05:32,302 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:05:32,303 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:05:32,304 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:05:32,306 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:05:32,307 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:05:32,307 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:05:32,307 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:05:32,308 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:05:32,309 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:05:32,310 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:05:32,311 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:05:32,313 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:05:32,314 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:05:32,315 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:05:32,316 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:05:32,318 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:05:32,318 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:05:32,318 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:05:32,319 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:05:32,320 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:05:32,321 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:05:32,321 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:05:32,322 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:05:32,322 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:05:32,322 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:05:32,322 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:05:32,323 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 09:05:32,332 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:05:32,332 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:05:32,333 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:05:32,333 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:05:32,333 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:05:32,333 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:05:32,333 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:05:32,334 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:05:32,334 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:05:32,334 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:05:32,334 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:05:32,334 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:05:32,334 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:05:32,334 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:05:32,334 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:05:32,334 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:05:32,334 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:05:32,335 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:05:32,335 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:05:32,335 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:05:32,335 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:05:32,335 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:05:32,335 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 09:05:32,335 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 09:05:32,335 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 09:05:32,362 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:05:32,369 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:05:32,372 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:05:32,373 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:05:32,373 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:05:32,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-02-02 09:05:32,504 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:05:32,505 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:05:32,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:05:32,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:05:32,510 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:05:32,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:05:32" (1/1) ... [2018-02-02 09:05:32,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@679e69c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:32, skipping insertion in model container [2018-02-02 09:05:32,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:05:32" (1/1) ... [2018-02-02 09:05:32,522 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:05:32,550 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:05:32,642 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:05:32,662 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:05:32,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:32 WrapperNode [2018-02-02 09:05:32,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:05:32,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:05:32,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:05:32,668 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:05:32,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:32" (1/1) ... [2018-02-02 09:05:32,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:32" (1/1) ... [2018-02-02 09:05:32,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:32" (1/1) ... [2018-02-02 09:05:32,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:32" (1/1) ... [2018-02-02 09:05:32,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:32" (1/1) ... [2018-02-02 09:05:32,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:32" (1/1) ... [2018-02-02 09:05:32,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:32" (1/1) ... [2018-02-02 09:05:32,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:05:32,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:05:32,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:05:32,696 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:05:32,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:32" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:05:32,729 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:05:32,730 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:05:32,730 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:05:32,730 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 09:05:32,730 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 09:05:32,730 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:05:32,730 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:05:32,730 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:05:32,730 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:05:32,730 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 09:05:32,730 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 09:05:32,731 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:05:32,731 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:05:32,731 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:05:33,152 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:05:33,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:05:33 BoogieIcfgContainer [2018-02-02 09:05:33,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:05:33,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:05:33,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:05:33,155 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:05:33,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:05:32" (1/3) ... [2018-02-02 09:05:33,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b16446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:05:33, skipping insertion in model container [2018-02-02 09:05:33,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:05:32" (2/3) ... [2018-02-02 09:05:33,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b16446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:05:33, skipping insertion in model container [2018-02-02 09:05:33,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:05:33" (3/3) ... [2018-02-02 09:05:33,158 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-02-02 09:05:33,164 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:05:33,170 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 75 error locations. [2018-02-02 09:05:33,194 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:05:33,194 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:05:33,195 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 09:05:33,195 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 09:05:33,195 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:05:33,195 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:05:33,195 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:05:33,195 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:05:33,196 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:05:33,207 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2018-02-02 09:05:33,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 09:05:33,214 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:33,215 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:05:33,215 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:33,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1759036932, now seen corresponding path program 1 times [2018-02-02 09:05:33,220 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:33,220 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:33,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:33,251 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:33,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:33,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:33,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:33,327 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:33,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:05:33,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:05:33,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:05:33,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:05:33,338 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 4 states. [2018-02-02 09:05:33,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:33,589 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2018-02-02 09:05:33,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:05:33,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 09:05:33,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:33,597 INFO L225 Difference]: With dead ends: 178 [2018-02-02 09:05:33,597 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 09:05:33,599 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-02 09:05:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 09:05:33,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2018-02-02 09:05:33,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 09:05:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 168 transitions. [2018-02-02 09:05:33,633 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 168 transitions. Word has length 8 [2018-02-02 09:05:33,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:33,634 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 168 transitions. [2018-02-02 09:05:33,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:05:33,634 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2018-02-02 09:05:33,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 09:05:33,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:33,634 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:05:33,635 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:33,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1759036931, now seen corresponding path program 1 times [2018-02-02 09:05:33,635 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:33,635 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:33,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:33,636 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:33,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:33,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:33,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:33,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:05:33,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:05:33,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:05:33,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:05:33,705 INFO L87 Difference]: Start difference. First operand 158 states and 168 transitions. Second operand 4 states. [2018-02-02 09:05:33,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:33,834 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2018-02-02 09:05:33,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:05:33,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 09:05:33,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:33,836 INFO L225 Difference]: With dead ends: 155 [2018-02-02 09:05:33,836 INFO L226 Difference]: Without dead ends: 155 [2018-02-02 09:05:33,836 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-02 09:05:33,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-02 09:05:33,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-02-02 09:05:33,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 09:05:33,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2018-02-02 09:05:33,843 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 8 [2018-02-02 09:05:33,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:33,843 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2018-02-02 09:05:33,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:05:33,843 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2018-02-02 09:05:33,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 09:05:33,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:33,844 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:05:33,844 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:33,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2080332291, now seen corresponding path program 1 times [2018-02-02 09:05:33,845 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:33,846 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:33,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:33,847 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:33,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:33,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:33,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:33,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:05:33,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:05:33,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:05:33,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:05:33,884 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 4 states. [2018-02-02 09:05:34,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:34,008 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2018-02-02 09:05:34,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:05:34,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 09:05:34,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:34,012 INFO L225 Difference]: With dead ends: 161 [2018-02-02 09:05:34,012 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 09:05:34,012 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-02 09:05:34,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 09:05:34,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 140. [2018-02-02 09:05:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 09:05:34,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2018-02-02 09:05:34,016 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 15 [2018-02-02 09:05:34,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:34,017 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2018-02-02 09:05:34,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:05:34,017 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2018-02-02 09:05:34,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 09:05:34,017 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:34,017 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:05:34,017 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:34,017 INFO L82 PathProgramCache]: Analyzing trace with hash -2080332290, now seen corresponding path program 1 times [2018-02-02 09:05:34,017 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:34,017 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:34,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:34,018 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:34,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:34,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:34,077 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:34,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:05:34,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:05:34,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:05:34,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:05:34,078 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand 5 states. [2018-02-02 09:05:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:34,237 INFO L93 Difference]: Finished difference Result 196 states and 214 transitions. [2018-02-02 09:05:34,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:05:34,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 09:05:34,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:34,239 INFO L225 Difference]: With dead ends: 196 [2018-02-02 09:05:34,239 INFO L226 Difference]: Without dead ends: 196 [2018-02-02 09:05:34,239 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:05:34,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-02 09:05:34,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 176. [2018-02-02 09:05:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 09:05:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 203 transitions. [2018-02-02 09:05:34,247 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 203 transitions. Word has length 15 [2018-02-02 09:05:34,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:34,247 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 203 transitions. [2018-02-02 09:05:34,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:05:34,247 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 203 transitions. [2018-02-02 09:05:34,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:05:34,247 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:34,247 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:05:34,248 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:34,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2037600517, now seen corresponding path program 1 times [2018-02-02 09:05:34,248 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:34,248 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:34,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:34,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:34,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:34,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:34,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:34,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:34,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:05:34,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:05:34,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:05:34,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:05:34,277 INFO L87 Difference]: Start difference. First operand 176 states and 203 transitions. Second operand 4 states. [2018-02-02 09:05:34,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:34,365 INFO L93 Difference]: Finished difference Result 189 states and 216 transitions. [2018-02-02 09:05:34,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:05:34,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 09:05:34,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:34,366 INFO L225 Difference]: With dead ends: 189 [2018-02-02 09:05:34,367 INFO L226 Difference]: Without dead ends: 189 [2018-02-02 09:05:34,367 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-02 09:05:34,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-02 09:05:34,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 177. [2018-02-02 09:05:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-02 09:05:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 206 transitions. [2018-02-02 09:05:34,373 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 206 transitions. Word has length 17 [2018-02-02 09:05:34,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:34,373 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 206 transitions. [2018-02-02 09:05:34,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:05:34,373 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 206 transitions. [2018-02-02 09:05:34,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:05:34,374 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:34,374 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:05:34,374 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:34,374 INFO L82 PathProgramCache]: Analyzing trace with hash -2037600516, now seen corresponding path program 1 times [2018-02-02 09:05:34,374 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:34,374 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:34,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:34,375 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:34,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:34,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:34,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:34,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:34,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:05:34,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:05:34,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:05:34,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:05:34,420 INFO L87 Difference]: Start difference. First operand 177 states and 206 transitions. Second operand 4 states. [2018-02-02 09:05:34,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:34,518 INFO L93 Difference]: Finished difference Result 179 states and 206 transitions. [2018-02-02 09:05:34,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:05:34,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 09:05:34,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:34,519 INFO L225 Difference]: With dead ends: 179 [2018-02-02 09:05:34,519 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 09:05:34,520 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-02 09:05:34,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 09:05:34,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2018-02-02 09:05:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 09:05:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 203 transitions. [2018-02-02 09:05:34,523 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 203 transitions. Word has length 17 [2018-02-02 09:05:34,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:34,523 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 203 transitions. [2018-02-02 09:05:34,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:05:34,523 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 203 transitions. [2018-02-02 09:05:34,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:05:34,523 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:34,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] [2018-02-02 09:05:34,524 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:34,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1339674347, now seen corresponding path program 1 times [2018-02-02 09:05:34,524 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:34,524 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:34,524 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:34,525 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:34,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:34,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:34,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:34,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:05:34,558 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:05:34,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:05:34,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:05:34,558 INFO L87 Difference]: Start difference. First operand 175 states and 203 transitions. Second operand 4 states. [2018-02-02 09:05:34,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:34,574 INFO L93 Difference]: Finished difference Result 176 states and 203 transitions. [2018-02-02 09:05:34,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:05:34,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-02 09:05:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:34,575 INFO L225 Difference]: With dead ends: 176 [2018-02-02 09:05:34,575 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 09:05:34,575 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02 09:05:34,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 09:05:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-02-02 09:05:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 09:05:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 202 transitions. [2018-02-02 09:05:34,579 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 202 transitions. Word has length 22 [2018-02-02 09:05:34,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:34,579 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 202 transitions. [2018-02-02 09:05:34,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:05:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 202 transitions. [2018-02-02 09:05:34,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:05:34,580 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:34,580 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] [2018-02-02 09:05:34,581 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:34,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1419766941, now seen corresponding path program 1 times [2018-02-02 09:05:34,581 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:34,581 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:34,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:34,582 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:34,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:34,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:34,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:34,618 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:34,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:05:34,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:05:34,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:05:34,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:05:34,619 INFO L87 Difference]: Start difference. First operand 175 states and 202 transitions. Second operand 4 states. [2018-02-02 09:05:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:34,708 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2018-02-02 09:05:34,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:05:34,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-02 09:05:34,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:34,709 INFO L225 Difference]: With dead ends: 190 [2018-02-02 09:05:34,709 INFO L226 Difference]: Without dead ends: 190 [2018-02-02 09:05:34,709 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-02 09:05:34,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-02 09:05:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 174. [2018-02-02 09:05:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 09:05:34,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 202 transitions. [2018-02-02 09:05:34,712 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 202 transitions. Word has length 23 [2018-02-02 09:05:34,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:34,713 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 202 transitions. [2018-02-02 09:05:34,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:05:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2018-02-02 09:05:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:05:34,713 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:34,713 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] [2018-02-02 09:05:34,714 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:34,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1419766940, now seen corresponding path program 1 times [2018-02-02 09:05:34,714 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:34,714 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:34,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:34,715 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:34,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:34,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:34,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:34,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:34,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:05:34,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:05:34,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:05:34,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:05:34,769 INFO L87 Difference]: Start difference. First operand 174 states and 202 transitions. Second operand 5 states. [2018-02-02 09:05:34,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:34,901 INFO L93 Difference]: Finished difference Result 194 states and 223 transitions. [2018-02-02 09:05:34,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:05:34,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 09:05:34,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:34,902 INFO L225 Difference]: With dead ends: 194 [2018-02-02 09:05:34,902 INFO L226 Difference]: Without dead ends: 194 [2018-02-02 09:05:34,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:05:34,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-02 09:05:34,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2018-02-02 09:05:34,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 09:05:34,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 203 transitions. [2018-02-02 09:05:34,905 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 203 transitions. Word has length 23 [2018-02-02 09:05:34,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:34,905 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 203 transitions. [2018-02-02 09:05:34,905 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:05:34,905 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 203 transitions. [2018-02-02 09:05:34,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:05:34,906 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:34,906 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:05:34,906 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:34,906 INFO L82 PathProgramCache]: Analyzing trace with hash 916114990, now seen corresponding path program 1 times [2018-02-02 09:05:34,906 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:34,906 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:34,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:34,907 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:34,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:34,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:34,927 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:34,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:05:34,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:05:34,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:05:34,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:05:34,928 INFO L87 Difference]: Start difference. First operand 176 states and 203 transitions. Second operand 3 states. [2018-02-02 09:05:34,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:34,932 INFO L93 Difference]: Finished difference Result 178 states and 205 transitions. [2018-02-02 09:05:34,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:05:34,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-02-02 09:05:34,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:34,933 INFO L225 Difference]: With dead ends: 178 [2018-02-02 09:05:34,933 INFO L226 Difference]: Without dead ends: 178 [2018-02-02 09:05:34,933 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:05:34,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-02 09:05:34,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-02-02 09:05:34,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 09:05:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 205 transitions. [2018-02-02 09:05:34,937 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 205 transitions. Word has length 23 [2018-02-02 09:05:34,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:34,937 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 205 transitions. [2018-02-02 09:05:34,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:05:34,937 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 205 transitions. [2018-02-02 09:05:34,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 09:05:34,937 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:34,937 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:05:34,938 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:34,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1108120181, now seen corresponding path program 1 times [2018-02-02 09:05:34,938 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:34,938 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:34,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:34,938 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:34,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:34,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:35,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:35,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:05:35,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:05:35,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:05:35,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:05:35,073 INFO L87 Difference]: Start difference. First operand 178 states and 205 transitions. Second operand 6 states. [2018-02-02 09:05:35,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:35,275 INFO L93 Difference]: Finished difference Result 221 states and 254 transitions. [2018-02-02 09:05:35,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:05:35,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 09:05:35,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:35,277 INFO L225 Difference]: With dead ends: 221 [2018-02-02 09:05:35,277 INFO L226 Difference]: Without dead ends: 221 [2018-02-02 09:05:35,277 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:05:35,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-02 09:05:35,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 194. [2018-02-02 09:05:35,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 09:05:35,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 226 transitions. [2018-02-02 09:05:35,281 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 226 transitions. Word has length 25 [2018-02-02 09:05:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:35,281 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 226 transitions. [2018-02-02 09:05:35,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:05:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 226 transitions. [2018-02-02 09:05:35,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:05:35,282 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:35,282 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] [2018-02-02 09:05:35,284 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:35,284 INFO L82 PathProgramCache]: Analyzing trace with hash 561139669, now seen corresponding path program 1 times [2018-02-02 09:05:35,284 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:35,284 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:35,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:35,285 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:35,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:35,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:35,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:35,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 09:05:35,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:05:35,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:05:35,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:05:35,506 INFO L87 Difference]: Start difference. First operand 194 states and 226 transitions. Second operand 12 states. [2018-02-02 09:05:36,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:36,011 INFO L93 Difference]: Finished difference Result 210 states and 245 transitions. [2018-02-02 09:05:36,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:05:36,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-02-02 09:05:36,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:36,012 INFO L225 Difference]: With dead ends: 210 [2018-02-02 09:05:36,012 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 09:05:36,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:05:36,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 09:05:36,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 195. [2018-02-02 09:05:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 09:05:36,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 228 transitions. [2018-02-02 09:05:36,017 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 228 transitions. Word has length 26 [2018-02-02 09:05:36,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:36,017 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 228 transitions. [2018-02-02 09:05:36,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:05:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 228 transitions. [2018-02-02 09:05:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:05:36,018 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:36,018 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] [2018-02-02 09:05:36,018 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:36,018 INFO L82 PathProgramCache]: Analyzing trace with hash 561139670, now seen corresponding path program 1 times [2018-02-02 09:05:36,019 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:36,019 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:36,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:36,020 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:36,020 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:36,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:36,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:36,257 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:36,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 09:05:36,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:05:36,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:05:36,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:05:36,258 INFO L87 Difference]: Start difference. First operand 195 states and 228 transitions. Second operand 13 states. [2018-02-02 09:05:36,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:36,809 INFO L93 Difference]: Finished difference Result 263 states and 291 transitions. [2018-02-02 09:05:36,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 09:05:36,809 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-02-02 09:05:36,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:36,810 INFO L225 Difference]: With dead ends: 263 [2018-02-02 09:05:36,810 INFO L226 Difference]: Without dead ends: 263 [2018-02-02 09:05:36,811 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:05:36,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-02 09:05:36,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 199. [2018-02-02 09:05:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 09:05:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 233 transitions. [2018-02-02 09:05:36,813 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 233 transitions. Word has length 26 [2018-02-02 09:05:36,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:36,813 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 233 transitions. [2018-02-02 09:05:36,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:05:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 233 transitions. [2018-02-02 09:05:36,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:05:36,814 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:36,814 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] [2018-02-02 09:05:36,814 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:36,814 INFO L82 PathProgramCache]: Analyzing trace with hash -106162311, now seen corresponding path program 1 times [2018-02-02 09:05:36,814 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:36,814 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:36,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:36,815 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:36,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:36,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:36,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:36,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:05:36,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:05:36,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:05:36,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:05:36,870 INFO L87 Difference]: Start difference. First operand 199 states and 233 transitions. Second operand 5 states. [2018-02-02 09:05:37,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:37,004 INFO L93 Difference]: Finished difference Result 292 states and 344 transitions. [2018-02-02 09:05:37,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:05:37,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-02 09:05:37,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:37,006 INFO L225 Difference]: With dead ends: 292 [2018-02-02 09:05:37,006 INFO L226 Difference]: Without dead ends: 292 [2018-02-02 09:05:37,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:05:37,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-02 09:05:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 198. [2018-02-02 09:05:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-02 09:05:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 231 transitions. [2018-02-02 09:05:37,009 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 231 transitions. Word has length 26 [2018-02-02 09:05:37,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:37,010 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 231 transitions. [2018-02-02 09:05:37,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:05:37,010 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 231 transitions. [2018-02-02 09:05:37,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:05:37,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:37,010 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] [2018-02-02 09:05:37,010 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:37,010 INFO L82 PathProgramCache]: Analyzing trace with hash -106162310, now seen corresponding path program 1 times [2018-02-02 09:05:37,011 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:37,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:37,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:37,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:37,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:37,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:37,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:37,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:05:37,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:05:37,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:05:37,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:05:37,071 INFO L87 Difference]: Start difference. First operand 198 states and 231 transitions. Second operand 5 states. [2018-02-02 09:05:37,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:37,264 INFO L93 Difference]: Finished difference Result 281 states and 332 transitions. [2018-02-02 09:05:37,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:05:37,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-02 09:05:37,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:37,266 INFO L225 Difference]: With dead ends: 281 [2018-02-02 09:05:37,266 INFO L226 Difference]: Without dead ends: 281 [2018-02-02 09:05:37,266 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:05:37,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-02-02 09:05:37,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 197. [2018-02-02 09:05:37,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 09:05:37,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 229 transitions. [2018-02-02 09:05:37,272 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 229 transitions. Word has length 26 [2018-02-02 09:05:37,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:37,273 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 229 transitions. [2018-02-02 09:05:37,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:05:37,273 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 229 transitions. [2018-02-02 09:05:37,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 09:05:37,273 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:37,273 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] [2018-02-02 09:05:37,273 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:37,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1585416537, now seen corresponding path program 1 times [2018-02-02 09:05:37,274 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:37,274 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:37,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:37,275 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:37,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:37,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:37,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:37,349 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:37,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:05:37,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:05:37,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:05:37,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:05:37,350 INFO L87 Difference]: Start difference. First operand 197 states and 229 transitions. Second operand 9 states. [2018-02-02 09:05:37,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:37,635 INFO L93 Difference]: Finished difference Result 243 states and 284 transitions. [2018-02-02 09:05:37,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:05:37,635 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-02-02 09:05:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:37,636 INFO L225 Difference]: With dead ends: 243 [2018-02-02 09:05:37,636 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 09:05:37,637 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:05:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 09:05:37,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 196. [2018-02-02 09:05:37,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-02 09:05:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 227 transitions. [2018-02-02 09:05:37,640 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 227 transitions. Word has length 29 [2018-02-02 09:05:37,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:37,640 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 227 transitions. [2018-02-02 09:05:37,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:05:37,640 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 227 transitions. [2018-02-02 09:05:37,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 09:05:37,641 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:37,641 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] [2018-02-02 09:05:37,641 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:37,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1585416536, now seen corresponding path program 1 times [2018-02-02 09:05:37,641 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:37,641 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:37,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:37,642 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:37,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:37,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:37,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:37,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:37,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:05:37,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:05:37,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:05:37,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:05:37,770 INFO L87 Difference]: Start difference. First operand 196 states and 227 transitions. Second operand 9 states. [2018-02-02 09:05:38,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:38,197 INFO L93 Difference]: Finished difference Result 242 states and 282 transitions. [2018-02-02 09:05:38,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:05:38,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-02-02 09:05:38,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:38,198 INFO L225 Difference]: With dead ends: 242 [2018-02-02 09:05:38,198 INFO L226 Difference]: Without dead ends: 242 [2018-02-02 09:05:38,198 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:05:38,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-02 09:05:38,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 195. [2018-02-02 09:05:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 09:05:38,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 225 transitions. [2018-02-02 09:05:38,200 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 225 transitions. Word has length 29 [2018-02-02 09:05:38,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:38,200 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 225 transitions. [2018-02-02 09:05:38,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:05:38,201 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 225 transitions. [2018-02-02 09:05:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 09:05:38,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:38,201 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-02 09:05:38,201 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:38,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2109118679, now seen corresponding path program 1 times [2018-02-02 09:05:38,201 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:38,201 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:38,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:38,202 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:38,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:38,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:38,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:38,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:05:38,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:05:38,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:05:38,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:05:38,233 INFO L87 Difference]: Start difference. First operand 195 states and 225 transitions. Second operand 4 states. [2018-02-02 09:05:38,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:38,309 INFO L93 Difference]: Finished difference Result 211 states and 242 transitions. [2018-02-02 09:05:38,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:05:38,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-02-02 09:05:38,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:38,310 INFO L225 Difference]: With dead ends: 211 [2018-02-02 09:05:38,310 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 09:05:38,310 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-02 09:05:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 09:05:38,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-02-02 09:05:38,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 09:05:38,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 224 transitions. [2018-02-02 09:05:38,313 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 224 transitions. Word has length 30 [2018-02-02 09:05:38,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:38,313 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 224 transitions. [2018-02-02 09:05:38,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:05:38,313 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 224 transitions. [2018-02-02 09:05:38,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 09:05:38,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:38,313 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-02 09:05:38,313 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:38,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2109118680, now seen corresponding path program 1 times [2018-02-02 09:05:38,313 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:38,313 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:38,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:38,314 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:38,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:38,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:38,352 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:38,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:05:38,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:05:38,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:05:38,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:05:38,353 INFO L87 Difference]: Start difference. First operand 194 states and 224 transitions. Second operand 4 states. [2018-02-02 09:05:38,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:38,496 INFO L93 Difference]: Finished difference Result 239 states and 272 transitions. [2018-02-02 09:05:38,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:05:38,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-02-02 09:05:38,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:38,498 INFO L225 Difference]: With dead ends: 239 [2018-02-02 09:05:38,498 INFO L226 Difference]: Without dead ends: 239 [2018-02-02 09:05:38,498 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02 09:05:38,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-02 09:05:38,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 192. [2018-02-02 09:05:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 09:05:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 222 transitions. [2018-02-02 09:05:38,501 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 222 transitions. Word has length 30 [2018-02-02 09:05:38,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:38,501 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 222 transitions. [2018-02-02 09:05:38,501 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:05:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 222 transitions. [2018-02-02 09:05:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 09:05:38,502 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:38,502 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-02 09:05:38,502 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:38,502 INFO L82 PathProgramCache]: Analyzing trace with hash -160241763, now seen corresponding path program 1 times [2018-02-02 09:05:38,502 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:38,502 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:38,504 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:38,504 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:38,504 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:38,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:38,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:38,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:05:38,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:05:38,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:05:38,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:05:38,547 INFO L87 Difference]: Start difference. First operand 192 states and 222 transitions. Second operand 5 states. [2018-02-02 09:05:38,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:38,725 INFO L93 Difference]: Finished difference Result 283 states and 329 transitions. [2018-02-02 09:05:38,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:05:38,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-02 09:05:38,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:38,727 INFO L225 Difference]: With dead ends: 283 [2018-02-02 09:05:38,727 INFO L226 Difference]: Without dead ends: 283 [2018-02-02 09:05:38,727 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:05:38,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-02 09:05:38,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 191. [2018-02-02 09:05:38,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 09:05:38,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 220 transitions. [2018-02-02 09:05:38,730 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 220 transitions. Word has length 30 [2018-02-02 09:05:38,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:38,730 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 220 transitions. [2018-02-02 09:05:38,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:05:38,731 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 220 transitions. [2018-02-02 09:05:38,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 09:05:38,731 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:38,731 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-02 09:05:38,731 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:38,732 INFO L82 PathProgramCache]: Analyzing trace with hash -160241762, now seen corresponding path program 1 times [2018-02-02 09:05:38,732 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:38,732 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:38,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:38,733 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:38,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:38,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:38,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:38,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:38,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:05:38,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:05:38,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:05:38,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:05:38,789 INFO L87 Difference]: Start difference. First operand 191 states and 220 transitions. Second operand 5 states. [2018-02-02 09:05:38,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:38,953 INFO L93 Difference]: Finished difference Result 272 states and 317 transitions. [2018-02-02 09:05:38,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:05:38,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-02 09:05:38,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:38,955 INFO L225 Difference]: With dead ends: 272 [2018-02-02 09:05:38,955 INFO L226 Difference]: Without dead ends: 272 [2018-02-02 09:05:38,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:05:38,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-02-02 09:05:38,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 190. [2018-02-02 09:05:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-02 09:05:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 218 transitions. [2018-02-02 09:05:38,957 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 218 transitions. Word has length 30 [2018-02-02 09:05:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:38,957 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 218 transitions. [2018-02-02 09:05:38,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:05:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 218 transitions. [2018-02-02 09:05:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 09:05:38,958 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:38,958 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] [2018-02-02 09:05:38,958 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:38,958 INFO L82 PathProgramCache]: Analyzing trace with hash 958169774, now seen corresponding path program 1 times [2018-02-02 09:05:38,958 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:38,958 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:38,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:38,961 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:38,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:38,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:39,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:39,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:39,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:05:39,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:05:39,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:05:39,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:05:39,004 INFO L87 Difference]: Start difference. First operand 190 states and 218 transitions. Second operand 4 states. [2018-02-02 09:05:39,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:39,069 INFO L93 Difference]: Finished difference Result 187 states and 216 transitions. [2018-02-02 09:05:39,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:05:39,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-02-02 09:05:39,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:39,070 INFO L225 Difference]: With dead ends: 187 [2018-02-02 09:05:39,070 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 09:05:39,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:05:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 09:05:39,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 182. [2018-02-02 09:05:39,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 09:05:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 210 transitions. [2018-02-02 09:05:39,073 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 210 transitions. Word has length 31 [2018-02-02 09:05:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:39,073 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 210 transitions. [2018-02-02 09:05:39,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:05:39,073 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 210 transitions. [2018-02-02 09:05:39,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:05:39,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:39,074 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] [2018-02-02 09:05:39,074 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:39,074 INFO L82 PathProgramCache]: Analyzing trace with hash 53737817, now seen corresponding path program 1 times [2018-02-02 09:05:39,074 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:39,074 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:39,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:39,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:39,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:39,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:39,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:39,100 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:39,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:05:39,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:05:39,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:05:39,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:05:39,101 INFO L87 Difference]: Start difference. First operand 182 states and 210 transitions. Second operand 4 states. [2018-02-02 09:05:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:39,185 INFO L93 Difference]: Finished difference Result 190 states and 219 transitions. [2018-02-02 09:05:39,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:05:39,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-02-02 09:05:39,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:39,185 INFO L225 Difference]: With dead ends: 190 [2018-02-02 09:05:39,185 INFO L226 Difference]: Without dead ends: 190 [2018-02-02 09:05:39,186 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-02 09:05:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-02 09:05:39,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 181. [2018-02-02 09:05:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-02 09:05:39,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 209 transitions. [2018-02-02 09:05:39,189 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 209 transitions. Word has length 32 [2018-02-02 09:05:39,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:39,189 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 209 transitions. [2018-02-02 09:05:39,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:05:39,189 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 209 transitions. [2018-02-02 09:05:39,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:05:39,190 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:39,199 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] [2018-02-02 09:05:39,199 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:39,200 INFO L82 PathProgramCache]: Analyzing trace with hash 53737818, now seen corresponding path program 1 times [2018-02-02 09:05:39,201 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:39,201 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:39,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:39,202 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:39,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:39,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:39,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:39,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:05:39,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:05:39,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:05:39,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:05:39,241 INFO L87 Difference]: Start difference. First operand 181 states and 209 transitions. Second operand 4 states. [2018-02-02 09:05:39,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:39,336 INFO L93 Difference]: Finished difference Result 217 states and 247 transitions. [2018-02-02 09:05:39,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:05:39,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-02-02 09:05:39,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:39,599 INFO L225 Difference]: With dead ends: 217 [2018-02-02 09:05:39,599 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 09:05:39,599 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02 09:05:39,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 09:05:39,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 179. [2018-02-02 09:05:39,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-02 09:05:39,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 207 transitions. [2018-02-02 09:05:39,601 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 207 transitions. Word has length 32 [2018-02-02 09:05:39,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:39,602 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 207 transitions. [2018-02-02 09:05:39,602 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:05:39,602 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 207 transitions. [2018-02-02 09:05:39,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:05:39,602 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:39,602 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] [2018-02-02 09:05:39,602 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:39,603 INFO L82 PathProgramCache]: Analyzing trace with hash 611367904, now seen corresponding path program 1 times [2018-02-02 09:05:39,603 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:39,603 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:39,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:39,604 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:39,604 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:39,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:39,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:39,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 09:05:39,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:05:39,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:05:39,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:05:39,678 INFO L87 Difference]: Start difference. First operand 179 states and 207 transitions. Second operand 10 states. [2018-02-02 09:05:39,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:39,948 INFO L93 Difference]: Finished difference Result 227 states and 263 transitions. [2018-02-02 09:05:39,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:05:39,948 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-02-02 09:05:39,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:39,949 INFO L225 Difference]: With dead ends: 227 [2018-02-02 09:05:39,949 INFO L226 Difference]: Without dead ends: 227 [2018-02-02 09:05:39,949 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:05:39,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-02 09:05:39,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 178. [2018-02-02 09:05:39,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 09:05:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 205 transitions. [2018-02-02 09:05:39,951 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 205 transitions. Word has length 32 [2018-02-02 09:05:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:39,951 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 205 transitions. [2018-02-02 09:05:39,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:05:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 205 transitions. [2018-02-02 09:05:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:05:39,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:39,952 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] [2018-02-02 09:05:39,952 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:39,952 INFO L82 PathProgramCache]: Analyzing trace with hash 611367905, now seen corresponding path program 1 times [2018-02-02 09:05:39,952 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:39,952 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:39,952 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:39,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:39,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:39,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:40,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:40,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 09:05:40,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:05:40,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:05:40,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:05:40,061 INFO L87 Difference]: Start difference. First operand 178 states and 205 transitions. Second operand 10 states. [2018-02-02 09:05:40,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:40,391 INFO L93 Difference]: Finished difference Result 222 states and 256 transitions. [2018-02-02 09:05:40,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:05:40,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-02-02 09:05:40,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:40,392 INFO L225 Difference]: With dead ends: 222 [2018-02-02 09:05:40,392 INFO L226 Difference]: Without dead ends: 222 [2018-02-02 09:05:40,392 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:05:40,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-02 09:05:40,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 177. [2018-02-02 09:05:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-02 09:05:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 203 transitions. [2018-02-02 09:05:40,394 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 203 transitions. Word has length 32 [2018-02-02 09:05:40,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:40,394 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 203 transitions. [2018-02-02 09:05:40,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:05:40,394 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 203 transitions. [2018-02-02 09:05:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 09:05:40,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:40,395 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-02 09:05:40,395 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:40,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1665872513, now seen corresponding path program 1 times [2018-02-02 09:05:40,395 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:40,395 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:40,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:40,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:40,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:40,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:40,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:40,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:40,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:05:40,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:05:40,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:05:40,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:05:40,437 INFO L87 Difference]: Start difference. First operand 177 states and 203 transitions. Second operand 5 states. [2018-02-02 09:05:40,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:40,539 INFO L93 Difference]: Finished difference Result 207 states and 238 transitions. [2018-02-02 09:05:40,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:05:40,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-02 09:05:40,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:40,540 INFO L225 Difference]: With dead ends: 207 [2018-02-02 09:05:40,540 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 09:05:40,540 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:05:40,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 09:05:40,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 155. [2018-02-02 09:05:40,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 09:05:40,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 175 transitions. [2018-02-02 09:05:40,543 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 175 transitions. Word has length 33 [2018-02-02 09:05:40,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:40,543 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 175 transitions. [2018-02-02 09:05:40,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:05:40,543 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 175 transitions. [2018-02-02 09:05:40,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 09:05:40,544 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:40,544 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:05:40,544 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:40,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1679203151, now seen corresponding path program 1 times [2018-02-02 09:05:40,544 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:40,544 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:40,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:40,545 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:40,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:40,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:40,595 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:05:40,595 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:05:40,604 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:40,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:05:40,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 09:05:40,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 09:05:40,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:40,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:40,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 09:05:40,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 09:05:40,711 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:40,713 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:40,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:40,716 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-02-02 09:05:40,725 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 26 treesize of output 21 [2018-02-02 09:05:40,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:40,736 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-02 09:05:40,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:40,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:40,753 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 26 treesize of output 21 [2018-02-02 09:05:40,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:40,760 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-02 09:05:40,761 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:40,765 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:40,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:40,772 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-02-02 09:05:40,798 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 20 treesize of output 16 [2018-02-02 09:05:40,803 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-02 09:05:40,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:40,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:40,811 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 20 treesize of output 16 [2018-02-02 09:05:40,817 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-02 09:05:40,817 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:40,818 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:40,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:40,821 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-02-02 09:05:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:40,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:05:40,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-02-02 09:05:40,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:05:40,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:05:40,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:05:40,859 INFO L87 Difference]: Start difference. First operand 155 states and 175 transitions. Second operand 5 states. [2018-02-02 09:05:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:40,938 INFO L93 Difference]: Finished difference Result 169 states and 189 transitions. [2018-02-02 09:05:40,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:05:40,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-02 09:05:40,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:40,939 INFO L225 Difference]: With dead ends: 169 [2018-02-02 09:05:40,940 INFO L226 Difference]: Without dead ends: 169 [2018-02-02 09:05:40,940 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:05:40,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-02 09:05:40,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 157. [2018-02-02 09:05:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 09:05:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2018-02-02 09:05:40,943 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 33 [2018-02-02 09:05:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:40,943 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2018-02-02 09:05:40,944 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:05:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2018-02-02 09:05:40,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 09:05:40,944 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:40,944 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-02 09:05:40,944 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:40,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2053594356, now seen corresponding path program 1 times [2018-02-02 09:05:40,945 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:40,945 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:40,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:40,946 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:40,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:40,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:41,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-02 09:05:41,021 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:41,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:05:41,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:05:41,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:05:41,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:05:41,022 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand 9 states. [2018-02-02 09:05:41,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:41,279 INFO L93 Difference]: Finished difference Result 164 states and 186 transitions. [2018-02-02 09:05:41,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:05:41,280 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-02 09:05:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:41,280 INFO L225 Difference]: With dead ends: 164 [2018-02-02 09:05:41,280 INFO L226 Difference]: Without dead ends: 164 [2018-02-02 09:05:41,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:05:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-02 09:05:41,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2018-02-02 09:05:41,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 09:05:41,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 176 transitions. [2018-02-02 09:05:41,283 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 176 transitions. Word has length 33 [2018-02-02 09:05:41,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:41,283 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 176 transitions. [2018-02-02 09:05:41,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:05:41,283 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 176 transitions. [2018-02-02 09:05:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 09:05:41,284 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:41,284 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-02 09:05:41,284 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:41,284 INFO L82 PathProgramCache]: Analyzing trace with hash -2053594355, now seen corresponding path program 1 times [2018-02-02 09:05:41,284 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:41,284 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:41,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:41,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:41,285 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:41,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:41,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:41,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:05:41,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:05:41,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:05:41,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:05:41,400 INFO L87 Difference]: Start difference. First operand 156 states and 176 transitions. Second operand 9 states. [2018-02-02 09:05:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:41,660 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2018-02-02 09:05:41,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:05:41,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-02 09:05:41,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:41,661 INFO L225 Difference]: With dead ends: 163 [2018-02-02 09:05:41,661 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 09:05:41,661 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:05:41,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 09:05:41,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2018-02-02 09:05:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 09:05:41,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 175 transitions. [2018-02-02 09:05:41,664 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 175 transitions. Word has length 33 [2018-02-02 09:05:41,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:41,664 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 175 transitions. [2018-02-02 09:05:41,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:05:41,664 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 175 transitions. [2018-02-02 09:05:41,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 09:05:41,664 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:41,665 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:05:41,665 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:41,665 INFO L82 PathProgramCache]: Analyzing trace with hash 515690238, now seen corresponding path program 1 times [2018-02-02 09:05:41,665 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:41,665 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:41,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:41,666 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:41,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:41,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:42,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:42,067 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:05:42,067 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:05:42,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:42,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:05:42,226 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-02 09:05:42,228 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-02 09:05:42,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:42,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:42,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:42,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:57 [2018-02-02 09:05:42,341 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 60 treesize of output 50 [2018-02-02 09:05:42,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2018-02-02 09:05:42,351 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 09:05:42,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 09:05:42,394 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 2 xjuncts. [2018-02-02 09:05:42,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:72 [2018-02-02 09:05:42,565 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_2 Int) (main_~n~0.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~n~0.base 1))) (and (not (= 0 main_~n~0.base)) (= 0 (select .cse0 v_prenex_2)) (not (= v_prenex_2 0)) (= (select |c_old(#valid)| main_~n~0.base) 0) (= |c_#valid| (store (store .cse0 v_prenex_2 0) main_~n~0.base 0))))) is different from true [2018-02-02 09:05:42,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-02 09:05:42,603 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:05:42,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2018-02-02 09:05:42,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 09:05:42,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 09:05:42,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=584, Unknown=3, NotChecked=48, Total=702 [2018-02-02 09:05:42,604 INFO L87 Difference]: Start difference. First operand 155 states and 175 transitions. Second operand 27 states. [2018-02-02 09:05:44,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:44,159 INFO L93 Difference]: Finished difference Result 184 states and 206 transitions. [2018-02-02 09:05:44,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 09:05:44,159 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2018-02-02 09:05:44,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:44,160 INFO L225 Difference]: With dead ends: 184 [2018-02-02 09:05:44,160 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 09:05:44,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=215, Invalid=1424, Unknown=5, NotChecked=78, Total=1722 [2018-02-02 09:05:44,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 09:05:44,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 171. [2018-02-02 09:05:44,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 09:05:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 192 transitions. [2018-02-02 09:05:44,162 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 192 transitions. Word has length 34 [2018-02-02 09:05:44,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:44,163 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 192 transitions. [2018-02-02 09:05:44,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 09:05:44,163 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 192 transitions. [2018-02-02 09:05:44,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 09:05:44,163 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:44,163 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-02 09:05:44,163 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:44,163 INFO L82 PathProgramCache]: Analyzing trace with hash 483224159, now seen corresponding path program 1 times [2018-02-02 09:05:44,163 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:44,163 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:44,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:44,164 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:44,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:44,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:44,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:44,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-02 09:05:44,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:05:44,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:05:44,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:05:44,831 INFO L87 Difference]: Start difference. First operand 171 states and 192 transitions. Second operand 16 states. [2018-02-02 09:05:46,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:46,081 INFO L93 Difference]: Finished difference Result 275 states and 304 transitions. [2018-02-02 09:05:46,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 09:05:46,082 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-02-02 09:05:46,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:46,082 INFO L225 Difference]: With dead ends: 275 [2018-02-02 09:05:46,082 INFO L226 Difference]: Without dead ends: 275 [2018-02-02 09:05:46,083 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=194, Invalid=1066, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 09:05:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-02 09:05:46,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 186. [2018-02-02 09:05:46,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 09:05:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2018-02-02 09:05:46,086 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 34 [2018-02-02 09:05:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:46,087 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2018-02-02 09:05:46,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:05:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2018-02-02 09:05:46,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 09:05:46,087 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:46,087 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-02 09:05:46,087 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:46,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1115187100, now seen corresponding path program 1 times [2018-02-02 09:05:46,087 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:46,087 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:46,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:46,088 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:46,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:46,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:46,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:46,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 09:05:46,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:05:46,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:05:46,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:05:46,143 INFO L87 Difference]: Start difference. First operand 186 states and 208 transitions. Second operand 10 states. [2018-02-02 09:05:46,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:46,366 INFO L93 Difference]: Finished difference Result 193 states and 217 transitions. [2018-02-02 09:05:46,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:05:46,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-02-02 09:05:46,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:46,366 INFO L225 Difference]: With dead ends: 193 [2018-02-02 09:05:46,367 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 09:05:46,367 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:05:46,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 09:05:46,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2018-02-02 09:05:46,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 09:05:46,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2018-02-02 09:05:46,370 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 36 [2018-02-02 09:05:46,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:46,370 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2018-02-02 09:05:46,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:05:46,370 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2018-02-02 09:05:46,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 09:05:46,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:46,371 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-02 09:05:46,371 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:46,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1115187099, now seen corresponding path program 1 times [2018-02-02 09:05:46,371 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:46,371 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:46,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:46,372 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:46,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:46,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:46,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:46,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 09:05:46,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:05:46,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:05:46,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:05:46,523 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand 10 states. [2018-02-02 09:05:46,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:46,798 INFO L93 Difference]: Finished difference Result 192 states and 216 transitions. [2018-02-02 09:05:46,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:05:46,798 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-02-02 09:05:46,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:46,799 INFO L225 Difference]: With dead ends: 192 [2018-02-02 09:05:46,799 INFO L226 Difference]: Without dead ends: 192 [2018-02-02 09:05:46,799 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:05:46,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-02 09:05:46,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 184. [2018-02-02 09:05:46,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 09:05:46,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2018-02-02 09:05:46,801 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 36 [2018-02-02 09:05:46,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:46,801 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2018-02-02 09:05:46,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:05:46,801 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2018-02-02 09:05:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 09:05:46,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:46,801 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:05:46,802 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:46,802 INFO L82 PathProgramCache]: Analyzing trace with hash 896049480, now seen corresponding path program 1 times [2018-02-02 09:05:46,802 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:46,802 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:46,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:46,802 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:46,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:46,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:46,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:46,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:46,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:05:46,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:05:46,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:05:46,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:05:46,862 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand 7 states. [2018-02-02 09:05:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:47,039 INFO L93 Difference]: Finished difference Result 202 states and 225 transitions. [2018-02-02 09:05:47,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:05:47,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-02 09:05:47,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:47,040 INFO L225 Difference]: With dead ends: 202 [2018-02-02 09:05:47,040 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 09:05:47,040 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:05:47,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 09:05:47,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 191. [2018-02-02 09:05:47,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 09:05:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 217 transitions. [2018-02-02 09:05:47,042 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 217 transitions. Word has length 39 [2018-02-02 09:05:47,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:47,042 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 217 transitions. [2018-02-02 09:05:47,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:05:47,042 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 217 transitions. [2018-02-02 09:05:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 09:05:47,042 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:47,043 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:05:47,043 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:47,043 INFO L82 PathProgramCache]: Analyzing trace with hash 896049481, now seen corresponding path program 1 times [2018-02-02 09:05:47,043 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:47,043 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:47,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:47,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:47,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:47,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:47,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:47,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:47,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:05:47,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:05:47,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:05:47,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:05:47,100 INFO L87 Difference]: Start difference. First operand 191 states and 217 transitions. Second operand 5 states. [2018-02-02 09:05:47,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:47,224 INFO L93 Difference]: Finished difference Result 246 states and 272 transitions. [2018-02-02 09:05:47,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:05:47,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-02 09:05:47,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:47,225 INFO L225 Difference]: With dead ends: 246 [2018-02-02 09:05:47,225 INFO L226 Difference]: Without dead ends: 246 [2018-02-02 09:05:47,225 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:05:47,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-02 09:05:47,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 193. [2018-02-02 09:05:47,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 09:05:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 217 transitions. [2018-02-02 09:05:47,228 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 217 transitions. Word has length 39 [2018-02-02 09:05:47,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:47,228 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 217 transitions. [2018-02-02 09:05:47,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:05:47,229 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 217 transitions. [2018-02-02 09:05:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 09:05:47,229 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:47,229 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:05:47,229 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:47,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1751566696, now seen corresponding path program 1 times [2018-02-02 09:05:47,230 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:47,230 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:47,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:47,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:47,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:47,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:47,329 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:47,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:05:47,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:05:47,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:05:47,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:05:47,329 INFO L87 Difference]: Start difference. First operand 193 states and 217 transitions. Second operand 7 states. [2018-02-02 09:05:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:47,565 INFO L93 Difference]: Finished difference Result 237 states and 263 transitions. [2018-02-02 09:05:47,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:05:47,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-02 09:05:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:47,566 INFO L225 Difference]: With dead ends: 237 [2018-02-02 09:05:47,566 INFO L226 Difference]: Without dead ends: 237 [2018-02-02 09:05:47,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:05:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-02-02 09:05:47,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 201. [2018-02-02 09:05:47,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-02 09:05:47,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 231 transitions. [2018-02-02 09:05:47,569 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 231 transitions. Word has length 39 [2018-02-02 09:05:47,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:47,569 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 231 transitions. [2018-02-02 09:05:47,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:05:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2018-02-02 09:05:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 09:05:47,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:47,569 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:05:47,570 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:47,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1751566697, now seen corresponding path program 1 times [2018-02-02 09:05:47,570 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:47,570 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:47,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:47,570 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:47,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:47,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:47,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:47,626 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:47,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:05:47,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:05:47,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:05:47,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:05:47,627 INFO L87 Difference]: Start difference. First operand 201 states and 231 transitions. Second operand 5 states. [2018-02-02 09:05:47,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:47,812 INFO L93 Difference]: Finished difference Result 278 states and 309 transitions. [2018-02-02 09:05:47,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:05:47,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-02 09:05:47,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:47,813 INFO L225 Difference]: With dead ends: 278 [2018-02-02 09:05:47,813 INFO L226 Difference]: Without dead ends: 278 [2018-02-02 09:05:47,813 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:05:47,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-02 09:05:47,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 194. [2018-02-02 09:05:47,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 09:05:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 220 transitions. [2018-02-02 09:05:47,816 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 220 transitions. Word has length 39 [2018-02-02 09:05:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:47,816 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 220 transitions. [2018-02-02 09:05:47,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:05:47,817 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 220 transitions. [2018-02-02 09:05:47,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 09:05:47,817 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:47,817 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:05:47,817 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:47,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2007730213, now seen corresponding path program 1 times [2018-02-02 09:05:47,817 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:47,817 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:47,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:47,818 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:47,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:47,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:47,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:47,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:05:47,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:05:47,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:05:47,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:05:47,842 INFO L87 Difference]: Start difference. First operand 194 states and 220 transitions. Second operand 5 states. [2018-02-02 09:05:47,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:47,888 INFO L93 Difference]: Finished difference Result 263 states and 297 transitions. [2018-02-02 09:05:47,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:05:47,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-02-02 09:05:47,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:47,890 INFO L225 Difference]: With dead ends: 263 [2018-02-02 09:05:47,890 INFO L226 Difference]: Without dead ends: 263 [2018-02-02 09:05:47,890 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:05:47,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-02 09:05:47,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 198. [2018-02-02 09:05:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-02 09:05:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 225 transitions. [2018-02-02 09:05:47,893 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 225 transitions. Word has length 40 [2018-02-02 09:05:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:47,893 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 225 transitions. [2018-02-02 09:05:47,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:05:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 225 transitions. [2018-02-02 09:05:47,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 09:05:47,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:47,894 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:05:47,894 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:47,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1536007163, now seen corresponding path program 1 times [2018-02-02 09:05:47,894 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:47,894 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:47,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:47,895 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:47,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:47,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:47,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:47,916 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:47,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:05:47,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:05:47,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:05:47,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:05:47,917 INFO L87 Difference]: Start difference. First operand 198 states and 225 transitions. Second operand 5 states. [2018-02-02 09:05:47,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:47,968 INFO L93 Difference]: Finished difference Result 275 states and 304 transitions. [2018-02-02 09:05:47,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:05:47,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-02-02 09:05:47,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:47,969 INFO L225 Difference]: With dead ends: 275 [2018-02-02 09:05:47,969 INFO L226 Difference]: Without dead ends: 275 [2018-02-02 09:05:47,970 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:05:47,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-02 09:05:47,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 194. [2018-02-02 09:05:47,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 09:05:47,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 219 transitions. [2018-02-02 09:05:47,972 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 219 transitions. Word has length 40 [2018-02-02 09:05:47,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:47,972 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 219 transitions. [2018-02-02 09:05:47,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:05:47,973 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 219 transitions. [2018-02-02 09:05:47,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 09:05:47,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:47,973 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:05:47,973 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:47,974 INFO L82 PathProgramCache]: Analyzing trace with hash 720428047, now seen corresponding path program 1 times [2018-02-02 09:05:47,974 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:47,974 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:47,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:47,974 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:47,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:47,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:48,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:05:48,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 09:05:48,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:05:48,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:05:48,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:05:48,364 INFO L87 Difference]: Start difference. First operand 194 states and 219 transitions. Second operand 18 states. [2018-02-02 09:05:49,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:49,303 INFO L93 Difference]: Finished difference Result 220 states and 245 transitions. [2018-02-02 09:05:49,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 09:05:49,303 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2018-02-02 09:05:49,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:49,303 INFO L225 Difference]: With dead ends: 220 [2018-02-02 09:05:49,304 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 09:05:49,304 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=1216, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 09:05:49,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 09:05:49,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 192. [2018-02-02 09:05:49,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 09:05:49,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 216 transitions. [2018-02-02 09:05:49,306 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 216 transitions. Word has length 44 [2018-02-02 09:05:49,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:49,306 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 216 transitions. [2018-02-02 09:05:49,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:05:49,307 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 216 transitions. [2018-02-02 09:05:49,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 09:05:49,307 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:49,307 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:05:49,307 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:49,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1624848401, now seen corresponding path program 1 times [2018-02-02 09:05:49,308 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:49,308 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:49,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:49,308 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:49,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:49,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:49,896 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:05:49,896 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:05:49,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:49,934 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:05:49,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 09:05:49,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 09:05:49,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:49,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:49,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 09:05:49,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 09:05:49,955 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:49,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:49,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:49,960 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-02-02 09:05:49,972 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 26 treesize of output 21 [2018-02-02 09:05:49,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:49,978 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-02 09:05:49,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:49,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:49,996 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 26 treesize of output 21 [2018-02-02 09:05:50,002 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:50,003 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-02 09:05:50,003 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:41 [2018-02-02 09:05:50,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-02-02 09:05:50,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:50,056 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:50,057 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:50,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-02-02 09:05:50,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-02-02 09:05:50,085 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:50,085 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:50,086 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:50,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-02-02 09:05:50,087 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,107 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2018-02-02 09:05:50,151 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:50,152 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:50,153 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-02 09:05:50,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:61 [2018-02-02 09:05:50,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-02-02 09:05:50,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 09:05:50,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-02-02 09:05:50,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 09:05:50,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,290 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:86, output treesize:78 [2018-02-02 09:05:50,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-02-02 09:05:50,330 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:50,331 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 23 [2018-02-02 09:05:50,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 59 [2018-02-02 09:05:50,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:50,357 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-02 09:05:50,357 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,376 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 1 xjuncts. [2018-02-02 09:05:50,376 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:118 [2018-02-02 09:05:50,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:50,584 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:05:50,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 98 [2018-02-02 09:05:50,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:50,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:50,589 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:05:50,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 48 [2018-02-02 09:05:50,591 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:05:50,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2018-02-02 09:05:50,634 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 09:05:50,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 09:05:50,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2018-02-02 09:05:50,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:50,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-02 09:05:50,672 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2018-02-02 09:05:50,690 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-02 09:05:50,697 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:05:50,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2018-02-02 09:05:50,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:50,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-02-02 09:05:50,704 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-02-02 09:05:50,716 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,719 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:50,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-02 09:05:50,736 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:143, output treesize:46 [2018-02-02 09:05:50,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:50,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:05:50,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [19] total 31 [2018-02-02 09:05:50,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 09:05:50,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 09:05:50,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=847, Unknown=5, NotChecked=0, Total=930 [2018-02-02 09:05:50,845 INFO L87 Difference]: Start difference. First operand 192 states and 216 transitions. Second operand 31 states. [2018-02-02 09:05:54,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:05:54,020 INFO L93 Difference]: Finished difference Result 216 states and 240 transitions. [2018-02-02 09:05:54,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 09:05:54,020 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 44 [2018-02-02 09:05:54,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:05:54,021 INFO L225 Difference]: With dead ends: 216 [2018-02-02 09:05:54,021 INFO L226 Difference]: Without dead ends: 185 [2018-02-02 09:05:54,022 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=393, Invalid=2253, Unknown=6, NotChecked=0, Total=2652 [2018-02-02 09:05:54,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-02 09:05:54,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 178. [2018-02-02 09:05:54,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 09:05:54,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 201 transitions. [2018-02-02 09:05:54,023 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 201 transitions. Word has length 44 [2018-02-02 09:05:54,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:05:54,024 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 201 transitions. [2018-02-02 09:05:54,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 09:05:54,024 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 201 transitions. [2018-02-02 09:05:54,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 09:05:54,024 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:05:54,024 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2018-02-02 09:05:54,024 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:05:54,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1456246469, now seen corresponding path program 1 times [2018-02-02 09:05:54,024 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:05:54,024 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:05:54,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:54,025 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:54,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:05:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:54,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:05:54,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:05:54,156 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:05:54,156 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:05:54,161 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:05:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:05:54,179 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:05:54,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:54,194 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:54,194 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-02 09:05:54,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:54,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:54,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-02 09:05:54,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 09:05:54,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 09:05:54,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:54,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:54,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:54,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-02-02 09:05:54,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-02-02 09:05:54,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 09:05:54,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:54,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:54,240 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-02 09:05:54,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-02-02 09:05:54,270 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:05:54,270 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:05:54,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2018-02-02 09:05:54,278 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 20 treesize of output 25 [2018-02-02 09:05:54,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:05:54,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:05:54,286 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-02 09:05:54,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:39 [2018-02-02 09:06:00,311 WARN L146 SmtUtils]: Spent 2009ms on a formula simplification. DAG size of input: 24 DAG size of output 20 [2018-02-02 09:06:00,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2018-02-02 09:06:00,339 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 2 case distinctions, treesize of input 22 treesize of output 35 [2018-02-02 09:06:00,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 09:06:00,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:06:00,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-02 09:06:00,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:76 [2018-02-02 09:06:00,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-02-02 09:06:00,436 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-02 09:06:00,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:06:00,441 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-02 09:06:00,441 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:06:00,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:06:00,445 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-02 09:06:00,446 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2018-02-02 09:06:00,451 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:06:00,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:06:00,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 21 [2018-02-02 09:06:00,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 09:06:00,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 09:06:00,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=393, Unknown=2, NotChecked=0, Total=462 [2018-02-02 09:06:00,471 INFO L87 Difference]: Start difference. First operand 178 states and 201 transitions. Second operand 22 states. [2018-02-02 09:06:15,071 WARN L146 SmtUtils]: Spent 2029ms on a formula simplification. DAG size of input: 42 DAG size of output 33 [2018-02-02 09:06:23,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:06:23,637 INFO L93 Difference]: Finished difference Result 366 states and 430 transitions. [2018-02-02 09:06:23,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 09:06:23,637 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 52 [2018-02-02 09:06:23,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:06:23,638 INFO L225 Difference]: With dead ends: 366 [2018-02-02 09:06:23,638 INFO L226 Difference]: Without dead ends: 366 [2018-02-02 09:06:23,638 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=320, Invalid=1153, Unknown=9, NotChecked=0, Total=1482 [2018-02-02 09:06:23,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-02 09:06:23,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2018-02-02 09:06:23,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-02 09:06:23,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 287 transitions. [2018-02-02 09:06:23,641 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 287 transitions. Word has length 52 [2018-02-02 09:06:23,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:06:23,641 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 287 transitions. [2018-02-02 09:06:23,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 09:06:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 287 transitions. [2018-02-02 09:06:23,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 09:06:23,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:06:23,642 INFO L351 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1] [2018-02-02 09:06:23,642 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr74EnsuresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr72RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr73RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-02 09:06:23,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1456246468, now seen corresponding path program 1 times [2018-02-02 09:06:23,643 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:06:23,643 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:06:23,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:06:23,644 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:06:23,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:06:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:06:23,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:06:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:06:23,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:06:23,826 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:06:23,831 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:06:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:06:23,850 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:06:23,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:06:23,874 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:06:23,874 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-02 09:06:23,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:06:23,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:06:23,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-02 09:06:23,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 09:06:23,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 09:06:23,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:06:23,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:06:23,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-02 09:06:23,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 09:06:23,894 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:06:23,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:06:23,901 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-02 09:06:23,901 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-02-02 09:06:23,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-02-02 09:06:23,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 09:06:23,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:06:23,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:06:23,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-02-02 09:06:23,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 09:06:23,948 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:06:23,951 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:06:23,958 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-02 09:06:23,958 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:44 [2018-02-02 09:06:24,029 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:06:24,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 74 [2018-02-02 09:06:24,043 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 20 treesize of output 25 [2018-02-02 09:06:24,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:06:24,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:06:24,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-02-02 09:06:24,076 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 20 treesize of output 25 [2018-02-02 09:06:24,076 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:06:24,081 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:06:24,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:06:24,090 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:70 [2018-02-02 09:06:28,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 78 [2018-02-02 09:06:28,182 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 2 case distinctions, treesize of input 22 treesize of output 35 [2018-02-02 09:06:28,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 09:06:28,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:06:28,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 81 [2018-02-02 09:06:28,233 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 2 case distinctions, treesize of input 22 treesize of output 35 [2018-02-02 09:06:28,233 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-02 09:06:28,248 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:06:28,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 75 [2018-02-02 09:06:28,273 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:06:28,274 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 22 treesize of output 21 [2018-02-02 09:06:28,275 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 09:06:28,295 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:06:28,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-02 09:06:28,321 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:102, output treesize:149 [2018-02-02 09:06:32,896 WARN L143 SmtUtils]: Spent 4548ms on a formula simplification that was a NOOP. DAG size: 53 Received shutdown request... [2018-02-02 09:06:34,897 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-02 09:06:34,897 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 09:06:34,901 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 09:06:34,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:06:34 BoogieIcfgContainer [2018-02-02 09:06:34,901 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:06:34,901 INFO L168 Benchmark]: Toolchain (without parser) took 62396.95 ms. Allocated memory was 402.7 MB in the beginning and 907.0 MB in the end (delta: 504.4 MB). Free memory was 359.5 MB in the beginning and 724.6 MB in the end (delta: -365.1 MB). Peak memory consumption was 139.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:06:34,902 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:06:34,902 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.49 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 349.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:06:34,903 INFO L168 Benchmark]: Boogie Preprocessor took 28.12 ms. Allocated memory is still 402.7 MB. Free memory was 349.0 MB in the beginning and 346.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. [2018-02-02 09:06:34,903 INFO L168 Benchmark]: RCFGBuilder took 456.73 ms. Allocated memory is still 402.7 MB. Free memory was 346.3 MB in the beginning and 304.3 MB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 5.3 GB. [2018-02-02 09:06:34,903 INFO L168 Benchmark]: TraceAbstraction took 61747.99 ms. Allocated memory was 402.7 MB in the beginning and 907.0 MB in the end (delta: 504.4 MB). Free memory was 304.3 MB in the beginning and 724.6 MB in the end (delta: -420.3 MB). Peak memory consumption was 84.0 MB. Max. memory is 5.3 GB. [2018-02-02 09:06:34,904 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.11 ms. Allocated memory is still 402.7 MB. Free memory is still 366.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.49 ms. Allocated memory is still 402.7 MB. Free memory was 359.5 MB in the beginning and 349.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.12 ms. Allocated memory is still 402.7 MB. Free memory was 349.0 MB in the beginning and 346.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 456.73 ms. Allocated memory is still 402.7 MB. Free memory was 346.3 MB in the beginning and 304.3 MB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 61747.99 ms. Allocated memory was 402.7 MB in the beginning and 907.0 MB in the end (delta: 504.4 MB). Free memory was 304.3 MB in the beginning and 724.6 MB in the end (delta: -420.3 MB). Peak memory consumption was 84.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 164 locations, 75 error locations. TIMEOUT Result, 61.7s OverallTime, 44 OverallIterations, 3 TraceHistogramMax, 37.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4566 SDtfs, 7539 SDslu, 12940 SDs, 0 SdLazy, 14680 SolverSat, 782 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 718 GetRequests, 204 SyntacticMatches, 23 SemanticMatches, 491 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 30.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 43 MinimizatonAttempts, 1544 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 1448 NumberOfCodeBlocks, 1448 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1401 ConstructedInterpolants, 45 QuantifiedInterpolants, 432087 SizeOfPredicates, 51 NumberOfNonLiveVariables, 755 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 47 InterpolantComputations, 40 PerfectInterpolantSequences, 46/78 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-06-34-909.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_parent_ptr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-06-34-909.csv Completed graceful shutdown