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/mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf -i ../../../trunk/examples/svcomp/memsafety/test-0521_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 03:01:57,103 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 03:01:57,105 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 03:01:57,120 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 03:01:57,120 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 03:01:57,121 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 03:01:57,122 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 03:01:57,124 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 03:01:57,125 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 03:01:57,126 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 03:01:57,127 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 03:01:57,127 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 03:01:57,128 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 03:01:57,129 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 03:01:57,130 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 03:01:57,133 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 03:01:57,135 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 03:01:57,137 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 03:01:57,138 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 03:01:57,139 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 03:01:57,142 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 03:01:57,142 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 03:01:57,142 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 03:01:57,143 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 03:01:57,144 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 03:01:57,145 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 03:01:57,145 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 03:01:57,146 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 03:01:57,146 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 03:01:57,146 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 03:01:57,147 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 03:01:57,147 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf [2018-01-21 03:01:57,160 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 03:01:57,160 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 03:01:57,161 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 03:01:57,161 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 03:01:57,161 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 03:01:57,162 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 03:01:57,162 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 03:01:57,162 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 03:01:57,162 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 03:01:57,163 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 03:01:57,163 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 03:01:57,164 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 03:01:57,164 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 03:01:57,164 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 03:01:57,164 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 03:01:57,164 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 03:01:57,164 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 03:01:57,165 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 03:01:57,165 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 03:01:57,165 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 03:01:57,165 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 03:01:57,165 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 03:01:57,166 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 03:01:57,168 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 03:01:57,168 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 03:01:57,168 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 03:01:57,168 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 03:01:57,169 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 03:01:57,169 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 03:01:57,169 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 03:01:57,169 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 03:01:57,169 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 03:01:57,170 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 03:01:57,170 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 03:01:57,171 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 03:01:57,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 03:01:57,171 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 03:01:57,171 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 03:01:57,172 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 03:01:57,173 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 03:01:57,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 03:01:57,272 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 03:01:57,276 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 03:01:57,277 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 03:01:57,278 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 03:01:57,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0521_true-valid-memsafety.i [2018-01-21 03:01:57,510 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 03:01:57,513 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 03:01:57,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 03:01:57,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 03:01:57,519 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 03:01:57,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:01:57" (1/1) ... [2018-01-21 03:01:57,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25e082f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:01:57, skipping insertion in model container [2018-01-21 03:01:57,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:01:57" (1/1) ... [2018-01-21 03:01:57,539 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:01:57,606 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:01:57,771 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:01:57,813 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:01:57,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:01:57 WrapperNode [2018-01-21 03:01:57,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 03:01:57,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 03:01:57,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 03:01:57,826 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 03:01:57,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:01:57" (1/1) ... [2018-01-21 03:01:57,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:01:57" (1/1) ... [2018-01-21 03:01:57,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:01:57" (1/1) ... [2018-01-21 03:01:57,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:01:57" (1/1) ... [2018-01-21 03:01:57,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:01:57" (1/1) ... [2018-01-21 03:01:57,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:01:57" (1/1) ... [2018-01-21 03:01:57,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:01:57" (1/1) ... [2018-01-21 03:01:57,885 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 03:01:57,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 03:01:57,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 03:01:57,886 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 03:01:57,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:01:57" (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-21 03:01:57,966 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 03:01:57,966 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 03:01:57,966 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 03:01:57,967 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 03:01:57,967 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 03:01:57,967 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 03:01:57,967 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 03:01:57,967 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 03:01:57,967 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 03:01:57,968 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 03:01:57,968 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 03:01:57,968 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-21 03:01:57,968 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 03:01:57,968 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 03:01:57,968 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 03:01:57,968 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 03:01:58,600 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 03:01:58,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:01:58 BoogieIcfgContainer [2018-01-21 03:01:58,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 03:01:58,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 03:01:58,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 03:01:58,605 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 03:01:58,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 03:01:57" (1/3) ... [2018-01-21 03:01:58,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618bfc53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:01:58, skipping insertion in model container [2018-01-21 03:01:58,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:01:57" (2/3) ... [2018-01-21 03:01:58,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618bfc53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:01:58, skipping insertion in model container [2018-01-21 03:01:58,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:01:58" (3/3) ... [2018-01-21 03:01:58,610 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0521_true-valid-memsafety.i [2018-01-21 03:01:58,620 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 03:01:58,630 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 03:01:58,699 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:01:58,699 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:01:58,699 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:01:58,700 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:01:58,700 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:01:58,700 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:01:58,700 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:01:58,700 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 03:01:58,701 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:01:58,727 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2018-01-21 03:01:58,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 03:01:58,735 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:01:58,736 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 03:01:58,737 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 03:01:58,742 INFO L82 PathProgramCache]: Analyzing trace with hash 373147, now seen corresponding path program 1 times [2018-01-21 03:01:58,745 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:01:58,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:01:58,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:01:58,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:01:58,809 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:01:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:01:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:01:58,883 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:01:58,891 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:01:58,901 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:01:58,901 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:01:58,901 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:01:58,901 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:01:58,901 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:01:58,901 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:01:58,902 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:01:58,902 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 03:01:58,902 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:01:58,907 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2018-01-21 03:01:58,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 03:01:58,910 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:01:58,910 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] [2018-01-21 03:01:58,911 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:01:58,911 INFO L82 PathProgramCache]: Analyzing trace with hash -26575740, now seen corresponding path program 1 times [2018-01-21 03:01:58,911 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:01:58,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:01:58,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:01:58,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:01:58,913 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:01:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:01:58,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:01:58,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:01:58,971 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:01:58,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:01:58,987 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:01:58,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 03:01:59,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 03:01:59,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:01:59,083 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 2 states. [2018-01-21 03:01:59,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:01:59,112 INFO L93 Difference]: Finished difference Result 311 states and 385 transitions. [2018-01-21 03:01:59,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 03:01:59,114 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-01-21 03:01:59,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:01:59,128 INFO L225 Difference]: With dead ends: 311 [2018-01-21 03:01:59,128 INFO L226 Difference]: Without dead ends: 156 [2018-01-21 03:01:59,132 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:01:59,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-21 03:01:59,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-01-21 03:01:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-01-21 03:01:59,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2018-01-21 03:01:59,173 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 24 [2018-01-21 03:01:59,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:01:59,174 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2018-01-21 03:01:59,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 03:01:59,174 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2018-01-21 03:01:59,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 03:01:59,175 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:01:59,175 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, 1] [2018-01-21 03:01:59,175 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:01:59,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1949893135, now seen corresponding path program 1 times [2018-01-21 03:01:59,176 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:01:59,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:01:59,177 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:01:59,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:01:59,177 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:01:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:01:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:01:59,229 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:01:59,238 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:01:59,239 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,239 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,239 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,240 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,240 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,240 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,240 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,240 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,241 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,241 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,241 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,242 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,242 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,242 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,243 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,243 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,243 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,244 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,244 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,244 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,245 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,245 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,245 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,246 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,246 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,246 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,247 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,247 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,247 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,247 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,248 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,248 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,248 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,249 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,249 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,249 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,249 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,250 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,250 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,250 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,251 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,251 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,251 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,251 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,252 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,252 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,252 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,252 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,253 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,253 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,253 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,253 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,253 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,254 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,254 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,254 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,254 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,255 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,255 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:01:59,255 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,256 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,256 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~7 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,256 WARN L343 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ~iter~22 : { list : $Pointer$, node : $Pointer$ } not handled [2018-01-21 03:01:59,256 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:01:59,261 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 03:01:59,262 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 03:01:59,262 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 03:01:59,263 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 03:01:59,263 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 03:01:59,263 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 03:01:59,264 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 03:01:59,264 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 03:01:59,265 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 03:01:59,265 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 03:01:59,266 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 03:01:59,266 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 03:01:59,266 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 03:01:59,267 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 03:01:59,267 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 03:01:59,268 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 03:01:59,268 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 03:01:59,269 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 03:01:59,269 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 03:01:59,269 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~7.list [2018-01-21 03:01:59,269 WARN L1215 BoogieBacktranslator]: unknown boogie variable ~iter~22.list [2018-01-21 03:01:59,278 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:01:59,278 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:01:59,278 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:01:59,279 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:01:59,279 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:01:59,279 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:01:59,279 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:01:59,279 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 03:01:59,279 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:01:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2018-01-21 03:01:59,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 03:01:59,284 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:01:59,285 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-21 03:01:59,285 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 03:01:59,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1595501289, now seen corresponding path program 1 times [2018-01-21 03:01:59,285 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:01:59,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:01:59,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:01:59,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:01:59,287 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:01:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:01:59,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:01:59,312 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-21 03:01:59,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:01:59,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:01:59,313 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:01:59,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 03:01:59,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 03:01:59,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:01:59,314 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 2 states. [2018-01-21 03:01:59,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:01:59,328 INFO L93 Difference]: Finished difference Result 311 states and 385 transitions. [2018-01-21 03:01:59,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 03:01:59,328 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-01-21 03:01:59,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:01:59,330 INFO L225 Difference]: With dead ends: 311 [2018-01-21 03:01:59,331 INFO L226 Difference]: Without dead ends: 154 [2018-01-21 03:01:59,331 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:01:59,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-21 03:01:59,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-01-21 03:01:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-21 03:01:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 181 transitions. [2018-01-21 03:01:59,341 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 181 transitions. Word has length 22 [2018-01-21 03:01:59,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:01:59,341 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 181 transitions. [2018-01-21 03:01:59,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 03:01:59,341 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 181 transitions. [2018-01-21 03:01:59,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 03:01:59,342 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:01:59,343 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] [2018-01-21 03:01:59,343 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 03:01:59,343 INFO L82 PathProgramCache]: Analyzing trace with hash -359570538, now seen corresponding path program 1 times [2018-01-21 03:01:59,343 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:01:59,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:01:59,344 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:01:59,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:01:59,344 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:01:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:01:59,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:01:59,432 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-21 03:01:59,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:01:59,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:01:59,433 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:01:59,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:01:59,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:01:59,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:01:59,433 INFO L87 Difference]: Start difference. First operand 154 states and 181 transitions. Second operand 3 states. [2018-01-21 03:01:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:01:59,577 INFO L93 Difference]: Finished difference Result 243 states and 292 transitions. [2018-01-21 03:01:59,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:01:59,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-01-21 03:01:59,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:01:59,580 INFO L225 Difference]: With dead ends: 243 [2018-01-21 03:01:59,580 INFO L226 Difference]: Without dead ends: 240 [2018-01-21 03:01:59,581 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:01:59,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-21 03:01:59,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 228. [2018-01-21 03:01:59,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-01-21 03:01:59,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 276 transitions. [2018-01-21 03:01:59,600 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 276 transitions. Word has length 30 [2018-01-21 03:01:59,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:01:59,601 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 276 transitions. [2018-01-21 03:01:59,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:01:59,601 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 276 transitions. [2018-01-21 03:01:59,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-21 03:01:59,604 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:01:59,604 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, 1, 1, 1, 1, 1, 1] [2018-01-21 03:01:59,604 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 03:01:59,605 INFO L82 PathProgramCache]: Analyzing trace with hash -123063933, now seen corresponding path program 1 times [2018-01-21 03:01:59,605 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:01:59,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:01:59,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:01:59,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:01:59,606 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:01:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:01:59,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:01:59,763 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-21 03:01:59,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:01:59,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 03:01:59,764 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:01:59,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 03:01:59,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 03:01:59,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 03:01:59,765 INFO L87 Difference]: Start difference. First operand 228 states and 276 transitions. Second operand 4 states. [2018-01-21 03:01:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:01:59,859 INFO L93 Difference]: Finished difference Result 489 states and 587 transitions. [2018-01-21 03:01:59,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 03:01:59,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-01-21 03:01:59,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:01:59,863 INFO L225 Difference]: With dead ends: 489 [2018-01-21 03:01:59,863 INFO L226 Difference]: Without dead ends: 313 [2018-01-21 03:01:59,865 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-21 03:01:59,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-01-21 03:01:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 236. [2018-01-21 03:01:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-01-21 03:01:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 285 transitions. [2018-01-21 03:01:59,883 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 285 transitions. Word has length 40 [2018-01-21 03:01:59,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:01:59,884 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 285 transitions. [2018-01-21 03:01:59,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 03:01:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 285 transitions. [2018-01-21 03:01:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-21 03:01:59,886 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:01:59,886 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:01:59,886 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 03:01:59,887 INFO L82 PathProgramCache]: Analyzing trace with hash 90705220, now seen corresponding path program 1 times [2018-01-21 03:01:59,887 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:01:59,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:01:59,888 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:01:59,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:01:59,888 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:01:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:01:59,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:02:00,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:02:00,006 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:02:00,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 03:02:00,006 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:02:00,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 03:02:00,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 03:02:00,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-21 03:02:00,008 INFO L87 Difference]: Start difference. First operand 236 states and 285 transitions. Second operand 6 states. [2018-01-21 03:02:00,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:02:00,579 INFO L93 Difference]: Finished difference Result 594 states and 707 transitions. [2018-01-21 03:02:00,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 03:02:00,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-01-21 03:02:00,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:02:00,583 INFO L225 Difference]: With dead ends: 594 [2018-01-21 03:02:00,583 INFO L226 Difference]: Without dead ends: 466 [2018-01-21 03:02:00,584 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-21 03:02:00,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-01-21 03:02:00,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 242. [2018-01-21 03:02:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-01-21 03:02:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 291 transitions. [2018-01-21 03:02:00,602 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 291 transitions. Word has length 46 [2018-01-21 03:02:00,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:02:00,602 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 291 transitions. [2018-01-21 03:02:00,602 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 03:02:00,602 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 291 transitions. [2018-01-21 03:02:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-21 03:02:00,605 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:02:00,605 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:02:00,605 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-21 03:02:00,605 INFO L82 PathProgramCache]: Analyzing trace with hash 166146402, now seen corresponding path program 1 times [2018-01-21 03:02:00,606 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:02:00,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:02:00,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:02:00,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:02:00,607 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:02:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:02:00,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:02:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 03:02:00,642 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:02:00,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 03:02:00,642 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:02:00,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:02:00,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:02:00,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:02:00,643 INFO L87 Difference]: Start difference. First operand 242 states and 291 transitions. Second operand 3 states. [2018-01-21 03:02:00,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:02:00,685 INFO L93 Difference]: Finished difference Result 394 states and 475 transitions. [2018-01-21 03:02:00,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:02:00,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-01-21 03:02:00,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:02:00,688 INFO L225 Difference]: With dead ends: 394 [2018-01-21 03:02:00,688 INFO L226 Difference]: Without dead ends: 244 [2018-01-21 03:02:00,689 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:02:00,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-01-21 03:02:00,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2018-01-21 03:02:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-01-21 03:02:00,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 292 transitions. [2018-01-21 03:02:00,701 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 292 transitions. Word has length 47 [2018-01-21 03:02:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:02:00,701 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 292 transitions. [2018-01-21 03:02:00,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:02:00,701 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 292 transitions. [2018-01-21 03:02:00,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-21 03:02:00,703 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:02:00,703 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:02:00,703 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-21 03:02:00,704 INFO L82 PathProgramCache]: Analyzing trace with hash -987135777, now seen corresponding path program 1 times [2018-01-21 03:02:00,704 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:02:00,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:02:00,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:02:00,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:02:00,705 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:02:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:02:00,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:02:00,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 03:02:00,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:02:00,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 03:02:00,795 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:02:00,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 03:02:00,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 03:02:00,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:02:00,796 INFO L87 Difference]: Start difference. First operand 244 states and 292 transitions. Second operand 5 states. [2018-01-21 03:02:00,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:02:00,936 INFO L93 Difference]: Finished difference Result 363 states and 429 transitions. [2018-01-21 03:02:00,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 03:02:00,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-01-21 03:02:00,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:02:00,939 INFO L225 Difference]: With dead ends: 363 [2018-01-21 03:02:00,939 INFO L226 Difference]: Without dead ends: 178 [2018-01-21 03:02:00,940 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-21 03:02:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-21 03:02:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 164. [2018-01-21 03:02:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-01-21 03:02:00,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 191 transitions. [2018-01-21 03:02:00,948 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 191 transitions. Word has length 49 [2018-01-21 03:02:00,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:02:00,948 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 191 transitions. [2018-01-21 03:02:00,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 03:02:00,949 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 191 transitions. [2018-01-21 03:02:00,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-21 03:02:00,949 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:02:00,950 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:02:00,950 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-21 03:02:00,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1230398727, now seen corresponding path program 1 times [2018-01-21 03:02:00,952 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:02:00,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:02:00,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:02:00,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:02:00,954 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:02:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:02:00,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:02:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:02:01,119 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:02:01,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-21 03:02:01,120 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:02:01,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-21 03:02:01,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-21 03:02:01,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-21 03:02:01,121 INFO L87 Difference]: Start difference. First operand 164 states and 191 transitions. Second operand 7 states. [2018-01-21 03:02:01,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:02:01,584 INFO L93 Difference]: Finished difference Result 439 states and 510 transitions. [2018-01-21 03:02:01,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 03:02:01,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-01-21 03:02:01,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:02:01,586 INFO L225 Difference]: With dead ends: 439 [2018-01-21 03:02:01,586 INFO L226 Difference]: Without dead ends: 334 [2018-01-21 03:02:01,586 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-21 03:02:01,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-01-21 03:02:01,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 208. [2018-01-21 03:02:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-01-21 03:02:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 245 transitions. [2018-01-21 03:02:01,596 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 245 transitions. Word has length 51 [2018-01-21 03:02:01,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:02:01,597 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 245 transitions. [2018-01-21 03:02:01,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-21 03:02:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 245 transitions. [2018-01-21 03:02:01,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-21 03:02:01,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:02:01,598 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:02:01,598 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-21 03:02:01,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1850402931, now seen corresponding path program 1 times [2018-01-21 03:02:01,599 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:02:01,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:02:01,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:02:01,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:02:01,600 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:02:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:02:01,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:02:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-21 03:02:01,860 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:02:01,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 03:02:01,860 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:02:01,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 03:02:01,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 03:02:01,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-21 03:02:01,861 INFO L87 Difference]: Start difference. First operand 208 states and 245 transitions. Second operand 8 states. [2018-01-21 03:02:02,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:02:02,294 INFO L93 Difference]: Finished difference Result 597 states and 689 transitions. [2018-01-21 03:02:02,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-21 03:02:02,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-01-21 03:02:02,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:02:02,298 INFO L225 Difference]: With dead ends: 597 [2018-01-21 03:02:02,299 INFO L226 Difference]: Without dead ends: 492 [2018-01-21 03:02:02,300 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-01-21 03:02:02,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-01-21 03:02:02,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 262. [2018-01-21 03:02:02,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-01-21 03:02:02,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 306 transitions. [2018-01-21 03:02:02,317 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 306 transitions. Word has length 65 [2018-01-21 03:02:02,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:02:02,317 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 306 transitions. [2018-01-21 03:02:02,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 03:02:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 306 transitions. [2018-01-21 03:02:02,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-21 03:02:02,319 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:02:02,319 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:02:02,319 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-21 03:02:02,319 INFO L82 PathProgramCache]: Analyzing trace with hash 835647732, now seen corresponding path program 1 times [2018-01-21 03:02:02,319 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:02:02,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:02:02,321 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:02:02,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:02:02,321 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:02:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:02:02,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:02:02,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 03:02:02,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:02:02,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-21 03:02:02,429 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:02:02,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-21 03:02:02,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-21 03:02:02,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-21 03:02:02,430 INFO L87 Difference]: Start difference. First operand 262 states and 306 transitions. Second operand 7 states. [2018-01-21 03:02:02,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:02:02,611 INFO L93 Difference]: Finished difference Result 451 states and 522 transitions. [2018-01-21 03:02:02,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 03:02:02,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-01-21 03:02:02,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:02:02,614 INFO L225 Difference]: With dead ends: 451 [2018-01-21 03:02:02,614 INFO L226 Difference]: Without dead ends: 398 [2018-01-21 03:02:02,615 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-21 03:02:02,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-01-21 03:02:02,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 265. [2018-01-21 03:02:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-01-21 03:02:02,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 309 transitions. [2018-01-21 03:02:02,627 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 309 transitions. Word has length 66 [2018-01-21 03:02:02,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:02:02,627 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 309 transitions. [2018-01-21 03:02:02,627 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-21 03:02:02,627 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 309 transitions. [2018-01-21 03:02:02,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-21 03:02:02,628 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:02:02,628 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:02:02,628 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-21 03:02:02,628 INFO L82 PathProgramCache]: Analyzing trace with hash -475061263, now seen corresponding path program 1 times [2018-01-21 03:02:02,628 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:02:02,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:02:02,629 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:02:02,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:02:02,629 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:02:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:02:02,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:02:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 03:02:03,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:02:03,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-21 03:02:03,286 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:02:03,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-21 03:02:03,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-21 03:02:03,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-21 03:02:03,287 INFO L87 Difference]: Start difference. First operand 265 states and 309 transitions. Second operand 12 states. [2018-01-21 03:02:04,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:02:04,118 INFO L93 Difference]: Finished difference Result 383 states and 446 transitions. [2018-01-21 03:02:04,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-21 03:02:04,118 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2018-01-21 03:02:04,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:02:04,120 INFO L225 Difference]: With dead ends: 383 [2018-01-21 03:02:04,120 INFO L226 Difference]: Without dead ends: 364 [2018-01-21 03:02:04,121 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2018-01-21 03:02:04,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-01-21 03:02:04,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 287. [2018-01-21 03:02:04,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-01-21 03:02:04,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 334 transitions. [2018-01-21 03:02:04,135 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 334 transitions. Word has length 68 [2018-01-21 03:02:04,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:02:04,136 INFO L432 AbstractCegarLoop]: Abstraction has 287 states and 334 transitions. [2018-01-21 03:02:04,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-21 03:02:04,137 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 334 transitions. [2018-01-21 03:02:04,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-21 03:02:04,138 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:02:04,138 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 03:02:04,138 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-21 03:02:04,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1235268699, now seen corresponding path program 1 times [2018-01-21 03:02:04,139 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:02:04,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:02:04,140 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:02:04,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:02:04,140 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:02:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:02:04,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:02:04,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-21 03:02:04,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:02:04,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-01-21 03:02:04,536 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:02:04,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-21 03:02:04,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-21 03:02:04,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-01-21 03:02:04,537 INFO L87 Difference]: Start difference. First operand 287 states and 334 transitions. Second operand 14 states. [2018-01-21 03:02:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:02:05,376 INFO L93 Difference]: Finished difference Result 445 states and 523 transitions. [2018-01-21 03:02:05,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-21 03:02:05,377 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2018-01-21 03:02:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:02:05,379 INFO L225 Difference]: With dead ends: 445 [2018-01-21 03:02:05,390 INFO L226 Difference]: Without dead ends: 374 [2018-01-21 03:02:05,391 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2018-01-21 03:02:05,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-01-21 03:02:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 302. [2018-01-21 03:02:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-01-21 03:02:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 351 transitions. [2018-01-21 03:02:05,407 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 351 transitions. Word has length 74 [2018-01-21 03:02:05,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:02:05,407 INFO L432 AbstractCegarLoop]: Abstraction has 302 states and 351 transitions. [2018-01-21 03:02:05,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-21 03:02:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 351 transitions. [2018-01-21 03:02:05,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-21 03:02:05,409 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:02:05,409 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 03:02:05,409 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-21 03:02:05,409 INFO L82 PathProgramCache]: Analyzing trace with hash 906430885, now seen corresponding path program 1 times [2018-01-21 03:02:05,410 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:02:05,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:02:05,411 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:02:05,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:02:05,411 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:02:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:02:05,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:02:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-21 03:02:05,492 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 03:02:05,492 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 03:02:05,493 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 81 with the following transitions: [2018-01-21 03:02:05,494 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [12], [13], [18], [20], [21], [22], [23], [24], [25], [30], [32], [33], [34], [38], [41], [42], [43], [47], [52], [53], [54], [57], [74], [78], [80], [85], [86], [87], [90], [108], [112], [114], [117], [118], [119], [125], [231], [234], [235], [236], [240], [245], [246], [247], [250], [267], [271], [273], [278], [279], [280], [283], [303], [307], [309], [310], [311], [312], [313], [317], [321], [331], [332], [336], [338], [339], [340], [346], [347], [348] [2018-01-21 03:02:05,554 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 03:02:05,554 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