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_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 19:39:25,390 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:39:25,392 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:39:25,404 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:39:25,404 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:39:25,405 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:39:25,406 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:39:25,408 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:39:25,410 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:39:25,411 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:39:25,412 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:39:25,412 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:39:25,413 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:39:25,414 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:39:25,415 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:39:25,416 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:39:25,418 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:39:25,420 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:39:25,421 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:39:25,422 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:39:25,423 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:39:25,424 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:39:25,424 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:39:25,425 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:39:25,425 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:39:25,426 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:39:25,426 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:39:25,428 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:39:25,428 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:39:25,428 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:39:25,429 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:39:25,429 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 19:39:25,438 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:39:25,439 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:39:25,439 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:39:25,440 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:39:25,440 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:39:25,440 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:39:25,440 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:39:25,440 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:39:25,440 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:39:25,440 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:39:25,440 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:39:25,440 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:39:25,441 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:39:25,441 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:39:25,441 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:39:25,441 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:39:25,441 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:39:25,441 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:39:25,441 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:39:25,441 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:39:25,441 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:39:25,442 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:39:25,442 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:39:25,442 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:39:25,469 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:39:25,477 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:39:25,479 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:39:25,480 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:39:25,481 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:39:25,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-02-04 19:39:25,612 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:39:25,613 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:39:25,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:39:25,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:39:25,618 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:39:25,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:39:25" (1/1) ... [2018-02-04 19:39:25,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c42bb1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:39:25, skipping insertion in model container [2018-02-04 19:39:25,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:39:25" (1/1) ... [2018-02-04 19:39:25,631 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:39:25,661 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:39:25,755 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:39:25,773 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:39:25,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:39:25 WrapperNode [2018-02-04 19:39:25,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:39:25,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:39:25,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:39:25,782 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:39:25,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:39:25" (1/1) ... [2018-02-04 19:39:25,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:39:25" (1/1) ... [2018-02-04 19:39:25,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:39:25" (1/1) ... [2018-02-04 19:39:25,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:39:25" (1/1) ... [2018-02-04 19:39:25,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:39:25" (1/1) ... [2018-02-04 19:39:25,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:39:25" (1/1) ... [2018-02-04 19:39:25,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:39:25" (1/1) ... [2018-02-04 19:39:25,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:39:25,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:39:25,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:39:25,815 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:39:25,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:39:25" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:39:25,855 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:39:25,855 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:39:25,856 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:39:25,856 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 19:39:25,856 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 19:39:25,856 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 19:39:25,856 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 19:39:25,856 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:39:25,856 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:39:25,856 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:39:25,856 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 19:39:25,856 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 19:39:25,856 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:39:25,856 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 19:39:25,856 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:39:25,857 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:39:25,857 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:39:26,284 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:39:26,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:39:26 BoogieIcfgContainer [2018-02-04 19:39:26,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:39:26,286 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:39:26,286 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:39:26,288 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:39:26,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:39:25" (1/3) ... [2018-02-04 19:39:26,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5968da25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:39:26, skipping insertion in model container [2018-02-04 19:39:26,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:39:25" (2/3) ... [2018-02-04 19:39:26,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5968da25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:39:26, skipping insertion in model container [2018-02-04 19:39:26,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:39:26" (3/3) ... [2018-02-04 19:39:26,292 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-02-04 19:39:26,299 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:39:26,306 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-02-04 19:39:26,337 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:39:26,337 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:39:26,337 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:39:26,337 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:39:26,338 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:39:26,338 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:39:26,338 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:39:26,338 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:39:26,338 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:39:26,350 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2018-02-04 19:39:26,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 19:39:26,357 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:26,358 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:39:26,358 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:26,362 INFO L82 PathProgramCache]: Analyzing trace with hash 726209746, now seen corresponding path program 1 times [2018-02-04 19:39:26,363 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:26,363 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:26,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:26,400 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:26,400 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:26,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:39:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:39:26,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:39:26,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 19:39:26,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:39:26,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:39:26,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:39:26,503 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2018-02-04 19:39:26,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:39:26,738 INFO L93 Difference]: Finished difference Result 181 states and 188 transitions. [2018-02-04 19:39:26,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 19:39:26,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 19:39:26,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:39:26,749 INFO L225 Difference]: With dead ends: 181 [2018-02-04 19:39:26,749 INFO L226 Difference]: Without dead ends: 177 [2018-02-04 19:39:26,750 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-04 19:39:26,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-04 19:39:26,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 154. [2018-02-04 19:39:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-04 19:39:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 159 transitions. [2018-02-04 19:39:26,785 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 159 transitions. Word has length 8 [2018-02-04 19:39:26,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:39:26,785 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 159 transitions. [2018-02-04 19:39:26,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:39:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 159 transitions. [2018-02-04 19:39:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 19:39:26,786 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:26,786 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:39:26,786 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:26,786 INFO L82 PathProgramCache]: Analyzing trace with hash 726209747, now seen corresponding path program 1 times [2018-02-04 19:39:26,786 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:26,786 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:26,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:26,788 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:26,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:26,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:39:26,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:39:26,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:39:26,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 19:39:26,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:39:26,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:39:26,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:39:26,864 INFO L87 Difference]: Start difference. First operand 154 states and 159 transitions. Second operand 4 states. [2018-02-04 19:39:26,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:39:26,984 INFO L93 Difference]: Finished difference Result 151 states and 156 transitions. [2018-02-04 19:39:26,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 19:39:26,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 19:39:26,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:39:26,987 INFO L225 Difference]: With dead ends: 151 [2018-02-04 19:39:26,987 INFO L226 Difference]: Without dead ends: 151 [2018-02-04 19:39:26,987 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-04 19:39:26,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-04 19:39:26,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-04 19:39:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 19:39:26,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 156 transitions. [2018-02-04 19:39:26,995 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 156 transitions. Word has length 8 [2018-02-04 19:39:26,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:39:26,995 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 156 transitions. [2018-02-04 19:39:26,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:39:26,996 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 156 transitions. [2018-02-04 19:39:26,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 19:39:26,996 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:26,996 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:39:26,996 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:26,996 INFO L82 PathProgramCache]: Analyzing trace with hash 3311897, now seen corresponding path program 1 times [2018-02-04 19:39:26,997 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:26,997 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:26,998 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:26,998 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:26,998 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:27,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:39:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:39:27,040 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:39:27,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 19:39:27,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:39:27,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:39:27,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:39:27,041 INFO L87 Difference]: Start difference. First operand 151 states and 156 transitions. Second operand 4 states. [2018-02-04 19:39:27,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:39:27,141 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-02-04 19:39:27,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:39:27,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 19:39:27,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:39:27,142 INFO L225 Difference]: With dead ends: 162 [2018-02-04 19:39:27,142 INFO L226 Difference]: Without dead ends: 162 [2018-02-04 19:39:27,142 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-04 19:39:27,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-04 19:39:27,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 147. [2018-02-04 19:39:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 19:39:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 154 transitions. [2018-02-04 19:39:27,147 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 154 transitions. Word has length 13 [2018-02-04 19:39:27,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:39:27,148 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 154 transitions. [2018-02-04 19:39:27,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:39:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 154 transitions. [2018-02-04 19:39:27,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 19:39:27,148 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:27,148 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:39:27,148 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:27,148 INFO L82 PathProgramCache]: Analyzing trace with hash 3311898, now seen corresponding path program 1 times [2018-02-04 19:39:27,149 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:27,149 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:27,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:27,150 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:27,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:27,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:39:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:39:27,208 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:39:27,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 19:39:27,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:39:27,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:39:27,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:39:27,209 INFO L87 Difference]: Start difference. First operand 147 states and 154 transitions. Second operand 4 states. [2018-02-04 19:39:27,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:39:27,312 INFO L93 Difference]: Finished difference Result 159 states and 165 transitions. [2018-02-04 19:39:27,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 19:39:27,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 19:39:27,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:39:27,314 INFO L225 Difference]: With dead ends: 159 [2018-02-04 19:39:27,314 INFO L226 Difference]: Without dead ends: 159 [2018-02-04 19:39:27,314 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-04 19:39:27,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-04 19:39:27,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2018-02-04 19:39:27,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-04 19:39:27,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 158 transitions. [2018-02-04 19:39:27,319 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 158 transitions. Word has length 13 [2018-02-04 19:39:27,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:39:27,319 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 158 transitions. [2018-02-04 19:39:27,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:39:27,319 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 158 transitions. [2018-02-04 19:39:27,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 19:39:27,319 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:27,319 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] [2018-02-04 19:39:27,320 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:27,320 INFO L82 PathProgramCache]: Analyzing trace with hash -969711578, now seen corresponding path program 1 times [2018-02-04 19:39:27,320 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:27,320 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:27,321 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:27,321 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:27,321 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:27,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:39:27,352 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:39:27,352 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:39:27,352 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:39:27,354 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:27,398 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:39:27,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:39:27,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:27,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:27,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:39:27,448 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 12 treesize of output 11 [2018-02-04 19:39:27,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:27,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:39:27,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 19:39:27,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:39:27,466 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:39:27,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:39:27,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:39:27,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:39:27,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:39:27,467 INFO L87 Difference]: Start difference. First operand 151 states and 158 transitions. Second operand 5 states. [2018-02-04 19:39:27,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:39:27,648 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-02-04 19:39:27,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:39:27,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-04 19:39:27,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:39:27,649 INFO L225 Difference]: With dead ends: 154 [2018-02-04 19:39:27,649 INFO L226 Difference]: Without dead ends: 154 [2018-02-04 19:39:27,650 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 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-04 19:39:27,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-04 19:39:27,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 139. [2018-02-04 19:39:27,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-04 19:39:27,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2018-02-04 19:39:27,663 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 21 [2018-02-04 19:39:27,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:39:27,664 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2018-02-04 19:39:27,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:39:27,664 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2018-02-04 19:39:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 19:39:27,664 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:27,664 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] [2018-02-04 19:39:27,664 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:27,665 INFO L82 PathProgramCache]: Analyzing trace with hash -969711577, now seen corresponding path program 1 times [2018-02-04 19:39:27,665 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:27,665 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:27,666 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:27,666 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:27,666 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:27,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:39:27,682 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:39:27,682 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:39:27,682 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:39:27,683 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:27,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:39:27,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:39:27,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:27,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:27,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 19:39:27,740 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 12 treesize of output 11 [2018-02-04 19:39:27,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:27,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:39:27,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-02-04 19:39:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:39:27,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:39:27,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:39:27,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:39:27,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:39:27,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:39:27,752 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand 6 states. [2018-02-04 19:39:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:39:27,951 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2018-02-04 19:39:27,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:39:27,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-04 19:39:27,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:39:27,952 INFO L225 Difference]: With dead ends: 175 [2018-02-04 19:39:27,952 INFO L226 Difference]: Without dead ends: 175 [2018-02-04 19:39:27,952 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:39:27,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-04 19:39:27,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 150. [2018-02-04 19:39:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-04 19:39:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2018-02-04 19:39:27,959 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 21 [2018-02-04 19:39:27,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:39:27,959 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2018-02-04 19:39:27,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:39:27,959 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2018-02-04 19:39:27,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 19:39:27,960 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:27,960 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-04 19:39:27,960 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:27,960 INFO L82 PathProgramCache]: Analyzing trace with hash 115077033, now seen corresponding path program 1 times [2018-02-04 19:39:27,960 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:27,960 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:27,961 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:27,961 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:27,961 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:27,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:39:28,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:39:28,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:39:28,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:39:28,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:39:28,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:39:28,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:39:28,014 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand 5 states. [2018-02-04 19:39:28,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:39:28,140 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2018-02-04 19:39:28,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:39:28,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 19:39:28,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:39:28,141 INFO L225 Difference]: With dead ends: 197 [2018-02-04 19:39:28,141 INFO L226 Difference]: Without dead ends: 197 [2018-02-04 19:39:28,142 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-04 19:39:28,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-04 19:39:28,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149. [2018-02-04 19:39:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-04 19:39:28,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2018-02-04 19:39:28,148 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 23 [2018-02-04 19:39:28,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:39:28,148 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2018-02-04 19:39:28,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:39:28,148 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2018-02-04 19:39:28,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 19:39:28,148 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:28,149 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-04 19:39:28,149 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:28,149 INFO L82 PathProgramCache]: Analyzing trace with hash 115077034, now seen corresponding path program 1 times [2018-02-04 19:39:28,149 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:28,149 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:28,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:28,150 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:28,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:28,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:39:28,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:39:28,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:39:28,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:39:28,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:39:28,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:39:28,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:39:28,199 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand 5 states. [2018-02-04 19:39:28,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:39:28,344 INFO L93 Difference]: Finished difference Result 219 states and 236 transitions. [2018-02-04 19:39:28,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:39:28,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 19:39:28,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:39:28,345 INFO L225 Difference]: With dead ends: 219 [2018-02-04 19:39:28,345 INFO L226 Difference]: Without dead ends: 219 [2018-02-04 19:39:28,346 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-04 19:39:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-04 19:39:28,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 148. [2018-02-04 19:39:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-04 19:39:28,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2018-02-04 19:39:28,350 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 23 [2018-02-04 19:39:28,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:39:28,350 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2018-02-04 19:39:28,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:39:28,350 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2018-02-04 19:39:28,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 19:39:28,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:28,351 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:39:28,353 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:28,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1386253035, now seen corresponding path program 1 times [2018-02-04 19:39:28,353 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:28,353 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:28,354 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:28,354 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:28,354 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:28,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:39:28,372 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:39:28,372 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:39:28,372 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:39:28,373 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:28,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:39:28,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:39:28,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:28,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:28,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:39:28,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:28,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:28,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 19:39:28,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:28,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:28,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-04 19:39:28,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:39:28,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:39:28,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:28,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:28,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:28,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-02-04 19:39:28,510 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 39 treesize of output 35 [2018-02-04 19:39:28,516 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 14 treesize of output 13 [2018-02-04 19:39:28,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:28,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:28,543 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-04 19:39:28,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-02-04 19:39:28,571 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-04 19:39:28,574 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-04 19:39:28,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:28,581 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-04 19:39:28,581 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:28,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:28,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:39:28,589 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-02-04 19:39:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:39:28,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:39:28,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 19:39:28,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:39:28,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:39:28,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:39:28,613 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand 11 states. [2018-02-04 19:39:29,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:39:29,163 INFO L93 Difference]: Finished difference Result 205 states and 219 transitions. [2018-02-04 19:39:29,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 19:39:29,163 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-02-04 19:39:29,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:39:29,164 INFO L225 Difference]: With dead ends: 205 [2018-02-04 19:39:29,165 INFO L226 Difference]: Without dead ends: 205 [2018-02-04 19:39:29,165 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2018-02-04 19:39:29,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-04 19:39:29,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 147. [2018-02-04 19:39:29,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 19:39:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2018-02-04 19:39:29,169 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 27 [2018-02-04 19:39:29,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:39:29,169 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-02-04 19:39:29,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:39:29,169 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2018-02-04 19:39:29,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 19:39:29,170 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:29,170 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:39:29,170 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:29,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1386253036, now seen corresponding path program 1 times [2018-02-04 19:39:29,170 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:29,175 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:29,176 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:29,176 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:29,176 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:29,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:39:29,194 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:39:29,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:39:29,195 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:39:29,196 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:29,232 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:39:29,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:39:29,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:29,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:29,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 19:39:29,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:39:29,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:39:29,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:29,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:29,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:39:29,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:39:29,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:29,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:29,291 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-04 19:39:29,291 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-02-04 19:39:29,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-02-04 19:39:29,336 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 24 treesize of output 23 [2018-02-04 19:39:29,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:29,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:29,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 56 [2018-02-04 19:39:29,384 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:29,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-02-04 19:39:29,386 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:29,409 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 37 treesize of output 36 [2018-02-04 19:39:29,409 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:29,419 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:29,429 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-04 19:39:29,429 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:53, output treesize:57 [2018-02-04 19:39:29,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 91 [2018-02-04 19:39:29,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:29,464 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 0 case distinctions, treesize of input 76 treesize of output 57 [2018-02-04 19:39:29,465 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:39:29,486 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 84 treesize of output 65 [2018-02-04 19:39:29,487 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:29,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2018-02-04 19:39:29,506 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:39:29,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:39:29,551 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 58 treesize of output 44 [2018-02-04 19:39:29,554 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 28 treesize of output 7 [2018-02-04 19:39:29,554 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:29,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-02-04 19:39:29,563 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:29,569 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:29,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 48 [2018-02-04 19:39:29,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 23 [2018-02-04 19:39:29,580 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:29,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-04 19:39:29,598 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:29,615 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:29,616 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2018-02-04 19:39:29,616 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:29,623 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:29,630 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-04 19:39:29,630 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:107, output treesize:9 [2018-02-04 19:39:29,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:39:29,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:39:29,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 19:39:29,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:39:29,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:39:29,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:39:29,646 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 11 states. [2018-02-04 19:39:30,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:39:30,186 INFO L93 Difference]: Finished difference Result 242 states and 258 transitions. [2018-02-04 19:39:30,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 19:39:30,186 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-02-04 19:39:30,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:39:30,187 INFO L225 Difference]: With dead ends: 242 [2018-02-04 19:39:30,187 INFO L226 Difference]: Without dead ends: 242 [2018-02-04 19:39:30,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=431, Unknown=0, NotChecked=0, Total=650 [2018-02-04 19:39:30,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-04 19:39:30,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 170. [2018-02-04 19:39:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-04 19:39:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2018-02-04 19:39:30,190 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 27 [2018-02-04 19:39:30,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:39:30,190 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2018-02-04 19:39:30,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:39:30,190 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2018-02-04 19:39:30,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 19:39:30,191 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:30,191 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-04 19:39:30,191 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:30,191 INFO L82 PathProgramCache]: Analyzing trace with hash 78293977, now seen corresponding path program 1 times [2018-02-04 19:39:30,191 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:30,191 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:30,192 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:30,192 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:30,192 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:30,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:39:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:39:30,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:39:30,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:39:30,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:39:30,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:39:30,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:39:30,229 INFO L87 Difference]: Start difference. First operand 170 states and 183 transitions. Second operand 8 states. [2018-02-04 19:39:30,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:39:30,445 INFO L93 Difference]: Finished difference Result 198 states and 212 transitions. [2018-02-04 19:39:30,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:39:30,476 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-04 19:39:30,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:39:30,477 INFO L225 Difference]: With dead ends: 198 [2018-02-04 19:39:30,477 INFO L226 Difference]: Without dead ends: 198 [2018-02-04 19:39:30,477 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-04 19:39:30,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-04 19:39:30,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 170. [2018-02-04 19:39:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-04 19:39:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 182 transitions. [2018-02-04 19:39:30,481 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 182 transitions. Word has length 33 [2018-02-04 19:39:30,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:39:30,481 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 182 transitions. [2018-02-04 19:39:30,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:39:30,481 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 182 transitions. [2018-02-04 19:39:30,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 19:39:30,482 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:30,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, 1, 1, 1, 1, 1] [2018-02-04 19:39:30,482 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:30,483 INFO L82 PathProgramCache]: Analyzing trace with hash -133974448, now seen corresponding path program 1 times [2018-02-04 19:39:30,483 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:30,483 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:30,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:30,484 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:30,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:30,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:39:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:39:30,513 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:39:30,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:39:30,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:39:30,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:39:30,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:39:30,513 INFO L87 Difference]: Start difference. First operand 170 states and 182 transitions. Second operand 5 states. [2018-02-04 19:39:30,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:39:30,713 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2018-02-04 19:39:30,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:39:30,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-04 19:39:30,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:39:30,714 INFO L225 Difference]: With dead ends: 217 [2018-02-04 19:39:30,714 INFO L226 Difference]: Without dead ends: 217 [2018-02-04 19:39:30,715 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-04 19:39:30,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-04 19:39:30,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 169. [2018-02-04 19:39:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-04 19:39:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 180 transitions. [2018-02-04 19:39:30,718 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 180 transitions. Word has length 34 [2018-02-04 19:39:30,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:39:30,718 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 180 transitions. [2018-02-04 19:39:30,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:39:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 180 transitions. [2018-02-04 19:39:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 19:39:30,720 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:30,720 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-04 19:39:30,720 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:30,720 INFO L82 PathProgramCache]: Analyzing trace with hash -133974447, now seen corresponding path program 1 times [2018-02-04 19:39:30,720 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:30,721 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:30,721 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:30,721 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:30,722 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:30,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:39:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:39:30,783 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:39:30,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:39:30,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:39:30,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:39:30,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:39:30,783 INFO L87 Difference]: Start difference. First operand 169 states and 180 transitions. Second operand 5 states. [2018-02-04 19:39:31,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:39:31,004 INFO L93 Difference]: Finished difference Result 239 states and 255 transitions. [2018-02-04 19:39:31,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:39:31,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-04 19:39:31,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:39:31,005 INFO L225 Difference]: With dead ends: 239 [2018-02-04 19:39:31,005 INFO L226 Difference]: Without dead ends: 239 [2018-02-04 19:39:31,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:39:31,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-04 19:39:31,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 168. [2018-02-04 19:39:31,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-04 19:39:31,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 178 transitions. [2018-02-04 19:39:31,009 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 178 transitions. Word has length 34 [2018-02-04 19:39:31,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:39:31,009 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 178 transitions. [2018-02-04 19:39:31,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:39:31,009 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 178 transitions. [2018-02-04 19:39:31,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 19:39:31,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:31,010 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] [2018-02-04 19:39:31,010 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:31,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1586747252, now seen corresponding path program 1 times [2018-02-04 19:39:31,010 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:31,012 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:31,013 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:31,013 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:31,013 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:31,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:39:31,024 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:39:31,025 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:39:31,025 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:39:31,025 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:31,049 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:39:31,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:39:31,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:39:31,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:39:31,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:39:31,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,071 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,079 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-02-04 19:39:31,088 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 21 treesize of output 16 [2018-02-04 19:39:31,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:31,093 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-04 19:39:31,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,106 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 21 treesize of output 16 [2018-02-04 19:39:31,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:31,109 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-04 19:39:31,109 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,112 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,118 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-02-04 19:39:31,130 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 36 treesize of output 29 [2018-02-04 19:39:31,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:31,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:31,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:31,136 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 29 treesize of output 37 [2018-02-04 19:39:31,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,155 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 36 treesize of output 29 [2018-02-04 19:39:31,157 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:31,157 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:31,158 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:31,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-02-04 19:39:31,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,166 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,170 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2018-02-04 19:39:31,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-02-04 19:39:31,203 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:31,204 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:31,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-02-04 19:39:31,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-02-04 19:39:31,220 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:31,221 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:31,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-02-04 19:39:31,222 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,229 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:7 [2018-02-04 19:39:31,246 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-04 19:39:31,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:39:31,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 19:39:31,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:39:31,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:39:31,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:39:31,247 INFO L87 Difference]: Start difference. First operand 168 states and 178 transitions. Second operand 9 states. [2018-02-04 19:39:31,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:39:31,715 INFO L93 Difference]: Finished difference Result 233 states and 247 transitions. [2018-02-04 19:39:31,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 19:39:31,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-02-04 19:39:31,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:39:31,717 INFO L225 Difference]: With dead ends: 233 [2018-02-04 19:39:31,717 INFO L226 Difference]: Without dead ends: 233 [2018-02-04 19:39:31,717 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-02-04 19:39:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-04 19:39:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 187. [2018-02-04 19:39:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-02-04 19:39:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2018-02-04 19:39:31,721 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 36 [2018-02-04 19:39:31,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:39:31,722 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2018-02-04 19:39:31,722 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:39:31,722 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2018-02-04 19:39:31,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 19:39:31,723 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:31,723 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:39:31,723 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:31,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1203027346, now seen corresponding path program 1 times [2018-02-04 19:39:31,723 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:31,723 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:31,724 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:31,724 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:31,724 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:31,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:39:31,745 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:39:31,745 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:39:31,745 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:39:31,745 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:31,783 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:39:31,806 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:31,806 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:31,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-02-04 19:39:31,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-04 19:39:31,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:39:31,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:39:31,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-02-04 19:39:31,865 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 39 treesize of output 35 [2018-02-04 19:39:31,867 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 14 treesize of output 13 [2018-02-04 19:39:31,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,878 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-04 19:39:31,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-02-04 19:39:31,894 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-04 19:39:31,900 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-04 19:39:31,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,906 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-04 19:39:31,907 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:31,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:39:31,915 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-02-04 19:39:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:39:31,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:39:31,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:39:31,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:39:31,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:39:31,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:39:31,941 INFO L87 Difference]: Start difference. First operand 187 states and 199 transitions. Second operand 9 states. [2018-02-04 19:39:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:39:32,156 INFO L93 Difference]: Finished difference Result 211 states and 224 transitions. [2018-02-04 19:39:32,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:39:32,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-02-04 19:39:32,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:39:32,156 INFO L225 Difference]: With dead ends: 211 [2018-02-04 19:39:32,157 INFO L226 Difference]: Without dead ends: 211 [2018-02-04 19:39:32,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-02-04 19:39:32,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-04 19:39:32,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 186. [2018-02-04 19:39:32,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-04 19:39:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 198 transitions. [2018-02-04 19:39:32,159 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 198 transitions. Word has length 38 [2018-02-04 19:39:32,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:39:32,159 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 198 transitions. [2018-02-04 19:39:32,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:39:32,159 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 198 transitions. [2018-02-04 19:39:32,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 19:39:32,160 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:32,160 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:39:32,160 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:32,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1203027347, now seen corresponding path program 1 times [2018-02-04 19:39:32,161 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:32,161 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:32,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:32,162 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:32,162 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:32,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:39:32,180 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:39:32,181 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:39:32,181 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:39:32,181 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:32,220 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:39:32,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:39:32,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:39:32,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 19:39:32,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-02-04 19:39:32,289 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 29 treesize of output 28 [2018-02-04 19:39:32,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,320 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-04 19:39:32,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2018-02-04 19:39:32,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 43 [2018-02-04 19:39:32,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2018-02-04 19:39:32,349 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:39:32,367 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:32,368 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2018-02-04 19:39:32,369 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,384 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-04 19:39:32,384 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:3 [2018-02-04 19:39:32,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:39:32,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-02-04 19:39:32,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:39:32,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:39:32,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:39:32,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:39:32,446 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,455 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-04 19:39:32,455 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2018-02-04 19:39:32,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-02-04 19:39:32,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:32,531 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:32,531 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 24 treesize of output 40 [2018-02-04 19:39:32,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,552 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 25 treesize of output 24 [2018-02-04 19:39:32,552 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-02-04 19:39:32,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:32,582 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 21 treesize of output 34 [2018-02-04 19:39:32,582 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,593 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 20 treesize of output 19 [2018-02-04 19:39:32,594 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,599 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,607 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-04 19:39:32,607 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:56, output treesize:48 [2018-02-04 19:39:32,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 91 [2018-02-04 19:39:32,657 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 84 treesize of output 65 [2018-02-04 19:39:32,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2018-02-04 19:39:32,679 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:39:32,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:32,701 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 0 case distinctions, treesize of input 76 treesize of output 57 [2018-02-04 19:39:32,701 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:39:32,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:39:32,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2018-02-04 19:39:32,758 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 51 treesize of output 30 [2018-02-04 19:39:32,758 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,773 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:32,773 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:32,774 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 47 treesize of output 24 [2018-02-04 19:39:32,774 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,785 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,799 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 67 treesize of output 51 [2018-02-04 19:39:32,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2018-02-04 19:39:32,802 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:39:32,809 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-04 19:39:32,810 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,815 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:32,821 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-04 19:39:32,822 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:116, output treesize:9 [2018-02-04 19:39:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:39:32,843 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:39:32,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-04 19:39:32,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 19:39:32,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 19:39:32,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-02-04 19:39:32,844 INFO L87 Difference]: Start difference. First operand 186 states and 198 transitions. Second operand 17 states. [2018-02-04 19:39:33,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:39:33,638 INFO L93 Difference]: Finished difference Result 230 states and 243 transitions. [2018-02-04 19:39:33,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 19:39:33,638 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-02-04 19:39:33,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:39:33,639 INFO L225 Difference]: With dead ends: 230 [2018-02-04 19:39:33,639 INFO L226 Difference]: Without dead ends: 230 [2018-02-04 19:39:33,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 19:39:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-04 19:39:33,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 204. [2018-02-04 19:39:33,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-04 19:39:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 217 transitions. [2018-02-04 19:39:33,644 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 217 transitions. Word has length 38 [2018-02-04 19:39:33,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:39:33,644 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 217 transitions. [2018-02-04 19:39:33,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 19:39:33,644 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 217 transitions. [2018-02-04 19:39:33,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 19:39:33,645 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:33,645 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:39:33,645 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:33,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1775732296, now seen corresponding path program 1 times [2018-02-04 19:39:33,645 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:33,645 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:33,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:33,646 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:33,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:33,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:39:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:39:33,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:39:33,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:39:33,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:39:33,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:39:33,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:39:33,715 INFO L87 Difference]: Start difference. First operand 204 states and 217 transitions. Second operand 5 states. [2018-02-04 19:39:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:39:33,821 INFO L93 Difference]: Finished difference Result 208 states and 219 transitions. [2018-02-04 19:39:33,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:39:33,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-02-04 19:39:33,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:39:33,822 INFO L225 Difference]: With dead ends: 208 [2018-02-04 19:39:33,822 INFO L226 Difference]: Without dead ends: 208 [2018-02-04 19:39:33,823 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:39:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-04 19:39:33,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 203. [2018-02-04 19:39:33,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-04 19:39:33,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 214 transitions. [2018-02-04 19:39:33,826 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 214 transitions. Word has length 38 [2018-02-04 19:39:33,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:39:33,826 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 214 transitions. [2018-02-04 19:39:33,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:39:33,827 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 214 transitions. [2018-02-04 19:39:33,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 19:39:33,827 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:33,827 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] [2018-02-04 19:39:33,827 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:33,827 INFO L82 PathProgramCache]: Analyzing trace with hash 377492563, now seen corresponding path program 1 times [2018-02-04 19:39:33,827 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:33,828 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:33,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:33,828 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:33,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:33,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:39:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:39:33,878 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:39:33,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:39:33,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:39:33,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:39:33,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:39:33,879 INFO L87 Difference]: Start difference. First operand 203 states and 214 transitions. Second operand 8 states. [2018-02-04 19:39:34,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:39:34,037 INFO L93 Difference]: Finished difference Result 216 states and 226 transitions. [2018-02-04 19:39:34,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:39:34,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-02-04 19:39:34,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:39:34,038 INFO L225 Difference]: With dead ends: 216 [2018-02-04 19:39:34,038 INFO L226 Difference]: Without dead ends: 216 [2018-02-04 19:39:34,039 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-02-04 19:39:34,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-04 19:39:34,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 203. [2018-02-04 19:39:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-04 19:39:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 213 transitions. [2018-02-04 19:39:34,042 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 213 transitions. Word has length 39 [2018-02-04 19:39:34,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:39:34,042 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 213 transitions. [2018-02-04 19:39:34,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:39:34,043 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 213 transitions. [2018-02-04 19:39:34,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 19:39:34,043 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:34,043 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, 1, 1, 1] [2018-02-04 19:39:34,043 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:34,043 INFO L82 PathProgramCache]: Analyzing trace with hash 595067423, now seen corresponding path program 1 times [2018-02-04 19:39:34,044 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:34,044 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:34,044 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:34,044 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:34,045 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:34,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:39:34,101 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-04 19:39:34,102 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:39:34,102 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:39:34,103 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:34,115 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:39:34,121 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-04 19:39:34,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:39:34,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-02-04 19:39:34,129 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 19 treesize of output 15 [2018-02-04 19:39:34,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 19:39:34,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-02-04 19:39:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:39:34,152 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:39:34,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2018-02-04 19:39:34,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:39:34,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:39:34,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:39:34,153 INFO L87 Difference]: Start difference. First operand 203 states and 213 transitions. Second operand 9 states. [2018-02-04 19:39:34,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:39:34,347 INFO L93 Difference]: Finished difference Result 227 states and 237 transitions. [2018-02-04 19:39:34,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:39:34,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-02-04 19:39:34,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:39:34,348 INFO L225 Difference]: With dead ends: 227 [2018-02-04 19:39:34,348 INFO L226 Difference]: Without dead ends: 227 [2018-02-04 19:39:34,348 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-02-04 19:39:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-02-04 19:39:34,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 200. [2018-02-04 19:39:34,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-02-04 19:39:34,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 209 transitions. [2018-02-04 19:39:34,350 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 209 transitions. Word has length 43 [2018-02-04 19:39:34,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:39:34,350 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 209 transitions. [2018-02-04 19:39:34,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:39:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 209 transitions. [2018-02-04 19:39:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 19:39:34,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:34,350 INFO L351 BasicCegarLoop]: trace histogram [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, 1] [2018-02-04 19:39:34,350 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:34,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1932461330, now seen corresponding path program 1 times [2018-02-04 19:39:34,351 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:34,351 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:34,352 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:34,352 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:34,352 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:34,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:39:34,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:39:34,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:39:34,435 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:39:34,436 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:39:34,455 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:39:34,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:39:34,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:39:34,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:39:34,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:39:34,480 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,485 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-02-04 19:39:34,504 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 21 treesize of output 16 [2018-02-04 19:39:34,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:34,507 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-04 19:39:34,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,520 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 21 treesize of output 16 [2018-02-04 19:39:34,522 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:34,523 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-04 19:39:34,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,529 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-02-04 19:39:34,540 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 36 treesize of output 29 [2018-02-04 19:39:34,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:34,545 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:34,545 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:34,548 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 29 treesize of output 37 [2018-02-04 19:39:34,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,560 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 36 treesize of output 29 [2018-02-04 19:39:34,562 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:34,562 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:34,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:34,565 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 29 treesize of output 37 [2018-02-04 19:39:34,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,569 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,572 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:33 [2018-02-04 19:39:34,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-02-04 19:39:34,579 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:34,579 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 18 treesize of output 10 [2018-02-04 19:39:34,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-02-04 19:39:34,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:34,589 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 18 treesize of output 10 [2018-02-04 19:39:34,589 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:39:34,592 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-04 19:39:34,592 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-02-04 19:39:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:39:34,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:39:34,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2018-02-04 19:39:34,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:39:34,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:39:34,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:39:34,607 INFO L87 Difference]: Start difference. First operand 200 states and 209 transitions. Second operand 10 states. [2018-02-04 19:39:34,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:39:34,916 INFO L93 Difference]: Finished difference Result 253 states and 265 transitions. [2018-02-04 19:39:34,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 19:39:34,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-02-04 19:39:34,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:39:34,917 INFO L225 Difference]: With dead ends: 253 [2018-02-04 19:39:34,917 INFO L226 Difference]: Without dead ends: 253 [2018-02-04 19:39:34,917 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-02-04 19:39:34,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-04 19:39:34,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 213. [2018-02-04 19:39:34,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-04 19:39:34,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 223 transitions. [2018-02-04 19:39:34,921 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 223 transitions. Word has length 46 [2018-02-04 19:39:34,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:39:34,922 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 223 transitions. [2018-02-04 19:39:34,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:39:34,922 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 223 transitions. [2018-02-04 19:39:34,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 19:39:34,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:39:34,923 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:39:34,923 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-02-04 19:39:34,923 INFO L82 PathProgramCache]: Analyzing trace with hash -223241516, now seen corresponding path program 1 times [2018-02-04 19:39:34,923 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:39:34,923 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:39:34,924 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:34,924 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:39:34,924 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:39:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 19:39:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 19:39:34,958 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 19:39:34,973 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 19:39:34,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:39:34 BoogieIcfgContainer [2018-02-04 19:39:34,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:39:34,988 INFO L168 Benchmark]: Toolchain (without parser) took 9376.10 ms. Allocated memory was 401.6 MB in the beginning and 788.5 MB in the end (delta: 386.9 MB). Free memory was 355.6 MB in the beginning and 669.2 MB in the end (delta: -313.5 MB). Peak memory consumption was 73.4 MB. Max. memory is 5.3 GB. [2018-02-04 19:39:34,989 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 401.6 MB. Free memory is still 360.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:39:34,989 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.81 ms. Allocated memory is still 401.6 MB. Free memory was 355.6 MB in the beginning and 342.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 19:39:34,990 INFO L168 Benchmark]: Boogie Preprocessor took 32.67 ms. Allocated memory is still 401.6 MB. Free memory was 342.4 MB in the beginning and 339.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 19:39:34,990 INFO L168 Benchmark]: RCFGBuilder took 470.89 ms. Allocated memory is still 401.6 MB. Free memory was 339.8 MB in the beginning and 298.7 MB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 5.3 GB. [2018-02-04 19:39:34,990 INFO L168 Benchmark]: TraceAbstraction took 8701.96 ms. Allocated memory was 401.6 MB in the beginning and 788.5 MB in the end (delta: 386.9 MB). Free memory was 298.7 MB in the beginning and 669.2 MB in the end (delta: -370.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 5.3 GB. [2018-02-04 19:39:34,991 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 401.6 MB. Free memory is still 360.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 167.81 ms. Allocated memory is still 401.6 MB. Free memory was 355.6 MB in the beginning and 342.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.67 ms. Allocated memory is still 401.6 MB. Free memory was 342.4 MB in the beginning and 339.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 470.89 ms. Allocated memory is still 401.6 MB. Free memory was 339.8 MB in the beginning and 298.7 MB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8701.96 ms. Allocated memory was 401.6 MB in the beginning and 788.5 MB in the end (delta: 386.9 MB). Free memory was 298.7 MB in the beginning and 669.2 MB in the end (delta: -370.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 985]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L987] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={16:0}] [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L988] FCALL null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L989] FCALL null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L990] FCALL null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={16:0}, null={16:0}] [L992] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L993] FCALL list->next = null VAL [list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L994] FCALL list->prev = null VAL [list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L995] FCALL list->colour = BLACK VAL [list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L997] struct TSLL* end = list; VAL [end={21:0}, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={21:0}, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={21:0}, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1030] COND FALSE !(0) VAL [end={21:0}, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1031] EXPR, FCALL end->colour VAL [end={21:0}, end->colour=1, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1031] COND FALSE !(0) VAL [end={21:0}, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1032] COND TRUE null != end VAL [end={21:0}, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1034] EXPR, FCALL end->colour VAL [end={21:0}, end->colour=1, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR, FCALL end->next VAL [end={21:0}, end->next={16:0}, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={16:0}, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1045] COND TRUE null != list VAL [end={16:0}, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1047] EXPR, FCALL list->colour VAL [end={16:0}, list={21:0}, list->colour=1, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR, FCALL list->next VAL [end={16:0}, list={21:0}, list->next={16:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1056] end = list->next [L1057] FCALL free(list) VAL [end={16:0}, list={21:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1058] list = end VAL [end={16:0}, list={16:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1045] COND FALSE !(null != list) VAL [end={16:0}, list={16:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] [L1062] return 0; VAL [\result=0, end={16:0}, list={16:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={21:0}, null={16:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 160 locations, 67 error locations. UNSAFE Result, 8.6s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2131 SDtfs, 5599 SDslu, 4426 SDs, 0 SdLazy, 5157 SolverSat, 289 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 242 SyntacticMatches, 9 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=20, 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, 20 MinimizatonAttempts, 664 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 907 NumberOfCodeBlocks, 907 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 630 ConstructedInterpolants, 26 QuantifiedInterpolants, 156195 SizeOfPredicates, 73 NumberOfNonLiveVariables, 1426 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 22 InterpolantComputations, 18 PerfectInterpolantSequences, 9/19 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-39-34-997.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_19-39-34-997.csv Received shutdown request...