java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_parent_ptr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 23:47:28,317 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 23:47:28,318 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 23:47:28,328 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 23:47:28,328 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 23:47:28,329 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 23:47:28,330 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 23:47:28,331 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 23:47:28,332 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 23:47:28,333 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 23:47:28,334 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 23:47:28,334 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 23:47:28,335 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 23:47:28,336 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 23:47:28,337 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 23:47:28,338 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 23:47:28,340 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 23:47:28,341 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 23:47:28,342 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 23:47:28,343 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 23:47:28,345 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 23:47:28,345 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 23:47:28,345 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 23:47:28,346 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 23:47:28,347 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 23:47:28,348 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 23:47:28,348 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 23:47:28,348 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 23:47:28,348 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 23:47:28,349 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 23:47:28,349 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 23:47:28,349 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 23:47:28,358 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 23:47:28,359 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 23:47:28,360 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 23:47:28,360 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 23:47:28,360 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 23:47:28,360 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 23:47:28,360 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 23:47:28,360 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 23:47:28,361 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 23:47:28,361 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 23:47:28,361 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 23:47:28,361 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 23:47:28,361 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 23:47:28,361 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 23:47:28,361 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 23:47:28,362 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 23:47:28,362 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 23:47:28,362 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 23:47:28,362 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 23:47:28,362 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 23:47:28,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 23:47:28,363 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 23:47:28,363 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 23:47:28,363 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 23:47:28,363 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 23:47:28,390 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 23:47:28,401 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 23:47:28,404 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 23:47:28,406 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 23:47:28,406 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 23:47:28,407 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-03 23:47:28,564 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 23:47:28,565 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 23:47:28,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 23:47:28,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 23:47:28,570 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 23:47:28,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:47:28" (1/1) ... [2018-02-03 23:47:28,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70c221d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:47:28, skipping insertion in model container [2018-02-03 23:47:28,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:47:28" (1/1) ... [2018-02-03 23:47:28,588 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:47:28,617 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:47:28,707 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:47:28,721 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:47:28,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:47:28 WrapperNode [2018-02-03 23:47:28,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 23:47:28,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 23:47:28,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 23:47:28,727 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 23:47:28,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:47:28" (1/1) ... [2018-02-03 23:47:28,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:47:28" (1/1) ... [2018-02-03 23:47:28,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:47:28" (1/1) ... [2018-02-03 23:47:28,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:47:28" (1/1) ... [2018-02-03 23:47:28,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:47:28" (1/1) ... [2018-02-03 23:47:28,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:47:28" (1/1) ... [2018-02-03 23:47:28,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:47:28" (1/1) ... [2018-02-03 23:47:28,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 23:47:28,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 23:47:28,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 23:47:28,757 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 23:47:28,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:47:28" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 23:47:28,789 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 23:47:28,790 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 23:47:28,790 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 23:47:28,790 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-03 23:47:28,790 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-03 23:47:28,790 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 23:47:28,791 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 23:47:28,791 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 23:47:28,791 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 23:47:28,791 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-03 23:47:28,791 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-03 23:47:28,791 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 23:47:28,791 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 23:47:28,791 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 23:47:29,176 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 23:47:29,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:47:29 BoogieIcfgContainer [2018-02-03 23:47:29,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 23:47:29,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 23:47:29,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 23:47:29,180 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 23:47:29,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 11:47:28" (1/3) ... [2018-02-03 23:47:29,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f79957f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:47:29, skipping insertion in model container [2018-02-03 23:47:29,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:47:28" (2/3) ... [2018-02-03 23:47:29,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f79957f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:47:29, skipping insertion in model container [2018-02-03 23:47:29,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:47:29" (3/3) ... [2018-02-03 23:47:29,184 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_parent_ptr_true-valid-memsafety_false-termination.i [2018-02-03 23:47:29,191 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 23:47:29,196 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 75 error locations. [2018-02-03 23:47:29,225 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 23:47:29,225 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 23:47:29,225 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 23:47:29,225 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 23:47:29,225 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 23:47:29,225 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 23:47:29,225 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 23:47:29,225 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 23:47:29,226 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 23:47:29,239 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2018-02-03 23:47:29,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-03 23:47:29,247 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:29,248 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:47:29,249 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-03 23:47:29,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1759036932, now seen corresponding path program 1 times [2018-02-03 23:47:29,254 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:29,254 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:29,296 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:29,296 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:29,296 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:29,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:29,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:29,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:29,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:47:29,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:47:29,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:47:29,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:47:29,395 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 4 states. [2018-02-03 23:47:29,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:29,646 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2018-02-03 23:47:29,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:47:29,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-03 23:47:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:29,655 INFO L225 Difference]: With dead ends: 178 [2018-02-03 23:47:29,655 INFO L226 Difference]: Without dead ends: 174 [2018-02-03 23:47:29,657 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:47:29,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-03 23:47:29,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2018-02-03 23:47:29,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-03 23:47:29,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 168 transitions. [2018-02-03 23:47:29,690 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 168 transitions. Word has length 8 [2018-02-03 23:47:29,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:29,690 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 168 transitions. [2018-02-03 23:47:29,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:47:29,690 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2018-02-03 23:47:29,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-03 23:47:29,690 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:29,691 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:47:29,691 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-03 23:47:29,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1759036931, now seen corresponding path program 1 times [2018-02-03 23:47:29,691 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:29,691 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:29,692 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:29,692 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:29,692 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:29,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:29,784 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:29,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:47:29,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:47:29,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:47:29,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:47:29,786 INFO L87 Difference]: Start difference. First operand 158 states and 168 transitions. Second operand 4 states. [2018-02-03 23:47:29,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:29,911 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2018-02-03 23:47:29,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:47:29,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-03 23:47:29,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:29,913 INFO L225 Difference]: With dead ends: 155 [2018-02-03 23:47:29,914 INFO L226 Difference]: Without dead ends: 155 [2018-02-03 23:47:29,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:47:29,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-03 23:47:29,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-02-03 23:47:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-03 23:47:29,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2018-02-03 23:47:29,922 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 8 [2018-02-03 23:47:29,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:29,923 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2018-02-03 23:47:29,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:47:29,923 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2018-02-03 23:47:29,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-03 23:47:29,923 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:29,924 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:47:29,924 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-03 23:47:29,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2080332291, now seen corresponding path program 1 times [2018-02-03 23:47:29,924 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:29,924 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:29,925 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:29,925 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:29,925 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:29,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:29,967 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:29,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:47:29,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:47:29,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:47:29,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:47:29,968 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 4 states. [2018-02-03 23:47:30,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:30,086 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2018-02-03 23:47:30,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:47:30,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-03 23:47:30,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:30,092 INFO L225 Difference]: With dead ends: 161 [2018-02-03 23:47:30,092 INFO L226 Difference]: Without dead ends: 161 [2018-02-03 23:47:30,092 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:47:30,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-03 23:47:30,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 140. [2018-02-03 23:47:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-03 23:47:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2018-02-03 23:47:30,098 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 15 [2018-02-03 23:47:30,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:30,098 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2018-02-03 23:47:30,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:47:30,098 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2018-02-03 23:47:30,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-03 23:47:30,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:30,098 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:47:30,098 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-03 23:47:30,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2080332290, now seen corresponding path program 1 times [2018-02-03 23:47:30,099 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:30,099 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:30,099 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:30,099 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:30,099 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:30,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:30,152 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:30,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:47:30,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:47:30,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:47:30,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:47:30,153 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand 5 states. [2018-02-03 23:47:30,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:30,305 INFO L93 Difference]: Finished difference Result 196 states and 214 transitions. [2018-02-03 23:47:30,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:47:30,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-03 23:47:30,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:30,307 INFO L225 Difference]: With dead ends: 196 [2018-02-03 23:47:30,307 INFO L226 Difference]: Without dead ends: 196 [2018-02-03 23:47:30,308 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-03 23:47:30,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-03 23:47:30,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 176. [2018-02-03 23:47:30,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-03 23:47:30,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 203 transitions. [2018-02-03 23:47:30,319 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 203 transitions. Word has length 15 [2018-02-03 23:47:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:30,320 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 203 transitions. [2018-02-03 23:47:30,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:47:30,320 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 203 transitions. [2018-02-03 23:47:30,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-03 23:47:30,320 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:30,320 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:47:30,321 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-03 23:47:30,321 INFO L82 PathProgramCache]: Analyzing trace with hash -2037600517, now seen corresponding path program 1 times [2018-02-03 23:47:30,321 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:30,321 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:30,322 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:30,322 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:30,322 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:30,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:30,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:30,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:47:30,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:47:30,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:47:30,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:47:30,355 INFO L87 Difference]: Start difference. First operand 176 states and 203 transitions. Second operand 4 states. [2018-02-03 23:47:30,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:30,456 INFO L93 Difference]: Finished difference Result 189 states and 216 transitions. [2018-02-03 23:47:30,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:47:30,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-03 23:47:30,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:30,458 INFO L225 Difference]: With dead ends: 189 [2018-02-03 23:47:30,458 INFO L226 Difference]: Without dead ends: 189 [2018-02-03 23:47:30,458 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:47:30,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-03 23:47:30,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 177. [2018-02-03 23:47:30,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-03 23:47:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 206 transitions. [2018-02-03 23:47:30,465 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 206 transitions. Word has length 17 [2018-02-03 23:47:30,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:30,465 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 206 transitions. [2018-02-03 23:47:30,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:47:30,465 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 206 transitions. [2018-02-03 23:47:30,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-03 23:47:30,465 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:30,466 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:47:30,466 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-03 23:47:30,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2037600516, now seen corresponding path program 1 times [2018-02-03 23:47:30,466 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:30,466 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:30,467 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:30,467 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:30,467 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:30,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:30,515 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:30,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:47:30,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:47:30,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:47:30,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:47:30,515 INFO L87 Difference]: Start difference. First operand 177 states and 206 transitions. Second operand 4 states. [2018-02-03 23:47:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:30,610 INFO L93 Difference]: Finished difference Result 179 states and 206 transitions. [2018-02-03 23:47:30,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:47:30,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-03 23:47:30,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:30,611 INFO L225 Difference]: With dead ends: 179 [2018-02-03 23:47:30,611 INFO L226 Difference]: Without dead ends: 179 [2018-02-03 23:47:30,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:47:30,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-03 23:47:30,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2018-02-03 23:47:30,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-03 23:47:30,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 203 transitions. [2018-02-03 23:47:30,616 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 203 transitions. Word has length 17 [2018-02-03 23:47:30,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:30,617 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 203 transitions. [2018-02-03 23:47:30,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:47:30,617 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 203 transitions. [2018-02-03 23:47:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-03 23:47:30,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:30,618 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-03 23:47:30,618 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-03 23:47:30,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1339674347, now seen corresponding path program 1 times [2018-02-03 23:47:30,618 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:30,618 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:30,619 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:30,619 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:30,619 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:30,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:30,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:30,656 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:30,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:47:30,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:47:30,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:47:30,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:47:30,657 INFO L87 Difference]: Start difference. First operand 175 states and 203 transitions. Second operand 4 states. [2018-02-03 23:47:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:30,672 INFO L93 Difference]: Finished difference Result 176 states and 203 transitions. [2018-02-03 23:47:30,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:47:30,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-03 23:47:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:30,673 INFO L225 Difference]: With dead ends: 176 [2018-02-03 23:47:30,673 INFO L226 Difference]: Without dead ends: 176 [2018-02-03 23:47:30,673 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-03 23:47:30,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-03 23:47:30,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-02-03 23:47:30,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-03 23:47:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 202 transitions. [2018-02-03 23:47:30,676 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 202 transitions. Word has length 22 [2018-02-03 23:47:30,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:30,676 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 202 transitions. [2018-02-03 23:47:30,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:47:30,677 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 202 transitions. [2018-02-03 23:47:30,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 23:47:30,677 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:30,677 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-03 23:47:30,677 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-03 23:47:30,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1419766941, now seen corresponding path program 1 times [2018-02-03 23:47:30,677 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:30,677 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:30,678 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:30,678 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:30,678 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:30,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:30,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:30,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:47:30,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:47:30,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:47:30,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:47:30,735 INFO L87 Difference]: Start difference. First operand 175 states and 202 transitions. Second operand 4 states. [2018-02-03 23:47:30,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:30,826 INFO L93 Difference]: Finished difference Result 190 states and 218 transitions. [2018-02-03 23:47:30,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:47:30,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-03 23:47:30,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:30,827 INFO L225 Difference]: With dead ends: 190 [2018-02-03 23:47:30,827 INFO L226 Difference]: Without dead ends: 190 [2018-02-03 23:47:30,827 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:47:30,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-03 23:47:30,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 174. [2018-02-03 23:47:30,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-03 23:47:30,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 202 transitions. [2018-02-03 23:47:30,829 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 202 transitions. Word has length 23 [2018-02-03 23:47:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:30,830 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 202 transitions. [2018-02-03 23:47:30,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:47:30,830 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2018-02-03 23:47:30,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 23:47:30,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:30,830 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-03 23:47:30,830 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-03 23:47:30,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1419766940, now seen corresponding path program 1 times [2018-02-03 23:47:30,831 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:30,831 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:30,831 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:30,831 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:30,831 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:30,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:30,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:30,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:30,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:47:30,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:47:30,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:47:30,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:47:30,880 INFO L87 Difference]: Start difference. First operand 174 states and 202 transitions. Second operand 5 states. [2018-02-03 23:47:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:30,998 INFO L93 Difference]: Finished difference Result 194 states and 223 transitions. [2018-02-03 23:47:30,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:47:30,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-03 23:47:30,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:30,999 INFO L225 Difference]: With dead ends: 194 [2018-02-03 23:47:30,999 INFO L226 Difference]: Without dead ends: 194 [2018-02-03 23:47:30,999 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-03 23:47:31,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-03 23:47:31,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2018-02-03 23:47:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-03 23:47:31,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 203 transitions. [2018-02-03 23:47:31,002 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 203 transitions. Word has length 23 [2018-02-03 23:47:31,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:31,003 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 203 transitions. [2018-02-03 23:47:31,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:47:31,003 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 203 transitions. [2018-02-03 23:47:31,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 23:47:31,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:31,003 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-03 23:47:31,003 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-03 23:47:31,003 INFO L82 PathProgramCache]: Analyzing trace with hash 916114990, now seen corresponding path program 1 times [2018-02-03 23:47:31,003 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:31,004 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:31,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:31,004 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:31,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:31,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:31,023 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-03 23:47:31,023 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:31,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:47:31,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:47:31,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:47:31,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:47:31,023 INFO L87 Difference]: Start difference. First operand 176 states and 203 transitions. Second operand 3 states. [2018-02-03 23:47:31,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:31,028 INFO L93 Difference]: Finished difference Result 178 states and 205 transitions. [2018-02-03 23:47:31,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:47:31,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-02-03 23:47:31,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:31,029 INFO L225 Difference]: With dead ends: 178 [2018-02-03 23:47:31,029 INFO L226 Difference]: Without dead ends: 178 [2018-02-03 23:47:31,029 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-03 23:47:31,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-03 23:47:31,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-02-03 23:47:31,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-03 23:47:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 205 transitions. [2018-02-03 23:47:31,033 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 205 transitions. Word has length 23 [2018-02-03 23:47:31,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:31,033 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 205 transitions. [2018-02-03 23:47:31,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:47:31,033 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 205 transitions. [2018-02-03 23:47:31,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-03 23:47:31,034 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:31,034 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-03 23:47:31,034 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-03 23:47:31,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1108120181, now seen corresponding path program 1 times [2018-02-03 23:47:31,034 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:31,035 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:31,035 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:31,035 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:31,035 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:31,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:31,148 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-03 23:47:31,148 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:31,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 23:47:31,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 23:47:31,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 23:47:31,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 23:47:31,149 INFO L87 Difference]: Start difference. First operand 178 states and 205 transitions. Second operand 6 states. [2018-02-03 23:47:31,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:31,366 INFO L93 Difference]: Finished difference Result 221 states and 254 transitions. [2018-02-03 23:47:31,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 23:47:31,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-03 23:47:31,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:31,367 INFO L225 Difference]: With dead ends: 221 [2018-02-03 23:47:31,368 INFO L226 Difference]: Without dead ends: 221 [2018-02-03 23:47:31,368 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-03 23:47:31,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-03 23:47:31,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 194. [2018-02-03 23:47:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-03 23:47:31,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 226 transitions. [2018-02-03 23:47:31,372 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 226 transitions. Word has length 25 [2018-02-03 23:47:31,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:31,372 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 226 transitions. [2018-02-03 23:47:31,372 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 23:47:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 226 transitions. [2018-02-03 23:47:31,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-03 23:47:31,373 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:31,373 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-03 23:47:31,373 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-03 23:47:31,373 INFO L82 PathProgramCache]: Analyzing trace with hash 561139669, now seen corresponding path program 1 times [2018-02-03 23:47:31,373 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:31,373 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:31,374 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:31,374 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:31,375 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:31,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:31,576 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:31,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-03 23:47:31,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 23:47:31,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 23:47:31,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:47:31,577 INFO L87 Difference]: Start difference. First operand 194 states and 226 transitions. Second operand 12 states. [2018-02-03 23:47:32,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:32,235 INFO L93 Difference]: Finished difference Result 210 states and 245 transitions. [2018-02-03 23:47:32,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-03 23:47:32,236 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-02-03 23:47:32,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:32,237 INFO L225 Difference]: With dead ends: 210 [2018-02-03 23:47:32,237 INFO L226 Difference]: Without dead ends: 210 [2018-02-03 23:47:32,237 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-03 23:47:32,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-03 23:47:32,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 195. [2018-02-03 23:47:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-03 23:47:32,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 228 transitions. [2018-02-03 23:47:32,241 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 228 transitions. Word has length 26 [2018-02-03 23:47:32,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:32,241 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 228 transitions. [2018-02-03 23:47:32,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 23:47:32,241 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 228 transitions. [2018-02-03 23:47:32,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-03 23:47:32,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:32,242 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-03 23:47:32,242 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-03 23:47:32,242 INFO L82 PathProgramCache]: Analyzing trace with hash 561139670, now seen corresponding path program 1 times [2018-02-03 23:47:32,242 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:32,243 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:32,243 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:32,243 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:32,244 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:32,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:32,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:32,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-03 23:47:32,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-03 23:47:32,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-03 23:47:32,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-03 23:47:32,476 INFO L87 Difference]: Start difference. First operand 195 states and 228 transitions. Second operand 13 states. [2018-02-03 23:47:33,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:33,015 INFO L93 Difference]: Finished difference Result 263 states and 291 transitions. [2018-02-03 23:47:33,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 23:47:33,015 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-02-03 23:47:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:33,016 INFO L225 Difference]: With dead ends: 263 [2018-02-03 23:47:33,016 INFO L226 Difference]: Without dead ends: 263 [2018-02-03 23:47:33,017 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-03 23:47:33,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-03 23:47:33,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 199. [2018-02-03 23:47:33,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-03 23:47:33,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 233 transitions. [2018-02-03 23:47:33,019 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 233 transitions. Word has length 26 [2018-02-03 23:47:33,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:33,019 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 233 transitions. [2018-02-03 23:47:33,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-03 23:47:33,020 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 233 transitions. [2018-02-03 23:47:33,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-03 23:47:33,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:33,020 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-03 23:47:33,020 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-03 23:47:33,020 INFO L82 PathProgramCache]: Analyzing trace with hash -106162311, now seen corresponding path program 1 times [2018-02-03 23:47:33,020 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:33,021 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:33,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:33,021 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:33,022 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:33,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:33,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:33,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:33,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:47:33,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:47:33,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:47:33,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:47:33,057 INFO L87 Difference]: Start difference. First operand 199 states and 233 transitions. Second operand 5 states. [2018-02-03 23:47:33,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:33,209 INFO L93 Difference]: Finished difference Result 292 states and 344 transitions. [2018-02-03 23:47:33,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:47:33,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-03 23:47:33,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:33,210 INFO L225 Difference]: With dead ends: 292 [2018-02-03 23:47:33,210 INFO L226 Difference]: Without dead ends: 292 [2018-02-03 23:47:33,210 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-03 23:47:33,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-02-03 23:47:33,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 198. [2018-02-03 23:47:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-03 23:47:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 231 transitions. [2018-02-03 23:47:33,213 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 231 transitions. Word has length 26 [2018-02-03 23:47:33,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:33,213 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 231 transitions. [2018-02-03 23:47:33,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:47:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 231 transitions. [2018-02-03 23:47:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-03 23:47:33,213 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:33,213 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-03 23:47:33,213 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-03 23:47:33,213 INFO L82 PathProgramCache]: Analyzing trace with hash -106162310, now seen corresponding path program 1 times [2018-02-03 23:47:33,213 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:33,214 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:33,214 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:33,214 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:33,214 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:33,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:33,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:33,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:47:33,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:47:33,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:47:33,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:47:33,257 INFO L87 Difference]: Start difference. First operand 198 states and 231 transitions. Second operand 5 states. [2018-02-03 23:47:33,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:33,475 INFO L93 Difference]: Finished difference Result 281 states and 332 transitions. [2018-02-03 23:47:33,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:47:33,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-03 23:47:33,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:33,477 INFO L225 Difference]: With dead ends: 281 [2018-02-03 23:47:33,477 INFO L226 Difference]: Without dead ends: 281 [2018-02-03 23:47:33,477 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-03 23:47:33,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-02-03 23:47:33,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 197. [2018-02-03 23:47:33,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-03 23:47:33,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 229 transitions. [2018-02-03 23:47:33,481 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 229 transitions. Word has length 26 [2018-02-03 23:47:33,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:33,481 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 229 transitions. [2018-02-03 23:47:33,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:47:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 229 transitions. [2018-02-03 23:47:33,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-03 23:47:33,482 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:33,482 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-03 23:47:33,482 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-03 23:47:33,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1585416537, now seen corresponding path program 1 times [2018-02-03 23:47:33,482 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:33,482 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:33,483 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:33,483 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:33,483 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:33,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:33,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:33,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 23:47:33,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 23:47:33,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 23:47:33,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:47:33,563 INFO L87 Difference]: Start difference. First operand 197 states and 229 transitions. Second operand 9 states. [2018-02-03 23:47:33,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:33,773 INFO L93 Difference]: Finished difference Result 243 states and 284 transitions. [2018-02-03 23:47:33,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 23:47:33,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-02-03 23:47:33,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:33,774 INFO L225 Difference]: With dead ends: 243 [2018-02-03 23:47:33,774 INFO L226 Difference]: Without dead ends: 243 [2018-02-03 23:47:33,774 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-03 23:47:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-03 23:47:33,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 196. [2018-02-03 23:47:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-03 23:47:33,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 227 transitions. [2018-02-03 23:47:33,778 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 227 transitions. Word has length 29 [2018-02-03 23:47:33,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:33,778 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 227 transitions. [2018-02-03 23:47:33,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 23:47:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 227 transitions. [2018-02-03 23:47:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-03 23:47:33,779 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:33,779 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-03 23:47:33,779 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-03 23:47:33,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1585416536, now seen corresponding path program 1 times [2018-02-03 23:47:33,780 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:33,780 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:33,780 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:33,781 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:33,781 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:33,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:33,888 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:33,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 23:47:33,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 23:47:33,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 23:47:33,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:47:33,889 INFO L87 Difference]: Start difference. First operand 196 states and 227 transitions. Second operand 9 states. [2018-02-03 23:47:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:34,332 INFO L93 Difference]: Finished difference Result 242 states and 282 transitions. [2018-02-03 23:47:34,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 23:47:34,333 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-02-03 23:47:34,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:34,333 INFO L225 Difference]: With dead ends: 242 [2018-02-03 23:47:34,333 INFO L226 Difference]: Without dead ends: 242 [2018-02-03 23:47:34,333 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-03 23:47:34,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-03 23:47:34,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 195. [2018-02-03 23:47:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-03 23:47:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 225 transitions. [2018-02-03 23:47:34,336 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 225 transitions. Word has length 29 [2018-02-03 23:47:34,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:34,336 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 225 transitions. [2018-02-03 23:47:34,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 23:47:34,336 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 225 transitions. [2018-02-03 23:47:34,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 23:47:34,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:34,337 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:47:34,337 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-03 23:47:34,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2109118679, now seen corresponding path program 1 times [2018-02-03 23:47:34,337 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:34,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:34,338 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:34,338 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:34,338 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:34,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:34,359 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:34,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:47:34,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:47:34,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:47:34,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:47:34,359 INFO L87 Difference]: Start difference. First operand 195 states and 225 transitions. Second operand 4 states. [2018-02-03 23:47:34,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:34,480 INFO L93 Difference]: Finished difference Result 211 states and 242 transitions. [2018-02-03 23:47:34,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:47:34,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-02-03 23:47:34,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:34,481 INFO L225 Difference]: With dead ends: 211 [2018-02-03 23:47:34,481 INFO L226 Difference]: Without dead ends: 211 [2018-02-03 23:47:34,482 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:47:34,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-03 23:47:34,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-02-03 23:47:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-03 23:47:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 224 transitions. [2018-02-03 23:47:34,485 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 224 transitions. Word has length 30 [2018-02-03 23:47:34,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:34,485 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 224 transitions. [2018-02-03 23:47:34,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:47:34,485 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 224 transitions. [2018-02-03 23:47:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 23:47:34,486 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:34,486 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:47:34,486 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-03 23:47:34,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2109118680, now seen corresponding path program 1 times [2018-02-03 23:47:34,486 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:34,488 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:34,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:34,489 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:34,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:34,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:34,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:34,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:34,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:47:34,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:47:34,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:47:34,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:47:34,532 INFO L87 Difference]: Start difference. First operand 194 states and 224 transitions. Second operand 4 states. [2018-02-03 23:47:34,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:34,679 INFO L93 Difference]: Finished difference Result 239 states and 272 transitions. [2018-02-03 23:47:34,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:47:34,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-02-03 23:47:34,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:34,681 INFO L225 Difference]: With dead ends: 239 [2018-02-03 23:47:34,681 INFO L226 Difference]: Without dead ends: 239 [2018-02-03 23:47:34,681 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-03 23:47:34,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-03 23:47:34,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 192. [2018-02-03 23:47:34,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-03 23:47:34,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 222 transitions. [2018-02-03 23:47:34,684 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 222 transitions. Word has length 30 [2018-02-03 23:47:34,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:34,684 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 222 transitions. [2018-02-03 23:47:34,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:47:34,684 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 222 transitions. [2018-02-03 23:47:34,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 23:47:34,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:34,685 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:47:34,685 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-03 23:47:34,685 INFO L82 PathProgramCache]: Analyzing trace with hash -160241763, now seen corresponding path program 1 times [2018-02-03 23:47:34,685 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:34,685 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:34,686 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:34,686 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:34,686 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:34,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:34,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:34,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:34,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:47:34,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:47:34,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:47:34,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:47:34,707 INFO L87 Difference]: Start difference. First operand 192 states and 222 transitions. Second operand 5 states. [2018-02-03 23:47:34,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:34,852 INFO L93 Difference]: Finished difference Result 283 states and 329 transitions. [2018-02-03 23:47:34,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:47:34,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-03 23:47:34,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:34,853 INFO L225 Difference]: With dead ends: 283 [2018-02-03 23:47:34,854 INFO L226 Difference]: Without dead ends: 283 [2018-02-03 23:47:34,854 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-03 23:47:34,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-03 23:47:34,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 191. [2018-02-03 23:47:34,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-03 23:47:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 220 transitions. [2018-02-03 23:47:34,857 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 220 transitions. Word has length 30 [2018-02-03 23:47:34,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:34,857 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 220 transitions. [2018-02-03 23:47:34,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:47:34,858 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 220 transitions. [2018-02-03 23:47:34,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 23:47:34,858 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:34,858 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:47:34,858 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-03 23:47:34,858 INFO L82 PathProgramCache]: Analyzing trace with hash -160241762, now seen corresponding path program 1 times [2018-02-03 23:47:34,858 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:34,859 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:34,859 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:34,859 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:34,859 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:34,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:34,904 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:34,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:47:34,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:47:34,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:47:34,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:47:34,905 INFO L87 Difference]: Start difference. First operand 191 states and 220 transitions. Second operand 5 states. [2018-02-03 23:47:35,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:35,061 INFO L93 Difference]: Finished difference Result 272 states and 317 transitions. [2018-02-03 23:47:35,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:47:35,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-03 23:47:35,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:35,062 INFO L225 Difference]: With dead ends: 272 [2018-02-03 23:47:35,062 INFO L226 Difference]: Without dead ends: 272 [2018-02-03 23:47:35,063 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-03 23:47:35,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-02-03 23:47:35,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 190. [2018-02-03 23:47:35,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-02-03 23:47:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 218 transitions. [2018-02-03 23:47:35,066 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 218 transitions. Word has length 30 [2018-02-03 23:47:35,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:35,066 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 218 transitions. [2018-02-03 23:47:35,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:47:35,067 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 218 transitions. [2018-02-03 23:47:35,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-03 23:47:35,067 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:35,067 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-03 23:47:35,067 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-03 23:47:35,068 INFO L82 PathProgramCache]: Analyzing trace with hash 958169774, now seen corresponding path program 1 times [2018-02-03 23:47:35,068 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:35,068 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:35,068 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:35,068 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:35,069 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:35,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:35,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:35,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:35,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:47:35,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:47:35,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:47:35,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:47:35,106 INFO L87 Difference]: Start difference. First operand 190 states and 218 transitions. Second operand 4 states. [2018-02-03 23:47:35,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:35,199 INFO L93 Difference]: Finished difference Result 187 states and 216 transitions. [2018-02-03 23:47:35,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:47:35,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-02-03 23:47:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:35,201 INFO L225 Difference]: With dead ends: 187 [2018-02-03 23:47:35,201 INFO L226 Difference]: Without dead ends: 187 [2018-02-03 23:47:35,201 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:47:35,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-03 23:47:35,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 182. [2018-02-03 23:47:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-03 23:47:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 210 transitions. [2018-02-03 23:47:35,203 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 210 transitions. Word has length 31 [2018-02-03 23:47:35,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:35,203 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 210 transitions. [2018-02-03 23:47:35,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:47:35,203 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 210 transitions. [2018-02-03 23:47:35,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-03 23:47:35,203 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:35,203 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-03 23:47:35,203 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-03 23:47:35,204 INFO L82 PathProgramCache]: Analyzing trace with hash 53737817, now seen corresponding path program 1 times [2018-02-03 23:47:35,204 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:35,204 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:35,204 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:35,204 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:35,204 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:35,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:35,227 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:35,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:47:35,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:47:35,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:47:35,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:47:35,228 INFO L87 Difference]: Start difference. First operand 182 states and 210 transitions. Second operand 4 states. [2018-02-03 23:47:35,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:35,310 INFO L93 Difference]: Finished difference Result 190 states and 219 transitions. [2018-02-03 23:47:35,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:47:35,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-02-03 23:47:35,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:35,312 INFO L225 Difference]: With dead ends: 190 [2018-02-03 23:47:35,312 INFO L226 Difference]: Without dead ends: 190 [2018-02-03 23:47:35,312 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:47:35,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-03 23:47:35,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 181. [2018-02-03 23:47:35,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-03 23:47:35,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 209 transitions. [2018-02-03 23:47:35,315 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 209 transitions. Word has length 32 [2018-02-03 23:47:35,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:35,315 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 209 transitions. [2018-02-03 23:47:35,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:47:35,315 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 209 transitions. [2018-02-03 23:47:35,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-03 23:47:35,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:35,316 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:47:35,316 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-03 23:47:35,316 INFO L82 PathProgramCache]: Analyzing trace with hash 53737818, now seen corresponding path program 1 times [2018-02-03 23:47:35,316 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:35,316 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:35,317 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:35,317 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:35,317 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:35,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:35,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:35,350 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:35,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:47:35,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:47:35,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:47:35,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:47:35,351 INFO L87 Difference]: Start difference. First operand 181 states and 209 transitions. Second operand 4 states. [2018-02-03 23:47:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:35,466 INFO L93 Difference]: Finished difference Result 217 states and 247 transitions. [2018-02-03 23:47:35,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:47:35,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-02-03 23:47:35,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:35,468 INFO L225 Difference]: With dead ends: 217 [2018-02-03 23:47:35,468 INFO L226 Difference]: Without dead ends: 217 [2018-02-03 23:47:35,468 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-03 23:47:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-03 23:47:35,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 179. [2018-02-03 23:47:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-03 23:47:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 207 transitions. [2018-02-03 23:47:35,471 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 207 transitions. Word has length 32 [2018-02-03 23:47:35,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:35,471 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 207 transitions. [2018-02-03 23:47:35,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:47:35,471 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 207 transitions. [2018-02-03 23:47:35,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-03 23:47:35,472 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:35,472 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-03 23:47:35,472 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-03 23:47:35,472 INFO L82 PathProgramCache]: Analyzing trace with hash 611367904, now seen corresponding path program 1 times [2018-02-03 23:47:35,472 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:35,473 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:35,473 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:35,473 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:35,473 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:35,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:35,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:35,575 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:35,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-03 23:47:35,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 23:47:35,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 23:47:35,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-03 23:47:35,575 INFO L87 Difference]: Start difference. First operand 179 states and 207 transitions. Second operand 10 states. [2018-02-03 23:47:35,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:35,945 INFO L93 Difference]: Finished difference Result 227 states and 263 transitions. [2018-02-03 23:47:35,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 23:47:35,945 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-02-03 23:47:35,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:35,946 INFO L225 Difference]: With dead ends: 227 [2018-02-03 23:47:35,946 INFO L226 Difference]: Without dead ends: 227 [2018-02-03 23:47:35,947 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-03 23:47:35,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-03 23:47:35,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 178. [2018-02-03 23:47:35,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-03 23:47:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 205 transitions. [2018-02-03 23:47:35,949 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 205 transitions. Word has length 32 [2018-02-03 23:47:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:35,949 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 205 transitions. [2018-02-03 23:47:35,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 23:47:35,950 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 205 transitions. [2018-02-03 23:47:35,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-03 23:47:35,950 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:35,950 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-03 23:47:35,950 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-03 23:47:35,950 INFO L82 PathProgramCache]: Analyzing trace with hash 611367905, now seen corresponding path program 1 times [2018-02-03 23:47:35,950 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:35,951 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:35,951 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:35,951 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:35,951 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:35,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:36,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:36,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:36,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-03 23:47:36,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 23:47:36,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 23:47:36,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-03 23:47:36,114 INFO L87 Difference]: Start difference. First operand 178 states and 205 transitions. Second operand 10 states. [2018-02-03 23:47:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:36,446 INFO L93 Difference]: Finished difference Result 222 states and 256 transitions. [2018-02-03 23:47:36,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 23:47:36,446 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-02-03 23:47:36,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:36,447 INFO L225 Difference]: With dead ends: 222 [2018-02-03 23:47:36,447 INFO L226 Difference]: Without dead ends: 222 [2018-02-03 23:47:36,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-02-03 23:47:36,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-03 23:47:36,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 177. [2018-02-03 23:47:36,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-03 23:47:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 203 transitions. [2018-02-03 23:47:36,450 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 203 transitions. Word has length 32 [2018-02-03 23:47:36,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:36,451 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 203 transitions. [2018-02-03 23:47:36,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 23:47:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 203 transitions. [2018-02-03 23:47:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-03 23:47:36,451 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:36,451 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:47:36,452 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-03 23:47:36,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1665872513, now seen corresponding path program 1 times [2018-02-03 23:47:36,452 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:36,452 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:36,453 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:36,453 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:36,453 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:36,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:36,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-03 23:47:36,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:36,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:47:36,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:47:36,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:47:36,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:47:36,506 INFO L87 Difference]: Start difference. First operand 177 states and 203 transitions. Second operand 5 states. [2018-02-03 23:47:36,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:36,631 INFO L93 Difference]: Finished difference Result 207 states and 238 transitions. [2018-02-03 23:47:36,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:47:36,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-03 23:47:36,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:36,632 INFO L225 Difference]: With dead ends: 207 [2018-02-03 23:47:36,632 INFO L226 Difference]: Without dead ends: 207 [2018-02-03 23:47:36,633 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-03 23:47:36,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-03 23:47:36,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 155. [2018-02-03 23:47:36,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-03 23:47:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 175 transitions. [2018-02-03 23:47:36,635 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 175 transitions. Word has length 33 [2018-02-03 23:47:36,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:36,636 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 175 transitions. [2018-02-03 23:47:36,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:47:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 175 transitions. [2018-02-03 23:47:36,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-03 23:47:36,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:36,636 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-03 23:47:36,636 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-03 23:47:36,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1679203151, now seen corresponding path program 1 times [2018-02-03 23:47:36,637 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:36,637 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:36,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:36,637 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:36,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:36,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:36,701 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-03 23:47:36,701 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:47:36,701 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:47:36,713 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:36,758 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:47:36,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:47:36,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:47:36,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:36,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:36,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:47:36,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:47:36,813 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:36,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:36,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:36,817 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-02-03 23:47:36,825 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-03 23:47:36,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:36,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-03 23:47:36,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:36,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:36,852 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-03 23:47:36,858 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:36,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-03 23:47:36,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:36,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:36,871 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-03 23:47:36,871 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-02-03 23:47:36,898 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-03 23:47:36,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-03 23:47:36,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:36,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:36,911 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-03 23:47:36,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-03 23:47:36,917 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:36,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:36,921 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-03 23:47:36,921 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-02-03 23:47:36,925 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-03 23:47:36,957 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:47:36,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-02-03 23:47:36,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:47:36,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:47:36,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:47:36,958 INFO L87 Difference]: Start difference. First operand 155 states and 175 transitions. Second operand 5 states. [2018-02-03 23:47:37,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:37,039 INFO L93 Difference]: Finished difference Result 169 states and 189 transitions. [2018-02-03 23:47:37,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:47:37,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-02-03 23:47:37,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:37,040 INFO L225 Difference]: With dead ends: 169 [2018-02-03 23:47:37,040 INFO L226 Difference]: Without dead ends: 169 [2018-02-03 23:47:37,040 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-03 23:47:37,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-03 23:47:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 157. [2018-02-03 23:47:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-03 23:47:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2018-02-03 23:47:37,044 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 33 [2018-02-03 23:47:37,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:37,044 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2018-02-03 23:47:37,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:47:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2018-02-03 23:47:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-03 23:47:37,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:37,045 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:47:37,045 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-03 23:47:37,045 INFO L82 PathProgramCache]: Analyzing trace with hash -2053594356, now seen corresponding path program 1 times [2018-02-03 23:47:37,045 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:37,045 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:37,046 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:37,046 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:37,046 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:37,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:37,134 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:37,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 23:47:37,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 23:47:37,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 23:47:37,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:47:37,135 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand 9 states. [2018-02-03 23:47:37,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:37,447 INFO L93 Difference]: Finished difference Result 164 states and 186 transitions. [2018-02-03 23:47:37,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 23:47:37,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-03 23:47:37,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:37,448 INFO L225 Difference]: With dead ends: 164 [2018-02-03 23:47:37,448 INFO L226 Difference]: Without dead ends: 164 [2018-02-03 23:47:37,449 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-03 23:47:37,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-03 23:47:37,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2018-02-03 23:47:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-03 23:47:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 176 transitions. [2018-02-03 23:47:37,452 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 176 transitions. Word has length 33 [2018-02-03 23:47:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:37,452 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 176 transitions. [2018-02-03 23:47:37,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 23:47:37,453 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 176 transitions. [2018-02-03 23:47:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-03 23:47:37,453 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:37,453 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:47:37,453 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-03 23:47:37,453 INFO L82 PathProgramCache]: Analyzing trace with hash -2053594355, now seen corresponding path program 1 times [2018-02-03 23:47:37,454 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:37,454 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:37,454 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:37,454 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:37,454 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:37,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:37,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:37,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:37,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 23:47:37,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 23:47:37,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 23:47:37,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:47:37,573 INFO L87 Difference]: Start difference. First operand 156 states and 176 transitions. Second operand 9 states. [2018-02-03 23:47:37,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:37,802 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2018-02-03 23:47:37,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 23:47:37,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-03 23:47:37,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:37,803 INFO L225 Difference]: With dead ends: 163 [2018-02-03 23:47:37,803 INFO L226 Difference]: Without dead ends: 163 [2018-02-03 23:47:37,804 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-03 23:47:37,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-03 23:47:37,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2018-02-03 23:47:37,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-03 23:47:37,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 175 transitions. [2018-02-03 23:47:37,805 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 175 transitions. Word has length 33 [2018-02-03 23:47:37,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:37,805 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 175 transitions. [2018-02-03 23:47:37,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 23:47:37,806 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 175 transitions. [2018-02-03 23:47:37,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-03 23:47:37,806 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:37,806 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-03 23:47:37,806 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-03 23:47:37,806 INFO L82 PathProgramCache]: Analyzing trace with hash 515690238, now seen corresponding path program 1 times [2018-02-03 23:47:37,806 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:37,806 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:37,807 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:37,807 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:37,807 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:37,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:38,102 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-03 23:47:38,102 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:47:38,102 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:47:38,107 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:38,124 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:47:38,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-03 23:47:38,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-03 23:47:38,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:38,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:38,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:38,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:57 [2018-02-03 23:47:38,312 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-03 23:47:38,322 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-03 23:47:38,324 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-03 23:47:38,341 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-03 23:47:38,366 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-03 23:47:38,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:72 [2018-02-03 23:47:38,553 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-03 23:47:38,567 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-03 23:47:38,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:47:38,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2018-02-03 23:47:38,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-03 23:47:38,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-03 23:47:38,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=584, Unknown=3, NotChecked=48, Total=702 [2018-02-03 23:47:38,587 INFO L87 Difference]: Start difference. First operand 155 states and 175 transitions. Second operand 27 states. [2018-02-03 23:47:40,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:40,138 INFO L93 Difference]: Finished difference Result 184 states and 206 transitions. [2018-02-03 23:47:40,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-03 23:47:40,138 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2018-02-03 23:47:40,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:40,139 INFO L225 Difference]: With dead ends: 184 [2018-02-03 23:47:40,139 INFO L226 Difference]: Without dead ends: 179 [2018-02-03 23:47:40,139 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-03 23:47:40,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-03 23:47:40,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 171. [2018-02-03 23:47:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-03 23:47:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 192 transitions. [2018-02-03 23:47:40,142 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 192 transitions. Word has length 34 [2018-02-03 23:47:40,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:40,142 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 192 transitions. [2018-02-03 23:47:40,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-03 23:47:40,142 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 192 transitions. [2018-02-03 23:47:40,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-03 23:47:40,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:40,143 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:47:40,143 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-03 23:47:40,143 INFO L82 PathProgramCache]: Analyzing trace with hash 483224159, now seen corresponding path program 1 times [2018-02-03 23:47:40,143 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:40,143 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:40,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:40,144 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:40,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:40,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:40,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:40,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:40,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-03 23:47:40,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-03 23:47:40,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-03 23:47:40,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-02-03 23:47:40,654 INFO L87 Difference]: Start difference. First operand 171 states and 192 transitions. Second operand 16 states. [2018-02-03 23:47:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:41,835 INFO L93 Difference]: Finished difference Result 275 states and 304 transitions. [2018-02-03 23:47:41,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-03 23:47:41,868 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-02-03 23:47:41,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:41,869 INFO L225 Difference]: With dead ends: 275 [2018-02-03 23:47:41,869 INFO L226 Difference]: Without dead ends: 275 [2018-02-03 23:47:41,870 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-03 23:47:41,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-03 23:47:41,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 186. [2018-02-03 23:47:41,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-03 23:47:41,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2018-02-03 23:47:41,873 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 34 [2018-02-03 23:47:41,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:41,873 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2018-02-03 23:47:41,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-03 23:47:41,873 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2018-02-03 23:47:41,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-03 23:47:41,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:41,874 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:47:41,874 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-03 23:47:41,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1115187100, now seen corresponding path program 1 times [2018-02-03 23:47:41,874 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:41,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:41,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:41,875 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:41,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:41,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:41,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:41,931 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:41,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-03 23:47:41,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 23:47:41,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 23:47:41,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-03 23:47:41,932 INFO L87 Difference]: Start difference. First operand 186 states and 208 transitions. Second operand 10 states. [2018-02-03 23:47:42,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:42,123 INFO L93 Difference]: Finished difference Result 193 states and 217 transitions. [2018-02-03 23:47:42,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 23:47:42,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-02-03 23:47:42,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:42,123 INFO L225 Difference]: With dead ends: 193 [2018-02-03 23:47:42,124 INFO L226 Difference]: Without dead ends: 193 [2018-02-03 23:47:42,124 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-03 23:47:42,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-03 23:47:42,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185. [2018-02-03 23:47:42,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-03 23:47:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2018-02-03 23:47:42,127 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 36 [2018-02-03 23:47:42,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:42,127 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2018-02-03 23:47:42,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 23:47:42,127 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2018-02-03 23:47:42,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-03 23:47:42,128 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:42,128 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:47:42,128 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-03 23:47:42,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1115187099, now seen corresponding path program 1 times [2018-02-03 23:47:42,128 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:42,129 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:42,129 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:42,129 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:42,129 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:42,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:47:42,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:42,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-03 23:47:42,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 23:47:42,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 23:47:42,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-03 23:47:42,284 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand 10 states. [2018-02-03 23:47:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:42,499 INFO L93 Difference]: Finished difference Result 192 states and 216 transitions. [2018-02-03 23:47:42,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 23:47:42,499 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-02-03 23:47:42,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:42,500 INFO L225 Difference]: With dead ends: 192 [2018-02-03 23:47:42,500 INFO L226 Difference]: Without dead ends: 192 [2018-02-03 23:47:42,500 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-03 23:47:42,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-03 23:47:42,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 184. [2018-02-03 23:47:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-03 23:47:42,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2018-02-03 23:47:42,502 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 36 [2018-02-03 23:47:42,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:42,503 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2018-02-03 23:47:42,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 23:47:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2018-02-03 23:47:42,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-03 23:47:42,503 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:42,503 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-03 23:47:42,503 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-03 23:47:42,503 INFO L82 PathProgramCache]: Analyzing trace with hash 896049480, now seen corresponding path program 1 times [2018-02-03 23:47:42,503 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:42,503 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:42,504 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:42,504 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:42,504 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:42,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:42,555 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-03 23:47:42,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:42,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 23:47:42,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 23:47:42,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 23:47:42,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:47:42,556 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand 7 states. [2018-02-03 23:47:42,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:42,723 INFO L93 Difference]: Finished difference Result 202 states and 225 transitions. [2018-02-03 23:47:42,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 23:47:42,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-03 23:47:42,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:42,724 INFO L225 Difference]: With dead ends: 202 [2018-02-03 23:47:42,724 INFO L226 Difference]: Without dead ends: 202 [2018-02-03 23:47:42,724 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-03 23:47:42,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-03 23:47:42,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 191. [2018-02-03 23:47:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-03 23:47:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 217 transitions. [2018-02-03 23:47:42,726 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 217 transitions. Word has length 39 [2018-02-03 23:47:42,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:42,726 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 217 transitions. [2018-02-03 23:47:42,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 23:47:42,726 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 217 transitions. [2018-02-03 23:47:42,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-03 23:47:42,727 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:42,727 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-03 23:47:42,727 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-03 23:47:42,727 INFO L82 PathProgramCache]: Analyzing trace with hash 896049481, now seen corresponding path program 1 times [2018-02-03 23:47:42,727 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:42,727 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:42,728 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:42,728 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:42,728 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:42,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:42,776 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-03 23:47:42,776 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:42,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:47:42,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:47:42,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:47:42,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:47:42,777 INFO L87 Difference]: Start difference. First operand 191 states and 217 transitions. Second operand 5 states. [2018-02-03 23:47:42,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:42,926 INFO L93 Difference]: Finished difference Result 246 states and 272 transitions. [2018-02-03 23:47:42,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:47:42,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-03 23:47:42,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:42,927 INFO L225 Difference]: With dead ends: 246 [2018-02-03 23:47:42,927 INFO L226 Difference]: Without dead ends: 246 [2018-02-03 23:47:42,928 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-03 23:47:42,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-03 23:47:42,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 193. [2018-02-03 23:47:42,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-03 23:47:42,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 217 transitions. [2018-02-03 23:47:42,930 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 217 transitions. Word has length 39 [2018-02-03 23:47:42,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:42,930 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 217 transitions. [2018-02-03 23:47:42,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:47:42,931 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 217 transitions. [2018-02-03 23:47:42,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-03 23:47:42,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:42,931 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-03 23:47:42,931 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-03 23:47:42,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1751566696, now seen corresponding path program 1 times [2018-02-03 23:47:42,932 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:42,932 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:42,932 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:42,932 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:42,932 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:42,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:42,980 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-03 23:47:42,981 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:42,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 23:47:42,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 23:47:42,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 23:47:42,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-03 23:47:42,981 INFO L87 Difference]: Start difference. First operand 193 states and 217 transitions. Second operand 7 states. [2018-02-03 23:47:43,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:43,225 INFO L93 Difference]: Finished difference Result 237 states and 263 transitions. [2018-02-03 23:47:43,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 23:47:43,225 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-03 23:47:43,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:43,226 INFO L225 Difference]: With dead ends: 237 [2018-02-03 23:47:43,226 INFO L226 Difference]: Without dead ends: 237 [2018-02-03 23:47:43,226 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-02-03 23:47:43,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-02-03 23:47:43,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 201. [2018-02-03 23:47:43,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-03 23:47:43,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 231 transitions. [2018-02-03 23:47:43,229 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 231 transitions. Word has length 39 [2018-02-03 23:47:43,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:43,229 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 231 transitions. [2018-02-03 23:47:43,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 23:47:43,229 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2018-02-03 23:47:43,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-03 23:47:43,230 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:43,230 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-03 23:47:43,230 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-03 23:47:43,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1751566697, now seen corresponding path program 1 times [2018-02-03 23:47:43,230 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:43,230 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:43,231 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:43,231 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:43,231 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:43,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:43,274 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-03 23:47:43,274 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:43,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 23:47:43,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:47:43,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:47:43,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:47:43,275 INFO L87 Difference]: Start difference. First operand 201 states and 231 transitions. Second operand 5 states. [2018-02-03 23:47:43,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:43,408 INFO L93 Difference]: Finished difference Result 278 states and 309 transitions. [2018-02-03 23:47:43,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:47:43,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-03 23:47:43,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:43,409 INFO L225 Difference]: With dead ends: 278 [2018-02-03 23:47:43,409 INFO L226 Difference]: Without dead ends: 278 [2018-02-03 23:47:43,409 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-03 23:47:43,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-02-03 23:47:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 194. [2018-02-03 23:47:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-03 23:47:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 220 transitions. [2018-02-03 23:47:43,411 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 220 transitions. Word has length 39 [2018-02-03 23:47:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:43,411 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 220 transitions. [2018-02-03 23:47:43,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:47:43,412 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 220 transitions. [2018-02-03 23:47:43,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-03 23:47:43,412 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:43,412 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-03 23:47:43,412 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-03 23:47:43,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2007730213, now seen corresponding path program 1 times [2018-02-03 23:47:43,412 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:43,412 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:43,413 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:43,413 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:43,413 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:43,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:43,439 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-03 23:47:43,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:43,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 23:47:43,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:47:43,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:47:43,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:47:43,440 INFO L87 Difference]: Start difference. First operand 194 states and 220 transitions. Second operand 5 states. [2018-02-03 23:47:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:43,488 INFO L93 Difference]: Finished difference Result 263 states and 297 transitions. [2018-02-03 23:47:43,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 23:47:43,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-02-03 23:47:43,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:43,489 INFO L225 Difference]: With dead ends: 263 [2018-02-03 23:47:43,489 INFO L226 Difference]: Without dead ends: 263 [2018-02-03 23:47:43,490 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-03 23:47:43,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-03 23:47:43,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 198. [2018-02-03 23:47:43,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-03 23:47:43,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 225 transitions. [2018-02-03 23:47:43,493 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 225 transitions. Word has length 40 [2018-02-03 23:47:43,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:43,493 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 225 transitions. [2018-02-03 23:47:43,493 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:47:43,493 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 225 transitions. [2018-02-03 23:47:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-03 23:47:43,494 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:43,494 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-03 23:47:43,494 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-03 23:47:43,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1536007163, now seen corresponding path program 1 times [2018-02-03 23:47:43,494 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:43,494 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:43,495 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:43,495 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:43,495 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:43,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:43,519 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-03 23:47:43,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:43,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 23:47:43,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 23:47:43,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 23:47:43,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:47:43,520 INFO L87 Difference]: Start difference. First operand 198 states and 225 transitions. Second operand 5 states. [2018-02-03 23:47:43,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:43,579 INFO L93 Difference]: Finished difference Result 275 states and 304 transitions. [2018-02-03 23:47:43,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 23:47:43,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-02-03 23:47:43,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:43,580 INFO L225 Difference]: With dead ends: 275 [2018-02-03 23:47:43,580 INFO L226 Difference]: Without dead ends: 275 [2018-02-03 23:47:43,580 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-03 23:47:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-03 23:47:43,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 194. [2018-02-03 23:47:43,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-03 23:47:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 219 transitions. [2018-02-03 23:47:43,583 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 219 transitions. Word has length 40 [2018-02-03 23:47:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:43,584 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 219 transitions. [2018-02-03 23:47:43,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 23:47:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 219 transitions. [2018-02-03 23:47:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-03 23:47:43,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:43,584 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-03 23:47:43,584 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-03 23:47:43,585 INFO L82 PathProgramCache]: Analyzing trace with hash 720428047, now seen corresponding path program 1 times [2018-02-03 23:47:43,585 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:43,585 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:43,585 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:43,585 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:43,586 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:43,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:44,006 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-03 23:47:44,006 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:47:44,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-03 23:47:44,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-03 23:47:44,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-03 23:47:44,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-02-03 23:47:44,007 INFO L87 Difference]: Start difference. First operand 194 states and 219 transitions. Second operand 18 states. [2018-02-03 23:47:44,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:44,805 INFO L93 Difference]: Finished difference Result 220 states and 245 transitions. [2018-02-03 23:47:44,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-03 23:47:44,806 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2018-02-03 23:47:44,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:44,806 INFO L225 Difference]: With dead ends: 220 [2018-02-03 23:47:44,806 INFO L226 Difference]: Without dead ends: 211 [2018-02-03 23:47:44,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=266, Invalid=1216, Unknown=0, NotChecked=0, Total=1482 [2018-02-03 23:47:44,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-03 23:47:44,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 192. [2018-02-03 23:47:44,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-03 23:47:44,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 216 transitions. [2018-02-03 23:47:44,809 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 216 transitions. Word has length 44 [2018-02-03 23:47:44,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:44,809 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 216 transitions. [2018-02-03 23:47:44,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-03 23:47:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 216 transitions. [2018-02-03 23:47:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-03 23:47:44,810 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:44,810 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-03 23:47:44,810 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-03 23:47:44,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1624848401, now seen corresponding path program 1 times [2018-02-03 23:47:44,810 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:44,810 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:44,811 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:44,811 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:44,811 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:44,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:45,368 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-03 23:47:45,368 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:47:45,368 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:47:45,373 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:45,392 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:47:45,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:47:45,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:47:45,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:47:45,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:47:45,412 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,413 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,418 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-02-03 23:47:45,429 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-03 23:47:45,435 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:45,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-03 23:47:45,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,450 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-03 23:47:45,455 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:45,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-03 23:47:45,455 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,465 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:41 [2018-02-03 23:47:45,490 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-03 23:47:45,492 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:45,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:45,493 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:45,494 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-03 23:47:45,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,509 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-03 23:47:45,510 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:45,511 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:45,511 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:45,512 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-03 23:47:45,512 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,517 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,524 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2018-02-03 23:47:45,551 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:45,551 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:45,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:47:45,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:61 [2018-02-03 23:47:45,611 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-03 23:47:45,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:47:45,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,634 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-03 23:47:45,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:47:45,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,650 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:86, output treesize:78 [2018-02-03 23:47:45,687 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-03 23:47:45,689 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:45,690 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-03 23:47:45,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,712 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-03 23:47:45,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:45,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-03 23:47:45,715 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:45,732 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-03 23:47:45,733 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:118 [2018-02-03 23:47:45,989 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:45,990 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:47:45,991 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-03 23:47:45,994 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:45,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:45,995 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:47:45,996 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-03 23:47:45,997 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:47:46,020 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-03 23:47:46,020 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 23:47:46,037 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-03 23:47:46,065 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-03 23:47:46,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:46,068 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-03 23:47:46,068 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:46,085 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-03 23:47:46,085 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-03 23:47:46,091 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:47:46,093 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-03 23:47:46,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:46,096 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-03 23:47:46,096 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:46,106 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-03 23:47:46,106 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:46,109 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:46,124 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-03 23:47:46,125 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:143, output treesize:46 [2018-02-03 23:47:46,189 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-03 23:47:46,207 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:47:46,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [19] total 31 [2018-02-03 23:47:46,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-03 23:47:46,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-03 23:47:46,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=847, Unknown=5, NotChecked=0, Total=930 [2018-02-03 23:47:46,208 INFO L87 Difference]: Start difference. First operand 192 states and 216 transitions. Second operand 31 states. [2018-02-03 23:47:49,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:47:49,592 INFO L93 Difference]: Finished difference Result 216 states and 240 transitions. [2018-02-03 23:47:49,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-03 23:47:49,592 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 44 [2018-02-03 23:47:49,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:47:49,593 INFO L225 Difference]: With dead ends: 216 [2018-02-03 23:47:49,593 INFO L226 Difference]: Without dead ends: 185 [2018-02-03 23:47:49,593 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=393, Invalid=2254, Unknown=5, NotChecked=0, Total=2652 [2018-02-03 23:47:49,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-03 23:47:49,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 178. [2018-02-03 23:47:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-03 23:47:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 201 transitions. [2018-02-03 23:47:49,595 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 201 transitions. Word has length 44 [2018-02-03 23:47:49,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:47:49,595 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 201 transitions. [2018-02-03 23:47:49,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-03 23:47:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 201 transitions. [2018-02-03 23:47:49,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-03 23:47:49,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:47:49,596 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-03 23:47:49,596 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-03 23:47:49,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1456246469, now seen corresponding path program 1 times [2018-02-03 23:47:49,596 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:47:49,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:47:49,597 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:49,597 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:49,597 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:47:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:49,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:47:49,730 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-03 23:47:49,730 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:47:49,730 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:47:49,736 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:47:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:47:49,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:47:49,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:49,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:49,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:47:49,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:49,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:49,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-03 23:47:49,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:47:49,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:47:49,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:49,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:49,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:49,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-02-03 23:47:49,817 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-03 23:47:49,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-03 23:47:49,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:49,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:49,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:47:49,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-02-03 23:47:49,860 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:47:49,861 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:47:49,866 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-03 23:47:49,869 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-03 23:47:49,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:49,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:49,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:47:49,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:39 [2018-02-03 23:47:55,907 WARN L146 SmtUtils]: Spent 2009ms on a formula simplification. DAG size of input: 24 DAG size of output 20 [2018-02-03 23:47:55,928 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-03 23:47:55,935 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-03 23:47:55,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 23:47:55,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:47:55,954 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-03 23:47:55,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:76 [2018-02-03 23:47:57,984 WARN L146 SmtUtils]: Spent 2012ms on a formula simplification. DAG size of input: 33 DAG size of output 19 [2018-02-03 23:47:58,014 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-03 23:47:58,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-03 23:47:58,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:58,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-03 23:47:58,020 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:47:58,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:58,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:47:58,025 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2018-02-03 23:47:58,031 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-03 23:47:58,049 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:47:58,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 21 [2018-02-03 23:47:58,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-03 23:47:58,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-03 23:47:58,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=393, Unknown=2, NotChecked=0, Total=462 [2018-02-03 23:47:58,049 INFO L87 Difference]: Start difference. First operand 178 states and 201 transitions. Second operand 22 states. [2018-02-03 23:48:14,309 WARN L146 SmtUtils]: Spent 2019ms on a formula simplification. DAG size of input: 42 DAG size of output 33 [2018-02-03 23:48:22,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:48:22,891 INFO L93 Difference]: Finished difference Result 366 states and 430 transitions. [2018-02-03 23:48:22,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-03 23:48:22,891 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 52 [2018-02-03 23:48:22,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:48:22,892 INFO L225 Difference]: With dead ends: 366 [2018-02-03 23:48:22,892 INFO L226 Difference]: Without dead ends: 366 [2018-02-03 23:48:22,892 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=320, Invalid=1153, Unknown=9, NotChecked=0, Total=1482 [2018-02-03 23:48:22,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-03 23:48:22,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2018-02-03 23:48:22,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-03 23:48:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 287 transitions. [2018-02-03 23:48:22,895 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 287 transitions. Word has length 52 [2018-02-03 23:48:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:48:22,895 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 287 transitions. [2018-02-03 23:48:22,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-03 23:48:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 287 transitions. [2018-02-03 23:48:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-03 23:48:22,895 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:48:22,895 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-03 23:48:22,896 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-03 23:48:22,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1456246468, now seen corresponding path program 1 times [2018-02-03 23:48:22,896 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:48:22,896 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:48:22,896 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:48:22,896 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:48:22,896 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:48:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:48:22,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:48:23,077 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-03 23:48:23,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 23:48:23,077 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 23:48:23,085 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:48:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:48:23,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:48:23,125 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:48:23,126 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:48:23,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:48:23,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:48:23,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:48:23,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-02-03 23:48:23,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:48:23,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:48:23,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:48:23,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:48:23,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-03 23:48:23,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-03 23:48:23,177 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:48:23,179 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:48:23,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:48:23,185 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-02-03 23:48:23,220 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-03 23:48:23,222 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-03 23:48:23,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:48:23,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:48:23,238 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-03 23:48:23,240 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-03 23:48:23,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:48:23,245 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:48:23,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:48:23,254 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:44 [2018-02-03 23:48:23,315 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:48:23,322 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-03 23:48:23,325 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-03 23:48:23,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:48:23,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:48:23,347 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-03 23:48:23,350 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-03 23:48:23,350 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:48:23,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:48:23,364 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-03 23:48:23,364 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:70 [2018-02-03 23:48:27,434 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-03 23:48:27,441 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-03 23:48:27,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 23:48:27,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:48:27,480 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-03 23:48:27,487 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-03 23:48:27,487 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-03 23:48:27,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:48:27,506 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-03 23:48:27,508 INFO L682 Elim1Store]: detected equality via solver [2018-02-03 23:48:27,509 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-03 23:48:27,509 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:48:27,518 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:48:27,546 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-03 23:48:27,546 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:102, output treesize:149 [2018-02-03 23:48:39,359 WARN L143 SmtUtils]: Spent 11764ms on a formula simplification that was a NOOP. DAG size: 53 [2018-02-03 23:48:51,353 WARN L143 SmtUtils]: Spent 11953ms on a formula simplification that was a NOOP. DAG size: 53 [2018-02-03 23:48:51,366 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 76 treesize of output 62 [2018-02-03 23:48:51,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-03 23:48:51,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:48:51,375 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 32 treesize of output 21 [2018-02-03 23:48:51,376 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:48:51,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:48:51,399 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 44 treesize of output 36 [2018-02-03 23:48:51,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-03 23:48:51,400 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 23:48:51,407 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 18 treesize of output 9 [2018-02-03 23:48:51,407 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 23:48:51,410 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:48:51,427 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 100 treesize of output 78 [2018-02-03 23:48:51,429 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 43 treesize of output 30 [2018-02-03 23:48:51,430 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 23:48:51,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-03 23:48:51,444 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-03 23:48:51,455 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:48:51,485 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 59 treesize of output 49 [2018-02-03 23:48:51,487 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:48:51,488 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 15 treesize of output 8 [2018-02-03 23:48:51,488 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-03 23:48:51,495 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 16 treesize of output 7 [2018-02-03 23:48:51,495 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-03 23:48:51,499 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:48:51,501 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 54 treesize of output 44 [2018-02-03 23:48:51,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-02-03 23:48:51,502 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-03 23:48:51,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-03 23:48:51,512 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-02-03 23:48:51,519 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:48:51,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:48:51,539 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 11 variables, input treesize:177, output treesize:27 [2018-02-03 23:48:51,593 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-03 23:48:51,611 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 23:48:51,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2018-02-03 23:48:51,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-03 23:48:51,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-03 23:48:51,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=473, Unknown=2, NotChecked=0, Total=552 [2018-02-03 23:48:51,611 INFO L87 Difference]: Start difference. First operand 241 states and 287 transitions. Second operand 24 states. [2018-02-03 23:49:28,321 WARN L146 SmtUtils]: Spent 16222ms on a formula simplification. DAG size of input: 118 DAG size of output 51 [2018-02-03 23:49:48,457 WARN L146 SmtUtils]: Spent 20113ms on a formula simplification. DAG size of input: 108 DAG size of output 69 [2018-02-03 23:50:00,391 WARN L143 SmtUtils]: Spent 11826ms on a formula simplification that was a NOOP. DAG size: 58 [2018-02-03 23:50:20,485 WARN L146 SmtUtils]: Spent 19976ms on a formula simplification. DAG size of input: 114 DAG size of output 75 [2018-02-03 23:50:21,132 WARN L146 SmtUtils]: Spent 615ms on a formula simplification. DAG size of input: 63 DAG size of output 42 [2018-02-03 23:50:56,752 WARN L146 SmtUtils]: Spent 35343ms on a formula simplification. DAG size of input: 103 DAG size of output 56 Received shutdown request... [2018-02-03 23:51:02,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-03 23:51:02,680 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-03 23:51:02,685 WARN L185 ceAbstractionStarter]: Timeout [2018-02-03 23:51:02,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 11:51:02 BoogieIcfgContainer [2018-02-03 23:51:02,685 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 23:51:02,686 INFO L168 Benchmark]: Toolchain (without parser) took 214121.44 ms. Allocated memory was 401.6 MB in the beginning and 978.3 MB in the end (delta: 576.7 MB). Free memory was 358.5 MB in the beginning and 452.0 MB in the end (delta: -93.5 MB). Peak memory consumption was 483.2 MB. Max. memory is 5.3 GB. [2018-02-03 23:51:02,687 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 23:51:02,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.31 ms. Allocated memory is still 401.6 MB. Free memory was 358.5 MB in the beginning and 347.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-03 23:51:02,687 INFO L168 Benchmark]: Boogie Preprocessor took 29.00 ms. Allocated memory is still 401.6 MB. Free memory was 347.9 MB in the beginning and 345.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. [2018-02-03 23:51:02,688 INFO L168 Benchmark]: RCFGBuilder took 420.70 ms. Allocated memory is still 401.6 MB. Free memory was 345.2 MB in the beginning and 303.2 MB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 5.3 GB. [2018-02-03 23:51:02,688 INFO L168 Benchmark]: TraceAbstraction took 213507.45 ms. Allocated memory was 401.6 MB in the beginning and 978.3 MB in the end (delta: 576.7 MB). Free memory was 303.2 MB in the beginning and 452.0 MB in the end (delta: -148.8 MB). Peak memory consumption was 427.9 MB. Max. memory is 5.3 GB. [2018-02-03 23:51:02,689 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.31 ms. Allocated memory is still 401.6 MB. Free memory was 358.5 MB in the beginning and 347.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.00 ms. Allocated memory is still 401.6 MB. Free memory was 347.9 MB in the beginning and 345.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 5.3 GB. * RCFGBuilder took 420.70 ms. Allocated memory is still 401.6 MB. Free memory was 345.2 MB in the beginning and 303.2 MB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 213507.45 ms. Allocated memory was 401.6 MB in the beginning and 978.3 MB in the end (delta: 576.7 MB). Free memory was 303.2 MB in the beginning and 452.0 MB in the end (delta: -148.8 MB). Peak memory consumption was 427.9 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 constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 673). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 23 states, 24 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 109. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 164 locations, 75 error locations. TIMEOUT Result, 213.4s OverallTime, 44 OverallIterations, 3 TraceHistogramMax, 169.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4687 SDtfs, 8233 SDslu, 14144 SDs, 0 SdLazy, 15812 SolverSat, 867 SolverUnsat, 18 SolverUnknown, 0 SolverNotchecked, 22.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 810 GetRequests, 250 SyntacticMatches, 27 SemanticMatches, 532 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2141 ImplicationChecksByTransitivity, 179.3s 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.4s SatisfiabilityAnalysisTime, 42.3s InterpolantComputationTime, 1552 NumberOfCodeBlocks, 1552 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1503 ConstructedInterpolants, 68 QuantifiedInterpolants, 629100 SizeOfPredicates, 68 NumberOfNonLiveVariables, 965 ConjunctsInSsa, 153 ConjunctsInUnsatCore, 49 InterpolantComputations, 40 PerfectInterpolantSequences, 49/102 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-03_23-51-02-698.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-03_23-51-02-698.csv Completed graceful shutdown