java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label59_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 03:30:40,497 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 03:30:40,499 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 03:30:40,513 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 03:30:40,513 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 03:30:40,515 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 03:30:40,516 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 03:30:40,518 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 03:30:40,520 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 03:30:40,520 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 03:30:40,521 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 03:30:40,522 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 03:30:40,523 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 03:30:40,524 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 03:30:40,525 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 03:30:40,525 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 03:30:40,529 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 03:30:40,534 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 03:30:40,536 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 03:30:40,541 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 03:30:40,542 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 03:30:40,547 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 03:30:40,554 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 03:30:40,554 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 03:30:40,554 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 03:30:40,555 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 03:30:40,557 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 03:30:40,561 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 03:30:40,562 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 03:30:40,565 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 03:30:40,565 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 03:30:40,566 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 03:30:40,567 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 03:30:40,567 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 03:30:40,568 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 03:30:40,569 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 03:30:40,570 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 03:30:40,586 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 03:30:40,587 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 03:30:40,588 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 03:30:40,588 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 03:30:40,588 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 03:30:40,588 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 03:30:40,589 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 03:30:40,589 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 03:30:40,589 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 03:30:40,590 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 03:30:40,590 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 03:30:40,590 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 03:30:40,592 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 03:30:40,592 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 03:30:40,592 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 03:30:40,593 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 03:30:40,594 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 03:30:40,595 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 03:30:40,595 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 03:30:40,595 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 03:30:40,595 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 03:30:40,596 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 03:30:40,596 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 03:30:40,596 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 03:30:40,596 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 03:30:40,596 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 03:30:40,597 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 03:30:40,597 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 03:30:40,597 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 03:30:40,597 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 03:30:40,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 03:30:40,598 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 03:30:40,598 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 03:30:40,598 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 03:30:40,660 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 03:30:40,673 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 03:30:40,677 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 03:30:40,679 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 03:30:40,679 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 03:30:40,680 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label59_true-unreach-call_false-termination.c [2018-11-07 03:30:40,741 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42c48d8c3/21d8df684413456bb82b2c358b32fb49/FLAGcddc96d89 [2018-11-07 03:30:41,352 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 03:30:41,353 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label59_true-unreach-call_false-termination.c [2018-11-07 03:30:41,370 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42c48d8c3/21d8df684413456bb82b2c358b32fb49/FLAGcddc96d89 [2018-11-07 03:30:41,390 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42c48d8c3/21d8df684413456bb82b2c358b32fb49 [2018-11-07 03:30:41,403 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 03:30:41,405 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 03:30:41,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 03:30:41,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 03:30:41,410 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 03:30:41,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:30:41" (1/1) ... [2018-11-07 03:30:41,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ec1c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:30:41, skipping insertion in model container [2018-11-07 03:30:41,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:30:41" (1/1) ... [2018-11-07 03:30:41,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 03:30:41,514 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 03:30:41,993 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 03:30:42,002 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 03:30:42,177 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 03:30:42,195 INFO L193 MainTranslator]: Completed translation [2018-11-07 03:30:42,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:30:42 WrapperNode [2018-11-07 03:30:42,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 03:30:42,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 03:30:42,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 03:30:42,198 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 03:30:42,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:30:42" (1/1) ... [2018-11-07 03:30:42,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:30:42" (1/1) ... [2018-11-07 03:30:42,366 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 03:30:42,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 03:30:42,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 03:30:42,367 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 03:30:42,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:30:42" (1/1) ... [2018-11-07 03:30:42,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:30:42" (1/1) ... [2018-11-07 03:30:42,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:30:42" (1/1) ... [2018-11-07 03:30:42,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:30:42" (1/1) ... [2018-11-07 03:30:42,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:30:42" (1/1) ... [2018-11-07 03:30:42,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:30:42" (1/1) ... [2018-11-07 03:30:42,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:30:42" (1/1) ... [2018-11-07 03:30:42,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 03:30:42,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 03:30:42,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 03:30:42,470 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 03:30:42,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:30:42" (1/1) ... No working directory specified, using /storage/repos/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-11-07 03:30:42,548 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 03:30:42,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 03:30:42,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 03:30:42,549 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 03:30:42,549 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 03:30:42,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 03:30:42,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 03:30:42,550 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 03:30:42,550 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 03:30:46,343 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 03:30:46,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:30:46 BoogieIcfgContainer [2018-11-07 03:30:46,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 03:30:46,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 03:30:46,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 03:30:46,349 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 03:30:46,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:30:41" (1/3) ... [2018-11-07 03:30:46,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352c635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:30:46, skipping insertion in model container [2018-11-07 03:30:46,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:30:42" (2/3) ... [2018-11-07 03:30:46,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352c635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:30:46, skipping insertion in model container [2018-11-07 03:30:46,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:30:46" (3/3) ... [2018-11-07 03:30:46,355 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label59_true-unreach-call_false-termination.c [2018-11-07 03:30:46,364 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 03:30:46,374 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 03:30:46,392 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 03:30:46,430 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 03:30:46,430 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 03:30:46,431 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 03:30:46,431 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 03:30:46,431 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 03:30:46,431 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 03:30:46,431 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 03:30:46,431 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 03:30:46,458 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-07 03:30:46,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 03:30:46,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:30:46,472 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 03:30:46,475 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:30:46,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:30:46,481 INFO L82 PathProgramCache]: Analyzing trace with hash 403888209, now seen corresponding path program 1 times [2018-11-07 03:30:46,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:30:46,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:30:46,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:30:46,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:30:46,539 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:30:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:30:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:30:46,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:30:46,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 03:30:46,884 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:30:46,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 03:30:46,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 03:30:46,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 03:30:46,908 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-07 03:30:49,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:30:49,011 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-07 03:30:49,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 03:30:49,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-11-07 03:30:49,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:30:49,033 INFO L225 Difference]: With dead ends: 691 [2018-11-07 03:30:49,034 INFO L226 Difference]: Without dead ends: 434 [2018-11-07 03:30:49,043 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 03:30:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-07 03:30:49,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-07 03:30:49,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-07 03:30:49,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 772 transitions. [2018-11-07 03:30:49,132 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 772 transitions. Word has length 47 [2018-11-07 03:30:49,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:30:49,133 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 772 transitions. [2018-11-07 03:30:49,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 03:30:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 772 transitions. [2018-11-07 03:30:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-07 03:30:49,140 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:30:49,140 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 03:30:49,141 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:30:49,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:30:49,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1310565324, now seen corresponding path program 1 times [2018-11-07 03:30:49,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:30:49,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:30:49,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:30:49,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:30:49,143 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:30:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:30:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:30:49,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:30:49,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 03:30:49,514 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:30:49,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 03:30:49,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 03:30:49,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 03:30:49,517 INFO L87 Difference]: Start difference. First operand 434 states and 772 transitions. Second operand 6 states. [2018-11-07 03:30:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:30:52,935 INFO L93 Difference]: Finished difference Result 1234 states and 2250 transitions. [2018-11-07 03:30:52,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 03:30:52,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2018-11-07 03:30:52,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:30:52,947 INFO L225 Difference]: With dead ends: 1234 [2018-11-07 03:30:52,947 INFO L226 Difference]: Without dead ends: 806 [2018-11-07 03:30:52,954 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 03:30:52,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-11-07 03:30:53,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 797. [2018-11-07 03:30:53,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-11-07 03:30:53,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1300 transitions. [2018-11-07 03:30:53,007 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1300 transitions. Word has length 117 [2018-11-07 03:30:53,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:30:53,008 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 1300 transitions. [2018-11-07 03:30:53,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 03:30:53,008 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1300 transitions. [2018-11-07 03:30:53,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-07 03:30:53,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:30:53,013 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 03:30:53,013 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:30:53,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:30:53,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1516534009, now seen corresponding path program 1 times [2018-11-07 03:30:53,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:30:53,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:30:53,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:30:53,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:30:53,016 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:30:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:30:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:30:53,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:30:53,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 03:30:53,278 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:30:53,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 03:30:53,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 03:30:53,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 03:30:53,280 INFO L87 Difference]: Start difference. First operand 797 states and 1300 transitions. Second operand 5 states. [2018-11-07 03:30:55,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:30:55,904 INFO L93 Difference]: Finished difference Result 2186 states and 3741 transitions. [2018-11-07 03:30:55,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 03:30:55,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2018-11-07 03:30:55,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:30:55,917 INFO L225 Difference]: With dead ends: 2186 [2018-11-07 03:30:55,918 INFO L226 Difference]: Without dead ends: 1395 [2018-11-07 03:30:55,921 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 03:30:55,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2018-11-07 03:30:55,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1369. [2018-11-07 03:30:55,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2018-11-07 03:30:55,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2191 transitions. [2018-11-07 03:30:55,990 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2191 transitions. Word has length 118 [2018-11-07 03:30:55,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:30:55,991 INFO L480 AbstractCegarLoop]: Abstraction has 1369 states and 2191 transitions. [2018-11-07 03:30:55,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 03:30:55,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2191 transitions. [2018-11-07 03:30:55,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-07 03:30:55,994 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:30:55,994 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 03:30:55,995 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:30:55,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:30:55,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1750095403, now seen corresponding path program 1 times [2018-11-07 03:30:55,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:30:55,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:30:55,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:30:55,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:30:55,997 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:30:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:30:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:30:56,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:30:56,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 03:30:56,215 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:30:56,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 03:30:56,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 03:30:56,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 03:30:56,217 INFO L87 Difference]: Start difference. First operand 1369 states and 2191 transitions. Second operand 5 states. [2018-11-07 03:31:00,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:31:00,230 INFO L93 Difference]: Finished difference Result 3697 states and 5933 transitions. [2018-11-07 03:31:00,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 03:31:00,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2018-11-07 03:31:00,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:31:00,247 INFO L225 Difference]: With dead ends: 3697 [2018-11-07 03:31:00,247 INFO L226 Difference]: Without dead ends: 2334 [2018-11-07 03:31:00,258 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 03:31:00,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2018-11-07 03:31:00,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 2254. [2018-11-07 03:31:00,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2254 states. [2018-11-07 03:31:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3323 transitions. [2018-11-07 03:31:00,353 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3323 transitions. Word has length 120 [2018-11-07 03:31:00,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:31:00,354 INFO L480 AbstractCegarLoop]: Abstraction has 2254 states and 3323 transitions. [2018-11-07 03:31:00,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 03:31:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3323 transitions. [2018-11-07 03:31:00,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-07 03:31:00,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:31:00,359 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 03:31:00,359 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:31:00,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:31:00,361 INFO L82 PathProgramCache]: Analyzing trace with hash 289947284, now seen corresponding path program 1 times [2018-11-07 03:31:00,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:31:00,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:31:00,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:31:00,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:31:00,363 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:31:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:31:00,607 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:31:00,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:31:00,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 03:31:00,607 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:31:00,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 03:31:00,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 03:31:00,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 03:31:00,608 INFO L87 Difference]: Start difference. First operand 2254 states and 3323 transitions. Second operand 5 states. [2018-11-07 03:31:03,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:31:03,465 INFO L93 Difference]: Finished difference Result 6104 states and 9334 transitions. [2018-11-07 03:31:03,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 03:31:03,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-11-07 03:31:03,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:31:03,481 INFO L225 Difference]: With dead ends: 6104 [2018-11-07 03:31:03,481 INFO L226 Difference]: Without dead ends: 2950 [2018-11-07 03:31:03,503 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 03:31:03,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2018-11-07 03:31:03,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2927. [2018-11-07 03:31:03,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2927 states. [2018-11-07 03:31:03,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 3799 transitions. [2018-11-07 03:31:03,604 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 3799 transitions. Word has length 121 [2018-11-07 03:31:03,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:31:03,605 INFO L480 AbstractCegarLoop]: Abstraction has 2927 states and 3799 transitions. [2018-11-07 03:31:03,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 03:31:03,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 3799 transitions. [2018-11-07 03:31:03,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-07 03:31:03,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:31:03,614 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 03:31:03,614 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:31:03,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:31:03,615 INFO L82 PathProgramCache]: Analyzing trace with hash 2133746483, now seen corresponding path program 1 times [2018-11-07 03:31:03,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:31:03,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:31:03,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:31:03,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:31:03,616 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:31:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:31:03,862 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:31:03,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 03:31:03,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 03:31:03,862 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:31:03,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 03:31:03,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 03:31:03,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 03:31:03,864 INFO L87 Difference]: Start difference. First operand 2927 states and 3799 transitions. Second operand 4 states. [2018-11-07 03:31:05,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:31:05,371 INFO L93 Difference]: Finished difference Result 5839 states and 7641 transitions. [2018-11-07 03:31:05,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 03:31:05,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2018-11-07 03:31:05,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:31:05,389 INFO L225 Difference]: With dead ends: 5839 [2018-11-07 03:31:05,389 INFO L226 Difference]: Without dead ends: 3110 [2018-11-07 03:31:05,402 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 03:31:05,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2018-11-07 03:31:05,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 3110. [2018-11-07 03:31:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3110 states. [2018-11-07 03:31:05,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 3994 transitions. [2018-11-07 03:31:05,481 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 3994 transitions. Word has length 220 [2018-11-07 03:31:05,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:31:05,482 INFO L480 AbstractCegarLoop]: Abstraction has 3110 states and 3994 transitions. [2018-11-07 03:31:05,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 03:31:05,482 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 3994 transitions. [2018-11-07 03:31:05,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-11-07 03:31:05,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:31:05,492 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 03:31:05,493 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:31:05,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:31:05,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1526294730, now seen corresponding path program 1 times [2018-11-07 03:31:05,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:31:05,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:31:05,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:31:05,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:31:05,495 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:31:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:31:06,052 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-11-07 03:31:06,351 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-11-07 03:31:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 180 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 03:31:07,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 03:31:07,047 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 03:31:07,048 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 263 with the following transitions: [2018-11-07 03:31:07,050 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [277], [279], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [622], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 03:31:07,126 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 03:31:07,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 03:31:09,277 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 03:31:13,848 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 03:31:13,851 INFO L272 AbstractInterpreter]: Visited 118 different actions 118 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 03:31:13,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:31:13,891 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 03:31:16,870 INFO L227 lantSequenceWeakener]: Weakened 254 states. On average, predicates are now at 77.87% of their original sizes. [2018-11-07 03:31:16,870 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 03:31:17,312 INFO L415 sIntCurrentIteration]: We unified 261 AI predicates to 261 [2018-11-07 03:31:17,312 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 03:31:17,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 03:31:17,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2018-11-07 03:31:17,314 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:31:17,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 03:31:17,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 03:31:17,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 03:31:17,315 INFO L87 Difference]: Start difference. First operand 3110 states and 3994 transitions. Second operand 7 states. [2018-11-07 03:31:29,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:31:29,041 INFO L93 Difference]: Finished difference Result 6399 states and 8193 transitions. [2018-11-07 03:31:29,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 03:31:29,042 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 262 [2018-11-07 03:31:29,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:31:29,056 INFO L225 Difference]: With dead ends: 6399 [2018-11-07 03:31:29,056 INFO L226 Difference]: Without dead ends: 3295 [2018-11-07 03:31:29,068 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 262 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-07 03:31:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2018-11-07 03:31:29,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 3293. [2018-11-07 03:31:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3293 states. [2018-11-07 03:31:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 4179 transitions. [2018-11-07 03:31:29,153 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 4179 transitions. Word has length 262 [2018-11-07 03:31:29,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:31:29,153 INFO L480 AbstractCegarLoop]: Abstraction has 3293 states and 4179 transitions. [2018-11-07 03:31:29,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 03:31:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 4179 transitions. [2018-11-07 03:31:29,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-11-07 03:31:29,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:31:29,168 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 03:31:29,168 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:31:29,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:31:29,169 INFO L82 PathProgramCache]: Analyzing trace with hash 457179888, now seen corresponding path program 1 times [2018-11-07 03:31:29,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:31:29,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:31:29,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:31:29,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:31:29,170 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:31:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:31:29,658 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 03:31:29,841 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 03:31:30,036 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 03:31:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 133 proven. 297 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 03:31:30,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 03:31:30,693 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 03:31:30,693 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 374 with the following transitions: [2018-11-07 03:31:30,694 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [277], [279], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [622], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 03:31:30,708 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 03:31:30,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 03:31:32,719 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 03:31:39,715 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 03:31:39,715 INFO L272 AbstractInterpreter]: Visited 122 different actions 238 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 03:31:39,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:31:39,723 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 03:31:41,971 INFO L227 lantSequenceWeakener]: Weakened 149 states. On average, predicates are now at 78.64% of their original sizes. [2018-11-07 03:31:41,971 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 03:31:49,802 INFO L415 sIntCurrentIteration]: We unified 372 AI predicates to 372 [2018-11-07 03:31:49,802 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 03:31:49,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 03:31:49,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [15] total 34 [2018-11-07 03:31:49,803 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 03:31:49,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 03:31:49,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 03:31:49,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-11-07 03:31:49,805 INFO L87 Difference]: Start difference. First operand 3293 states and 4179 transitions. Second operand 21 states. [2018-11-07 03:34:03,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 03:34:03,955 INFO L93 Difference]: Finished difference Result 6582 states and 8382 transitions. [2018-11-07 03:34:03,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 03:34:03,956 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 373 [2018-11-07 03:34:03,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 03:34:03,970 INFO L225 Difference]: With dead ends: 6582 [2018-11-07 03:34:03,971 INFO L226 Difference]: Without dead ends: 3478 [2018-11-07 03:34:03,982 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 389 GetRequests, 351 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=262, Invalid=1144, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 03:34:03,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3478 states. [2018-11-07 03:34:04,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3478 to 3473. [2018-11-07 03:34:04,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3473 states. [2018-11-07 03:34:04,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 4343 transitions. [2018-11-07 03:34:04,149 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 4343 transitions. Word has length 373 [2018-11-07 03:34:04,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 03:34:04,150 INFO L480 AbstractCegarLoop]: Abstraction has 3473 states and 4343 transitions. [2018-11-07 03:34:04,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 03:34:04,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 4343 transitions. [2018-11-07 03:34:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-11-07 03:34:04,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 03:34:04,168 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 03:34:04,168 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 03:34:04,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 03:34:04,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1800604101, now seen corresponding path program 1 times [2018-11-07 03:34:04,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 03:34:04,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:34:04,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 03:34:04,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 03:34:04,170 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 03:34:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 03:34:04,533 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-07 03:34:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 148 proven. 84 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2018-11-07 03:34:04,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 03:34:04,931 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 03:34:04,931 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 484 with the following transitions: [2018-11-07 03:34:04,932 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [277], [279], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [622], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 03:34:04,937 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 03:34:04,938 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 03:34:07,014 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown