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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-circular_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 20:54:01,420 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 20:54:01,422 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 20:54:01,437 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 20:54:01,437 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 20:54:01,438 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 20:54:01,439 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 20:54:01,441 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 20:54:01,443 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 20:54:01,444 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 20:54:01,445 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 20:54:01,445 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 20:54:01,446 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 20:54:01,448 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 20:54:01,449 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 20:54:01,451 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 20:54:01,454 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 20:54:01,456 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 20:54:01,457 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 20:54:01,459 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 20:54:01,461 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 20:54:01,462 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 20:54:01,462 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 20:54:01,463 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 20:54:01,464 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 20:54:01,465 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 20:54:01,465 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 20:54:01,466 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 20:54:01,466 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 20:54:01,467 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 20:54:01,467 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 20:54:01,467 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf [2018-01-24 20:54:01,476 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 20:54:01,476 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 20:54:01,477 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 20:54:01,477 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 20:54:01,477 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 20:54:01,477 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 20:54:01,478 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 20:54:01,478 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 20:54:01,478 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 20:54:01,479 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 20:54:01,479 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 20:54:01,479 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 20:54:01,479 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 20:54:01,480 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 20:54:01,480 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 20:54:01,480 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 20:54:01,480 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 20:54:01,480 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 20:54:01,481 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 20:54:01,481 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 20:54:01,481 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 20:54:01,481 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 20:54:01,481 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 20:54:01,482 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 20:54:01,482 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 20:54:01,482 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:54:01,482 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 20:54:01,482 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 20:54:01,482 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 20:54:01,483 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 20:54:01,483 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 20:54:01,483 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 20:54:01,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 20:54:01,483 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 20:54:01,484 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 20:54:01,485 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 20:54:01,485 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 20:54:01,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 20:54:01,528 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 20:54:01,531 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 20:54:01,533 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 20:54:01,533 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 20:54:01,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular_true-unreach-call_true-valid-memsafety.i [2018-01-24 20:54:01,702 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 20:54:01,706 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 20:54:01,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 20:54:01,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 20:54:01,713 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 20:54:01,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:54:01" (1/1) ... [2018-01-24 20:54:01,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7119c162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:54:01, skipping insertion in model container [2018-01-24 20:54:01,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:54:01" (1/1) ... [2018-01-24 20:54:01,731 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:54:01,771 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:54:01,888 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:54:01,907 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:54:01,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:54:01 WrapperNode [2018-01-24 20:54:01,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 20:54:01,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 20:54:01,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 20:54:01,919 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 20:54:01,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:54:01" (1/1) ... [2018-01-24 20:54:01,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:54:01" (1/1) ... [2018-01-24 20:54:01,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:54:01" (1/1) ... [2018-01-24 20:54:01,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:54:01" (1/1) ... [2018-01-24 20:54:01,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:54:01" (1/1) ... [2018-01-24 20:54:01,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:54:01" (1/1) ... [2018-01-24 20:54:01,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:54:01" (1/1) ... [2018-01-24 20:54:01,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 20:54:01,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 20:54:01,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 20:54:01,962 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 20:54:01,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:54:01" (1/1) ... No working directory specified, using /storage/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-01-24 20:54:02,015 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 20:54:02,015 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 20:54:02,015 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 20:54:02,015 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 20:54:02,015 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 20:54:02,016 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 20:54:02,016 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 20:54:02,016 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 20:54:02,016 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 20:54:02,016 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 20:54:02,016 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 20:54:02,016 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 20:54:02,016 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 20:54:02,016 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 20:54:02,016 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 20:54:02,017 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 20:54:02,017 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 20:54:02,462 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 20:54:02,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:54:02 BoogieIcfgContainer [2018-01-24 20:54:02,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 20:54:02,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 20:54:02,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 20:54:02,467 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 20:54:02,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 08:54:01" (1/3) ... [2018-01-24 20:54:02,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cab494b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:54:02, skipping insertion in model container [2018-01-24 20:54:02,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:54:01" (2/3) ... [2018-01-24 20:54:02,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cab494b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:54:02, skipping insertion in model container [2018-01-24 20:54:02,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:54:02" (3/3) ... [2018-01-24 20:54:02,472 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-circular_true-unreach-call_true-valid-memsafety.i [2018-01-24 20:54:02,481 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 20:54:02,489 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-01-24 20:54:02,535 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 20:54:02,535 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 20:54:02,536 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 20:54:02,536 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 20:54:02,536 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 20:54:02,536 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 20:54:02,536 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 20:54:02,536 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 20:54:02,537 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 20:54:02,554 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2018-01-24 20:54:02,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 20:54:02,559 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:54:02,560 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:54:02,560 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 20:54:02,564 INFO L82 PathProgramCache]: Analyzing trace with hash 414289043, now seen corresponding path program 1 times [2018-01-24 20:54:02,566 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:54:02,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:02,610 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:54:02,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:02,610 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:54:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:54:02,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:54:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:54:02,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:54:02,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:54:02,739 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:54:02,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:54:02,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:54:02,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:54:02,756 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 4 states. [2018-01-24 20:54:03,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:54:03,107 INFO L93 Difference]: Finished difference Result 222 states and 262 transitions. [2018-01-24 20:54:03,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 20:54:03,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 20:54:03,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:54:03,121 INFO L225 Difference]: With dead ends: 222 [2018-01-24 20:54:03,121 INFO L226 Difference]: Without dead ends: 120 [2018-01-24 20:54:03,125 INFO L525 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-01-24 20:54:03,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-24 20:54:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2018-01-24 20:54:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-24 20:54:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-01-24 20:54:03,173 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 8 [2018-01-24 20:54:03,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:54:03,174 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-01-24 20:54:03,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:54:03,174 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-01-24 20:54:03,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 20:54:03,175 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:54:03,175 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:54:03,175 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 20:54:03,176 INFO L82 PathProgramCache]: Analyzing trace with hash 414289044, now seen corresponding path program 1 times [2018-01-24 20:54:03,176 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:54:03,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:03,177 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:54:03,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:03,177 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:54:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:54:03,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:54:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:54:03,262 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:54:03,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:54:03,262 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:54:03,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:54:03,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:54:03,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:54:03,265 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 4 states. [2018-01-24 20:54:03,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:54:03,391 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-01-24 20:54:03,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 20:54:03,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 20:54:03,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:54:03,393 INFO L225 Difference]: With dead ends: 116 [2018-01-24 20:54:03,394 INFO L226 Difference]: Without dead ends: 111 [2018-01-24 20:54:03,395 INFO L525 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-01-24 20:54:03,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-24 20:54:03,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-01-24 20:54:03,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-24 20:54:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-24 20:54:03,407 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 8 [2018-01-24 20:54:03,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:54:03,407 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-24 20:54:03,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:54:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-24 20:54:03,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 20:54:03,408 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:54:03,408 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:54:03,408 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 20:54:03,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1743556376, now seen corresponding path program 1 times [2018-01-24 20:54:03,409 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:54:03,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:03,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:54:03,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:03,411 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:54:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:54:03,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:54:03,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:54:03,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:54:03,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:54:03,476 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:54:03,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:54:03,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:54:03,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:54:03,477 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 4 states. [2018-01-24 20:54:03,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:54:03,672 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-01-24 20:54:03,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:54:03,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 20:54:03,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:54:03,673 INFO L225 Difference]: With dead ends: 107 [2018-01-24 20:54:03,674 INFO L226 Difference]: Without dead ends: 95 [2018-01-24 20:54:03,674 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:54:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-24 20:54:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2018-01-24 20:54:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 20:54:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-01-24 20:54:03,684 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 15 [2018-01-24 20:54:03,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:54:03,684 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-01-24 20:54:03,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:54:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-01-24 20:54:03,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 20:54:03,685 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:54:03,685 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:54:03,685 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 20:54:03,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1743556377, now seen corresponding path program 1 times [2018-01-24 20:54:03,686 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:54:03,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:03,687 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:54:03,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:03,687 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:54:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:54:03,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:54:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:54:03,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:54:03,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:54:03,777 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:54:03,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:54:03,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:54:03,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:54:03,778 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 5 states. [2018-01-24 20:54:03,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:54:03,929 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-01-24 20:54:03,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:54:03,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 20:54:03,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:54:03,931 INFO L225 Difference]: With dead ends: 117 [2018-01-24 20:54:03,931 INFO L226 Difference]: Without dead ends: 113 [2018-01-24 20:54:03,931 INFO L525 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-01-24 20:54:03,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-24 20:54:03,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2018-01-24 20:54:03,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-24 20:54:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2018-01-24 20:54:03,941 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 15 [2018-01-24 20:54:03,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:54:03,941 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2018-01-24 20:54:03,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:54:03,941 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2018-01-24 20:54:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 20:54:03,942 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:54:03,942 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:54:03,942 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 20:54:03,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1046426684, now seen corresponding path program 1 times [2018-01-24 20:54:03,943 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:54:03,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:03,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:54:03,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:03,944 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:54:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:54:03,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:54:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:54:04,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:54:04,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:54:04,031 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:54:04,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:54:04,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:54:04,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:54:04,032 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 5 states. [2018-01-24 20:54:04,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:54:04,278 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2018-01-24 20:54:04,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:54:04,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 20:54:04,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:54:04,280 INFO L225 Difference]: With dead ends: 146 [2018-01-24 20:54:04,280 INFO L226 Difference]: Without dead ends: 145 [2018-01-24 20:54:04,281 INFO L525 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-01-24 20:54:04,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-24 20:54:04,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 97. [2018-01-24 20:54:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 20:54:04,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-01-24 20:54:04,291 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 18 [2018-01-24 20:54:04,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:54:04,291 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-01-24 20:54:04,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:54:04,291 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-01-24 20:54:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 20:54:04,292 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:54:04,292 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:54:04,292 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 20:54:04,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1046426685, now seen corresponding path program 1 times [2018-01-24 20:54:04,292 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:54:04,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:04,293 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:54:04,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:04,293 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:54:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:54:04,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:54:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:54:04,359 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:54:04,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:54:04,360 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:54:04,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:54:04,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:54:04,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:54:04,361 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 5 states. [2018-01-24 20:54:04,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:54:04,552 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2018-01-24 20:54:04,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:54:04,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 20:54:04,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:54:04,554 INFO L225 Difference]: With dead ends: 142 [2018-01-24 20:54:04,554 INFO L226 Difference]: Without dead ends: 141 [2018-01-24 20:54:04,554 INFO L525 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-01-24 20:54:04,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-24 20:54:04,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 96. [2018-01-24 20:54:04,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 20:54:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-01-24 20:54:04,564 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 18 [2018-01-24 20:54:04,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:54:04,565 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-01-24 20:54:04,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:54:04,565 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-01-24 20:54:04,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 20:54:04,566 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:54:04,566 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:54:04,566 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 20:54:04,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1771867382, now seen corresponding path program 1 times [2018-01-24 20:54:04,566 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:54:04,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:04,568 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:54:04,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:04,568 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:54:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:54:04,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:54:04,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:54:04,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:54:04,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 20:54:04,820 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:54:04,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 20:54:04,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 20:54:04,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-24 20:54:04,821 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 10 states. [2018-01-24 20:54:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:54:05,166 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2018-01-24 20:54:05,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 20:54:05,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-24 20:54:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:54:05,168 INFO L225 Difference]: With dead ends: 140 [2018-01-24 20:54:05,168 INFO L226 Difference]: Without dead ends: 139 [2018-01-24 20:54:05,168 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2018-01-24 20:54:05,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-24 20:54:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 103. [2018-01-24 20:54:05,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 20:54:05,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-01-24 20:54:05,179 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 22 [2018-01-24 20:54:05,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:54:05,179 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-01-24 20:54:05,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 20:54:05,179 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-01-24 20:54:05,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 20:54:05,180 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:54:05,180 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:54:05,180 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 20:54:05,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1771867381, now seen corresponding path program 1 times [2018-01-24 20:54:05,180 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:54:05,181 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:05,181 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:54:05,181 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:05,181 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:54:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:54:05,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:54:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:54:05,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:54:05,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 20:54:05,498 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:54:05,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 20:54:05,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 20:54:05,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 20:54:05,499 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 9 states. [2018-01-24 20:54:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:54:05,822 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2018-01-24 20:54:05,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 20:54:05,822 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 20:54:05,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:54:05,823 INFO L225 Difference]: With dead ends: 177 [2018-01-24 20:54:05,823 INFO L226 Difference]: Without dead ends: 172 [2018-01-24 20:54:05,824 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-01-24 20:54:05,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-01-24 20:54:05,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 116. [2018-01-24 20:54:05,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-24 20:54:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2018-01-24 20:54:05,835 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 22 [2018-01-24 20:54:05,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:54:05,836 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2018-01-24 20:54:05,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 20:54:05,836 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2018-01-24 20:54:05,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 20:54:05,837 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:54:05,837 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:54:05,837 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 20:54:05,837 INFO L82 PathProgramCache]: Analyzing trace with hash 687906629, now seen corresponding path program 1 times [2018-01-24 20:54:05,837 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:54:05,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:05,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:54:05,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:05,839 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:54:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:54:05,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:54:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:54:05,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:54:05,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 20:54:05,933 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:54:05,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 20:54:05,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 20:54:05,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 20:54:05,933 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand 9 states. [2018-01-24 20:54:06,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:54:06,545 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2018-01-24 20:54:06,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 20:54:06,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 20:54:06,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:54:06,547 INFO L225 Difference]: With dead ends: 123 [2018-01-24 20:54:06,547 INFO L226 Difference]: Without dead ends: 122 [2018-01-24 20:54:06,547 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-01-24 20:54:06,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-24 20:54:06,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 115. [2018-01-24 20:54:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-24 20:54:06,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2018-01-24 20:54:06,558 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 22 [2018-01-24 20:54:06,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:54:06,559 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2018-01-24 20:54:06,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 20:54:06,559 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2018-01-24 20:54:06,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 20:54:06,560 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:54:06,560 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:54:06,560 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 20:54:06,560 INFO L82 PathProgramCache]: Analyzing trace with hash 687906630, now seen corresponding path program 1 times [2018-01-24 20:54:06,561 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:54:06,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:06,562 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:54:06,562 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:06,562 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:54:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:54:06,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:54:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:54:06,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:54:06,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 20:54:06,717 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:54:06,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 20:54:06,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 20:54:06,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 20:54:06,717 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand 10 states. [2018-01-24 20:54:07,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:54:07,193 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2018-01-24 20:54:07,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 20:54:07,193 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-24 20:54:07,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:54:07,194 INFO L225 Difference]: With dead ends: 123 [2018-01-24 20:54:07,194 INFO L226 Difference]: Without dead ends: 117 [2018-01-24 20:54:07,195 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-01-24 20:54:07,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-24 20:54:07,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2018-01-24 20:54:07,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 20:54:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-01-24 20:54:07,200 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 22 [2018-01-24 20:54:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:54:07,200 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-01-24 20:54:07,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 20:54:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-01-24 20:54:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 20:54:07,201 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:54:07,201 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:54:07,201 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 20:54:07,201 INFO L82 PathProgramCache]: Analyzing trace with hash 36223985, now seen corresponding path program 1 times [2018-01-24 20:54:07,202 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:54:07,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:07,202 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:54:07,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:07,202 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:54:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:54:07,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:54:07,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:54:07,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:54:07,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 20:54:07,439 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:54:07,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 20:54:07,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 20:54:07,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 20:54:07,440 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 10 states. [2018-01-24 20:54:07,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:54:07,745 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2018-01-24 20:54:07,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 20:54:07,745 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-01-24 20:54:07,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:54:07,746 INFO L225 Difference]: With dead ends: 147 [2018-01-24 20:54:07,746 INFO L226 Difference]: Without dead ends: 146 [2018-01-24 20:54:07,747 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-01-24 20:54:07,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-24 20:54:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 103. [2018-01-24 20:54:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 20:54:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-01-24 20:54:07,752 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 26 [2018-01-24 20:54:07,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:54:07,753 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-01-24 20:54:07,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 20:54:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-01-24 20:54:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 20:54:07,754 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:54:07,754 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:54:07,754 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 20:54:07,754 INFO L82 PathProgramCache]: Analyzing trace with hash 36223986, now seen corresponding path program 1 times [2018-01-24 20:54:07,754 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:54:07,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:07,755 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:54:07,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:07,756 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:54:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:54:07,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:54:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:54:07,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:54:07,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 20:54:07,945 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:54:07,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 20:54:07,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 20:54:07,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 20:54:07,946 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 9 states. [2018-01-24 20:54:08,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:54:08,301 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2018-01-24 20:54:08,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 20:54:08,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-01-24 20:54:08,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:54:08,303 INFO L225 Difference]: With dead ends: 159 [2018-01-24 20:54:08,303 INFO L226 Difference]: Without dead ends: 158 [2018-01-24 20:54:08,303 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-01-24 20:54:08,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-24 20:54:08,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 103. [2018-01-24 20:54:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-24 20:54:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-01-24 20:54:08,312 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 26 [2018-01-24 20:54:08,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:54:08,312 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-01-24 20:54:08,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 20:54:08,312 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-01-24 20:54:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 20:54:08,313 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:54:08,314 INFO L322 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-01-24 20:54:08,314 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 20:54:08,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1122483890, now seen corresponding path program 1 times [2018-01-24 20:54:08,314 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:54:08,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:08,315 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:54:08,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:08,315 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:54:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:54:08,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:54:08,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:54:08,397 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:54:08,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 20:54:08,397 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:54:08,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 20:54:08,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 20:54:08,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:54:08,398 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 7 states. [2018-01-24 20:54:08,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:54:08,720 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2018-01-24 20:54:08,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 20:54:08,720 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-01-24 20:54:08,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:54:08,721 INFO L225 Difference]: With dead ends: 140 [2018-01-24 20:54:08,722 INFO L226 Difference]: Without dead ends: 139 [2018-01-24 20:54:08,722 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-24 20:54:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-24 20:54:08,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 105. [2018-01-24 20:54:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-24 20:54:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-01-24 20:54:08,729 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 27 [2018-01-24 20:54:08,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:54:08,729 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-01-24 20:54:08,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 20:54:08,730 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-01-24 20:54:08,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 20:54:08,730 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:54:08,731 INFO L322 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-01-24 20:54:08,731 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 20:54:08,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1122483891, now seen corresponding path program 1 times [2018-01-24 20:54:08,731 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:54:08,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:08,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:54:08,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:08,733 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:54:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:54:08,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:54:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:54:09,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:54:09,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 20:54:09,159 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:54:09,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 20:54:09,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 20:54:09,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 20:54:09,160 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 11 states. [2018-01-24 20:54:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:54:09,619 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2018-01-24 20:54:09,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 20:54:09,620 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-01-24 20:54:09,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:54:09,621 INFO L225 Difference]: With dead ends: 169 [2018-01-24 20:54:09,621 INFO L226 Difference]: Without dead ends: 165 [2018-01-24 20:54:09,622 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2018-01-24 20:54:09,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-24 20:54:09,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 130. [2018-01-24 20:54:09,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-01-24 20:54:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2018-01-24 20:54:09,634 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 27 [2018-01-24 20:54:09,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:54:09,634 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2018-01-24 20:54:09,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 20:54:09,634 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2018-01-24 20:54:09,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 20:54:09,635 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:54:09,635 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:54:09,635 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 20:54:09,636 INFO L82 PathProgramCache]: Analyzing trace with hash -152260992, now seen corresponding path program 1 times [2018-01-24 20:54:09,636 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:54:09,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:09,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:54:09,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:09,637 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:54:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:54:09,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:54:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:54:09,882 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:54:09,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 20:54:09,882 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:54:09,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 20:54:09,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 20:54:09,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 20:54:09,883 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand 10 states. [2018-01-24 20:54:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:54:10,293 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2018-01-24 20:54:10,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 20:54:10,294 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-24 20:54:10,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:54:10,295 INFO L225 Difference]: With dead ends: 144 [2018-01-24 20:54:10,295 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 20:54:10,295 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-01-24 20:54:10,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 20:54:10,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 129. [2018-01-24 20:54:10,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-24 20:54:10,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 153 transitions. [2018-01-24 20:54:10,310 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 153 transitions. Word has length 31 [2018-01-24 20:54:10,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:54:10,310 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 153 transitions. [2018-01-24 20:54:10,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 20:54:10,310 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 153 transitions. [2018-01-24 20:54:10,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 20:54:10,311 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:54:10,312 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:54:10,312 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 20:54:10,312 INFO L82 PathProgramCache]: Analyzing trace with hash -771319912, now seen corresponding path program 1 times [2018-01-24 20:54:10,312 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:54:10,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:10,313 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:54:10,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:10,313 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:54:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:54:10,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:54:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:54:10,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:54:10,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 20:54:10,519 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:54:10,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 20:54:10,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 20:54:10,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 20:54:10,520 INFO L87 Difference]: Start difference. First operand 129 states and 153 transitions. Second operand 9 states. [2018-01-24 20:54:10,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:54:10,841 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-01-24 20:54:10,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 20:54:10,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-24 20:54:10,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:54:10,842 INFO L225 Difference]: With dead ends: 154 [2018-01-24 20:54:10,842 INFO L226 Difference]: Without dead ends: 153 [2018-01-24 20:54:10,843 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-01-24 20:54:10,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-24 20:54:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 129. [2018-01-24 20:54:10,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-24 20:54:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2018-01-24 20:54:10,853 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 31 [2018-01-24 20:54:10,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:54:10,853 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2018-01-24 20:54:10,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 20:54:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2018-01-24 20:54:10,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 20:54:10,854 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:54:10,854 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:54:10,854 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 20:54:10,854 INFO L82 PathProgramCache]: Analyzing trace with hash -771319913, now seen corresponding path program 1 times [2018-01-24 20:54:10,855 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:54:10,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:10,855 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:54:10,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:10,856 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:54:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:54:10,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:54:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:54:11,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:54:11,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 20:54:11,250 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:54:11,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 20:54:11,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 20:54:11,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 20:54:11,251 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 10 states. [2018-01-24 20:54:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:54:11,528 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2018-01-24 20:54:11,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 20:54:11,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-24 20:54:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:54:11,529 INFO L225 Difference]: With dead ends: 148 [2018-01-24 20:54:11,529 INFO L226 Difference]: Without dead ends: 147 [2018-01-24 20:54:11,530 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-01-24 20:54:11,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-01-24 20:54:11,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2018-01-24 20:54:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-24 20:54:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 151 transitions. [2018-01-24 20:54:11,543 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 151 transitions. Word has length 31 [2018-01-24 20:54:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:54:11,544 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 151 transitions. [2018-01-24 20:54:11,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 20:54:11,544 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 151 transitions. [2018-01-24 20:54:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 20:54:11,544 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:54:11,545 INFO L322 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] [2018-01-24 20:54:11,545 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 20:54:11,545 INFO L82 PathProgramCache]: Analyzing trace with hash -246205034, now seen corresponding path program 1 times [2018-01-24 20:54:11,545 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:54:11,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:11,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:54:11,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:11,546 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:54:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:54:11,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:54:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:54:11,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:54:11,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 20:54:11,838 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:54:11,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 20:54:11,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 20:54:11,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-01-24 20:54:11,839 INFO L87 Difference]: Start difference. First operand 129 states and 151 transitions. Second operand 13 states. [2018-01-24 20:54:12,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:54:12,160 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-01-24 20:54:12,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 20:54:12,161 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-01-24 20:54:12,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:54:12,161 INFO L225 Difference]: With dead ends: 165 [2018-01-24 20:54:12,161 INFO L226 Difference]: Without dead ends: 142 [2018-01-24 20:54:12,162 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-01-24 20:54:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-24 20:54:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2018-01-24 20:54:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-24 20:54:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2018-01-24 20:54:12,170 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 33 [2018-01-24 20:54:12,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:54:12,170 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2018-01-24 20:54:12,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 20:54:12,170 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2018-01-24 20:54:12,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 20:54:12,171 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:54:12,171 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:54:12,171 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr46EnsuresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-01-24 20:54:12,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1646590979, now seen corresponding path program 1 times [2018-01-24 20:54:12,171 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:54:12,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:12,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:54:12,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:54:12,172 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:54:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:54:12,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:54:12,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:54:12,400 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:54:12,400 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:54:12,401 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-24 20:54:12,402 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [11], [15], [17], [20], [83], [86], [89], [93], [98], [102], [110], [112], [113], [119], [123], [124], [127], [130], [133], [151], [155], [161], [164], [201], [202], [206], [207], [208] [2018-01-24 20:54:12,450 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:54:12,451 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown