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-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label29_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 17:44:01,589 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 17:44:01,593 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 17:44:01,612 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 17:44:01,612 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 17:44:01,614 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 17:44:01,615 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 17:44:01,618 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 17:44:01,620 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 17:44:01,621 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 17:44:01,630 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 17:44:01,631 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 17:44:01,632 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 17:44:01,635 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 17:44:01,636 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 17:44:01,637 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 17:44:01,638 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 17:44:01,639 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 17:44:01,641 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 17:44:01,643 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 17:44:01,644 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 17:44:01,645 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 17:44:01,647 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 17:44:01,647 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 17:44:01,648 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 17:44:01,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 17:44:01,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 17:44:01,650 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 17:44:01,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 17:44:01,652 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 17:44:01,652 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 17:44:01,653 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 17:44:01,653 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 17:44:01,653 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 17:44:01,654 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 17:44:01,655 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 17:44:01,655 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 17:44:01,671 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 17:44:01,672 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 17:44:01,672 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 17:44:01,673 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 17:44:01,673 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 17:44:01,673 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 17:44:01,673 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 17:44:01,673 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 17:44:01,677 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 17:44:01,677 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 17:44:01,677 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 17:44:01,677 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 17:44:01,678 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 17:44:01,678 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 17:44:01,680 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 17:44:01,680 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 17:44:01,680 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 17:44:01,680 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 17:44:01,680 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 17:44:01,681 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 17:44:01,681 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 17:44:01,681 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 17:44:01,681 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 17:44:01,681 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 17:44:01,683 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 17:44:01,683 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 17:44:01,683 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 17:44:01,683 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 17:44:01,684 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 17:44:01,684 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 17:44:01,684 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 17:44:01,685 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 17:44:01,685 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 17:44:01,685 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 17:44:01,685 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 17:44:01,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 17:44:01,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 17:44:01,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 17:44:01,754 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 17:44:01,755 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 17:44:01,756 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label29_false-unreach-call.c [2018-11-07 17:44:01,812 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a31e87bfd/300f2052f3aa4135a90b1fa8584f8667/FLAG2c5430226 [2018-11-07 17:44:02,392 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 17:44:02,393 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label29_false-unreach-call.c [2018-11-07 17:44:02,422 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a31e87bfd/300f2052f3aa4135a90b1fa8584f8667/FLAG2c5430226 [2018-11-07 17:44:02,442 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a31e87bfd/300f2052f3aa4135a90b1fa8584f8667 [2018-11-07 17:44:02,453 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 17:44:02,457 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 17:44:02,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 17:44:02,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 17:44:02,464 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 17:44:02,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:44:02" (1/1) ... [2018-11-07 17:44:02,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a715eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:02, skipping insertion in model container [2018-11-07 17:44:02,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:44:02" (1/1) ... [2018-11-07 17:44:02,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 17:44:02,568 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 17:44:03,218 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 17:44:03,226 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 17:44:03,453 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 17:44:03,475 INFO L193 MainTranslator]: Completed translation [2018-11-07 17:44:03,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:03 WrapperNode [2018-11-07 17:44:03,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 17:44:03,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 17:44:03,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 17:44:03,477 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 17:44:03,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:03" (1/1) ... [2018-11-07 17:44:03,658 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:03" (1/1) ... [2018-11-07 17:44:03,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 17:44:03,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 17:44:03,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 17:44:03,675 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 17:44:03,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:03" (1/1) ... [2018-11-07 17:44:03,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:03" (1/1) ... [2018-11-07 17:44:03,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:03" (1/1) ... [2018-11-07 17:44:03,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:03" (1/1) ... [2018-11-07 17:44:03,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:03" (1/1) ... [2018-11-07 17:44:03,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:03" (1/1) ... [2018-11-07 17:44:03,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:03" (1/1) ... [2018-11-07 17:44:03,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 17:44:03,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 17:44:03,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 17:44:03,811 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 17:44:03,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:03" (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 17:44:03,879 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 17:44:03,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 17:44:03,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 17:44:03,880 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 17:44:03,880 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 17:44:03,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 17:44:03,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 17:44:03,881 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 17:44:03,881 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 17:44:08,396 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 17:44:08,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:44:08 BoogieIcfgContainer [2018-11-07 17:44:08,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 17:44:08,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 17:44:08,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 17:44:08,402 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 17:44:08,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:44:02" (1/3) ... [2018-11-07 17:44:08,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cfbb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:44:08, skipping insertion in model container [2018-11-07 17:44:08,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:44:03" (2/3) ... [2018-11-07 17:44:08,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cfbb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:44:08, skipping insertion in model container [2018-11-07 17:44:08,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:44:08" (3/3) ... [2018-11-07 17:44:08,406 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label29_false-unreach-call.c [2018-11-07 17:44:08,416 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 17:44:08,425 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 17:44:08,445 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 17:44:08,484 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 17:44:08,485 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 17:44:08,485 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 17:44:08,485 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 17:44:08,485 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 17:44:08,486 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 17:44:08,486 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 17:44:08,486 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 17:44:08,520 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states. [2018-11-07 17:44:08,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 17:44:08,527 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:44:08,530 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] [2018-11-07 17:44:08,532 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:44:08,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:44:08,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1657837633, now seen corresponding path program 1 times [2018-11-07 17:44:08,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:44:08,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:44:08,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:44:08,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:44:08,596 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:44:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:44:08,962 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 17:44:09,068 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 17:44:09,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:44:09,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 17:44:09,071 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:44:09,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 17:44:09,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 17:44:09,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 17:44:09,097 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 3 states. [2018-11-07 17:44:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:44:11,245 INFO L93 Difference]: Finished difference Result 785 states and 1378 transitions. [2018-11-07 17:44:11,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 17:44:11,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-07 17:44:11,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:44:11,271 INFO L225 Difference]: With dead ends: 785 [2018-11-07 17:44:11,271 INFO L226 Difference]: Without dead ends: 490 [2018-11-07 17:44:11,280 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 17:44:11,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-11-07 17:44:11,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 482. [2018-11-07 17:44:11,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-11-07 17:44:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 841 transitions. [2018-11-07 17:44:11,370 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 841 transitions. Word has length 27 [2018-11-07 17:44:11,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:44:11,371 INFO L480 AbstractCegarLoop]: Abstraction has 482 states and 841 transitions. [2018-11-07 17:44:11,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 17:44:11,371 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 841 transitions. [2018-11-07 17:44:11,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-07 17:44:11,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:44:11,377 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 17:44:11,377 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:44:11,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:44:11,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1966736396, now seen corresponding path program 1 times [2018-11-07 17:44:11,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:44:11,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:44:11,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:44:11,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:44:11,380 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:44:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:44:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:44:11,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:44:11,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 17:44:11,815 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:44:11,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 17:44:11,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 17:44:11,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 17:44:11,818 INFO L87 Difference]: Start difference. First operand 482 states and 841 transitions. Second operand 6 states. [2018-11-07 17:44:16,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:44:16,787 INFO L93 Difference]: Finished difference Result 1761 states and 3209 transitions. [2018-11-07 17:44:16,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 17:44:16,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-11-07 17:44:16,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:44:16,801 INFO L225 Difference]: With dead ends: 1761 [2018-11-07 17:44:16,801 INFO L226 Difference]: Without dead ends: 1285 [2018-11-07 17:44:16,806 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-07 17:44:16,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2018-11-07 17:44:16,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1253. [2018-11-07 17:44:16,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1253 states. [2018-11-07 17:44:16,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1989 transitions. [2018-11-07 17:44:16,891 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1989 transitions. Word has length 97 [2018-11-07 17:44:16,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:44:16,892 INFO L480 AbstractCegarLoop]: Abstraction has 1253 states and 1989 transitions. [2018-11-07 17:44:16,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 17:44:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1989 transitions. [2018-11-07 17:44:16,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-07 17:44:16,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:44:16,896 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 17:44:16,896 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:44:16,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:44:16,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1683891539, now seen corresponding path program 1 times [2018-11-07 17:44:16,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:44:16,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:44:16,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:44:16,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:44:16,899 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:44:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:44:17,110 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:44:17,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:44:17,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 17:44:17,111 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:44:17,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 17:44:17,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 17:44:17,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 17:44:17,112 INFO L87 Difference]: Start difference. First operand 1253 states and 1989 transitions. Second operand 6 states. [2018-11-07 17:44:21,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:44:21,174 INFO L93 Difference]: Finished difference Result 3468 states and 5572 transitions. [2018-11-07 17:44:21,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 17:44:21,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-11-07 17:44:21,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:44:21,197 INFO L225 Difference]: With dead ends: 3468 [2018-11-07 17:44:21,197 INFO L226 Difference]: Without dead ends: 2221 [2018-11-07 17:44:21,206 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 17:44:21,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2018-11-07 17:44:21,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 2196. [2018-11-07 17:44:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2196 states. [2018-11-07 17:44:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 3228 transitions. [2018-11-07 17:44:21,288 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 3228 transitions. Word has length 100 [2018-11-07 17:44:21,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:44:21,288 INFO L480 AbstractCegarLoop]: Abstraction has 2196 states and 3228 transitions. [2018-11-07 17:44:21,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 17:44:21,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 3228 transitions. [2018-11-07 17:44:21,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-07 17:44:21,296 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:44:21,296 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 17:44:21,297 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:44:21,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:44:21,297 INFO L82 PathProgramCache]: Analyzing trace with hash 353905340, now seen corresponding path program 1 times [2018-11-07 17:44:21,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:44:21,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:44:21,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:44:21,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:44:21,301 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:44:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:44:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:44:21,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:44:21,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-07 17:44:21,861 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:44:21,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 17:44:21,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 17:44:21,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 17:44:21,862 INFO L87 Difference]: Start difference. First operand 2196 states and 3228 transitions. Second operand 7 states. [2018-11-07 17:44:26,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:44:26,011 INFO L93 Difference]: Finished difference Result 5912 states and 8935 transitions. [2018-11-07 17:44:26,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 17:44:26,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2018-11-07 17:44:26,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:44:26,041 INFO L225 Difference]: With dead ends: 5912 [2018-11-07 17:44:26,041 INFO L226 Difference]: Without dead ends: 3722 [2018-11-07 17:44:26,055 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-11-07 17:44:26,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-11-07 17:44:26,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3561. [2018-11-07 17:44:26,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3561 states. [2018-11-07 17:44:26,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3561 states to 3561 states and 4985 transitions. [2018-11-07 17:44:26,169 INFO L78 Accepts]: Start accepts. Automaton has 3561 states and 4985 transitions. Word has length 101 [2018-11-07 17:44:26,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:44:26,169 INFO L480 AbstractCegarLoop]: Abstraction has 3561 states and 4985 transitions. [2018-11-07 17:44:26,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 17:44:26,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 4985 transitions. [2018-11-07 17:44:26,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-07 17:44:26,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:44:26,174 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 17:44:26,174 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:44:26,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:44:26,175 INFO L82 PathProgramCache]: Analyzing trace with hash 400123299, now seen corresponding path program 1 times [2018-11-07 17:44:26,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:44:26,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:44:26,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:44:26,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:44:26,176 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:44:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:44:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:44:26,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:44:26,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 17:44:26,348 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:44:26,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 17:44:26,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 17:44:26,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 17:44:26,350 INFO L87 Difference]: Start difference. First operand 3561 states and 4985 transitions. Second operand 3 states. [2018-11-07 17:44:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:44:28,193 INFO L93 Difference]: Finished difference Result 8038 states and 11661 transitions. [2018-11-07 17:44:28,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 17:44:28,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-11-07 17:44:28,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:44:28,219 INFO L225 Difference]: With dead ends: 8038 [2018-11-07 17:44:28,220 INFO L226 Difference]: Without dead ends: 4483 [2018-11-07 17:44:28,232 INFO L604 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-11-07 17:44:28,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4483 states. [2018-11-07 17:44:28,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4483 to 4422. [2018-11-07 17:44:28,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4422 states. [2018-11-07 17:44:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 5858 transitions. [2018-11-07 17:44:28,336 INFO L78 Accepts]: Start accepts. Automaton has 4422 states and 5858 transitions. Word has length 159 [2018-11-07 17:44:28,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:44:28,337 INFO L480 AbstractCegarLoop]: Abstraction has 4422 states and 5858 transitions. [2018-11-07 17:44:28,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 17:44:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 4422 states and 5858 transitions. [2018-11-07 17:44:28,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-07 17:44:28,341 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:44:28,341 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 17:44:28,342 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:44:28,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:44:28,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1875107130, now seen corresponding path program 1 times [2018-11-07 17:44:28,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:44:28,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:44:28,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:44:28,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:44:28,344 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:44:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:44:28,782 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-07 17:44:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 17:44:28,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 17:44:28,819 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 17:44:28,820 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-07 17:44:28,823 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [777], [781], [785], [789], [793], [797], [808], [812], [816], [820], [824], [828], [832], [843], [847], [851], [862], [866], [869], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 17:44:28,917 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 17:44:28,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 17:44:29,667 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 17:44:31,201 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 17:44:31,206 INFO L272 AbstractInterpreter]: Visited 155 different actions 452 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-07 17:44:31,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:44:31,249 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 17:44:32,228 INFO L227 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 73.69% of their original sizes. [2018-11-07 17:44:32,228 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 17:44:33,863 INFO L415 sIntCurrentIteration]: We unified 174 AI predicates to 174 [2018-11-07 17:44:33,863 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 17:44:33,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 17:44:33,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [5] total 22 [2018-11-07 17:44:33,864 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:44:33,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 17:44:33,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 17:44:33,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-11-07 17:44:33,866 INFO L87 Difference]: Start difference. First operand 4422 states and 5858 transitions. Second operand 19 states. [2018-11-07 17:45:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:45:17,252 INFO L93 Difference]: Finished difference Result 9944 states and 13309 transitions. [2018-11-07 17:45:17,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 17:45:17,253 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 175 [2018-11-07 17:45:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:45:17,276 INFO L225 Difference]: With dead ends: 9944 [2018-11-07 17:45:17,276 INFO L226 Difference]: Without dead ends: 5528 [2018-11-07 17:45:17,296 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 202 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=374, Invalid=1606, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 17:45:17,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5528 states. [2018-11-07 17:45:17,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5528 to 5385. [2018-11-07 17:45:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5385 states. [2018-11-07 17:45:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5385 states to 5385 states and 6938 transitions. [2018-11-07 17:45:17,415 INFO L78 Accepts]: Start accepts. Automaton has 5385 states and 6938 transitions. Word has length 175 [2018-11-07 17:45:17,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:45:17,415 INFO L480 AbstractCegarLoop]: Abstraction has 5385 states and 6938 transitions. [2018-11-07 17:45:17,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 17:45:17,416 INFO L276 IsEmpty]: Start isEmpty. Operand 5385 states and 6938 transitions. [2018-11-07 17:45:17,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-07 17:45:17,420 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:45:17,420 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:45:17,421 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:45:17,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:45:17,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1839442868, now seen corresponding path program 1 times [2018-11-07 17:45:17,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:45:17,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:45:17,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:45:17,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:45:17,423 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:45:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:45:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 44 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:45:17,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 17:45:17,862 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 17:45:17,862 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 219 with the following transitions: [2018-11-07 17:45:17,863 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [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], [510], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [710], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 17:45:17,868 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 17:45:17,868 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 17:45:18,060 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 17:45:18,207 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 17:45:18,207 INFO L272 AbstractInterpreter]: Visited 125 different actions 244 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-07 17:45:18,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:45:18,211 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 17:45:18,832 INFO L227 lantSequenceWeakener]: Weakened 85 states. On average, predicates are now at 73.73% of their original sizes. [2018-11-07 17:45:18,833 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 17:45:19,911 INFO L415 sIntCurrentIteration]: We unified 217 AI predicates to 217 [2018-11-07 17:45:19,912 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 17:45:19,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 17:45:19,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [10] total 24 [2018-11-07 17:45:19,912 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:45:19,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 17:45:19,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 17:45:19,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-11-07 17:45:19,914 INFO L87 Difference]: Start difference. First operand 5385 states and 6938 transitions. Second operand 16 states. [2018-11-07 17:45:32,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:45:32,757 INFO L93 Difference]: Finished difference Result 10194 states and 13381 transitions. [2018-11-07 17:45:32,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 17:45:32,757 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 218 [2018-11-07 17:45:32,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:45:32,783 INFO L225 Difference]: With dead ends: 10194 [2018-11-07 17:45:32,783 INFO L226 Difference]: Without dead ends: 5778 [2018-11-07 17:45:32,803 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 224 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2018-11-07 17:45:32,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5778 states. [2018-11-07 17:45:32,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5778 to 5769. [2018-11-07 17:45:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5769 states. [2018-11-07 17:45:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 7374 transitions. [2018-11-07 17:45:32,963 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 7374 transitions. Word has length 218 [2018-11-07 17:45:32,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:45:32,964 INFO L480 AbstractCegarLoop]: Abstraction has 5769 states and 7374 transitions. [2018-11-07 17:45:32,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 17:45:32,964 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 7374 transitions. [2018-11-07 17:45:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-11-07 17:45:32,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:45:32,971 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:45:32,972 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:45:32,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:45:32,972 INFO L82 PathProgramCache]: Analyzing trace with hash -2077276056, now seen corresponding path program 1 times [2018-11-07 17:45:32,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:45:32,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:45:32,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:45:32,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:45:32,974 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:45:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:45:33,479 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 17:45:34,027 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-07 17:45:34,348 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-07 17:45:34,593 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 44 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:45:34,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 17:45:34,594 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 17:45:34,594 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 229 with the following transitions: [2018-11-07 17:45:34,595 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [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], [510], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 17:45:34,599 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 17:45:34,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 17:45:34,684 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 17:45:34,919 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 17:45:34,919 INFO L272 AbstractInterpreter]: Visited 135 different actions 392 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-07 17:45:34,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:45:34,925 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 17:45:35,168 INFO L227 lantSequenceWeakener]: Weakened 225 states. On average, predicates are now at 73.15% of their original sizes. [2018-11-07 17:45:35,168 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 17:45:35,301 INFO L415 sIntCurrentIteration]: We unified 227 AI predicates to 227 [2018-11-07 17:45:35,301 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 17:45:35,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 17:45:35,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2018-11-07 17:45:35,302 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:45:35,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 17:45:35,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 17:45:35,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 17:45:35,303 INFO L87 Difference]: Start difference. First operand 5769 states and 7374 transitions. Second operand 11 states. [2018-11-07 17:45:45,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:45:45,543 INFO L93 Difference]: Finished difference Result 11342 states and 14698 transitions. [2018-11-07 17:45:45,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 17:45:45,544 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 228 [2018-11-07 17:45:45,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:45:45,575 INFO L225 Difference]: With dead ends: 11342 [2018-11-07 17:45:45,576 INFO L226 Difference]: Without dead ends: 6351 [2018-11-07 17:45:45,594 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 237 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2018-11-07 17:45:45,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6351 states. [2018-11-07 17:45:45,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6351 to 6344. [2018-11-07 17:45:45,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6344 states. [2018-11-07 17:45:45,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6344 states to 6344 states and 8033 transitions. [2018-11-07 17:45:45,741 INFO L78 Accepts]: Start accepts. Automaton has 6344 states and 8033 transitions. Word has length 228 [2018-11-07 17:45:45,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:45:45,742 INFO L480 AbstractCegarLoop]: Abstraction has 6344 states and 8033 transitions. [2018-11-07 17:45:45,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 17:45:45,742 INFO L276 IsEmpty]: Start isEmpty. Operand 6344 states and 8033 transitions. [2018-11-07 17:45:45,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-07 17:45:45,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:45:45,748 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:45:45,748 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:45:45,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:45:45,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1309677592, now seen corresponding path program 1 times [2018-11-07 17:45:45,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:45:45,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:45:45,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:45:45,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:45:45,750 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:45:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:45:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-07 17:45:46,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 17:45:46,284 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 17:45:46,284 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 230 with the following transitions: [2018-11-07 17:45:46,284 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [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], [494], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 17:45:46,289 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 17:45:46,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 17:45:46,375 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 17:45:47,468 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 17:45:47,468 INFO L272 AbstractInterpreter]: Visited 141 different actions 553 times. Merged at 7 different actions 24 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 28 variables. [2018-11-07 17:45:47,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:45:47,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 17:45:47,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 17:45:47,477 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 17:45:47,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:45:47,495 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 17:45:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:45:47,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 17:45:52,381 WARN L179 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2018-11-07 17:45:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-07 17:45:52,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 17:45:53,109 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:45:53,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 17:45:53,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 11 [2018-11-07 17:45:53,142 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 17:45:53,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 17:45:53,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 17:45:53,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=74, Unknown=2, NotChecked=0, Total=110 [2018-11-07 17:45:53,144 INFO L87 Difference]: Start difference. First operand 6344 states and 8033 transitions. Second operand 9 states. [2018-11-07 17:46:03,130 WARN L179 SmtUtils]: Spent 3.56 s on a formula simplification. DAG size of input: 27 DAG size of output: 13 [2018-11-07 17:46:19,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:46:19,946 INFO L93 Difference]: Finished difference Result 17861 states and 24715 transitions. [2018-11-07 17:46:19,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 17:46:19,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 229 [2018-11-07 17:46:19,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:46:19,995 INFO L225 Difference]: With dead ends: 17861 [2018-11-07 17:46:19,995 INFO L226 Difference]: Without dead ends: 12102 [2018-11-07 17:46:20,030 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 454 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=171, Invalid=427, Unknown=2, NotChecked=0, Total=600 [2018-11-07 17:46:20,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12102 states. [2018-11-07 17:46:20,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12102 to 11971. [2018-11-07 17:46:20,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11971 states. [2018-11-07 17:46:20,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11971 states to 11971 states and 15828 transitions. [2018-11-07 17:46:20,370 INFO L78 Accepts]: Start accepts. Automaton has 11971 states and 15828 transitions. Word has length 229 [2018-11-07 17:46:20,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:46:20,371 INFO L480 AbstractCegarLoop]: Abstraction has 11971 states and 15828 transitions. [2018-11-07 17:46:20,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 17:46:20,371 INFO L276 IsEmpty]: Start isEmpty. Operand 11971 states and 15828 transitions. [2018-11-07 17:46:20,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-07 17:46:20,378 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:46:20,379 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:46:20,379 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:46:20,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:46:20,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1343253280, now seen corresponding path program 1 times [2018-11-07 17:46:20,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:46:20,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:46:20,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:46:20,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:46:20,381 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:46:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:46:21,335 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 17:46:21,652 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-07 17:46:21,987 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-07 17:46:22,079 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 47 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 17:46:22,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 17:46:22,080 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 17:46:22,080 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 234 with the following transitions: [2018-11-07 17:46:22,081 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [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], [510], [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], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [762], [766], [769], [772], [776], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 17:46:22,085 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 17:46:22,085 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 17:46:22,260 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 17:46:23,095 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 17:46:23,095 INFO L272 AbstractInterpreter]: Visited 140 different actions 407 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-11-07 17:46:23,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:46:23,121 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 17:46:23,597 INFO L227 lantSequenceWeakener]: Weakened 230 states. On average, predicates are now at 73.2% of their original sizes. [2018-11-07 17:46:23,598 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 17:46:24,439 INFO L415 sIntCurrentIteration]: We unified 232 AI predicates to 232 [2018-11-07 17:46:24,439 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 17:46:24,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 17:46:24,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [11] total 22 [2018-11-07 17:46:24,440 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:46:24,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 17:46:24,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 17:46:24,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-07 17:46:24,442 INFO L87 Difference]: Start difference. First operand 11971 states and 15828 transitions. Second operand 13 states. [2018-11-07 17:46:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:46:43,847 INFO L93 Difference]: Finished difference Result 21517 states and 29029 transitions. [2018-11-07 17:46:43,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 17:46:43,847 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 233 [2018-11-07 17:46:43,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:46:43,889 INFO L225 Difference]: With dead ends: 21517 [2018-11-07 17:46:43,889 INFO L226 Difference]: Without dead ends: 12175 [2018-11-07 17:46:43,911 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 242 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2018-11-07 17:46:43,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12175 states. [2018-11-07 17:46:44,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12175 to 12171. [2018-11-07 17:46:44,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12171 states. [2018-11-07 17:46:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12171 states to 12171 states and 16038 transitions. [2018-11-07 17:46:44,178 INFO L78 Accepts]: Start accepts. Automaton has 12171 states and 16038 transitions. Word has length 233 [2018-11-07 17:46:44,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:46:44,179 INFO L480 AbstractCegarLoop]: Abstraction has 12171 states and 16038 transitions. [2018-11-07 17:46:44,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 17:46:44,179 INFO L276 IsEmpty]: Start isEmpty. Operand 12171 states and 16038 transitions. [2018-11-07 17:46:44,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-07 17:46:44,188 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:46:44,188 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-07 17:46:44,188 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:46:44,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:46:44,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1101765452, now seen corresponding path program 1 times [2018-11-07 17:46:44,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:46:44,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:46:44,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:46:44,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:46:44,190 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:46:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:46:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-07 17:46:44,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 17:46:44,663 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 17:46:44,663 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 251 with the following transitions: [2018-11-07 17:46:44,664 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [117], [119], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [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], [598], [599], [603], [607], [611], [615], [626], [630], [634], [638], [642], [646], [650], [654], [658], [662], [666], [677], [688], [692], [696], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [750], [1084], [1088], [1092], [1098], [1102], [1104], [1109], [1110], [1111], [1113], [1114] [2018-11-07 17:46:44,668 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 17:46:44,668 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 17:46:44,789 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 17:46:45,697 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 17:46:45,698 INFO L272 AbstractInterpreter]: Visited 135 different actions 664 times. Merged at 7 different actions 33 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 28 variables. [2018-11-07 17:46:45,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:46:45,738 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 17:46:46,326 INFO L227 lantSequenceWeakener]: Weakened 57 states. On average, predicates are now at 74.26% of their original sizes. [2018-11-07 17:46:46,326 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 17:46:48,391 INFO L415 sIntCurrentIteration]: We unified 249 AI predicates to 249 [2018-11-07 17:46:48,391 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 17:46:48,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 17:46:48,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [5] total 25 [2018-11-07 17:46:48,392 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:46:48,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 17:46:48,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 17:46:48,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-11-07 17:46:48,394 INFO L87 Difference]: Start difference. First operand 12171 states and 16038 transitions. Second operand 22 states. [2018-11-07 17:47:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 17:47:31,708 INFO L93 Difference]: Finished difference Result 23944 states and 32729 transitions. [2018-11-07 17:47:31,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-07 17:47:31,708 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 250 [2018-11-07 17:47:31,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 17:47:31,761 INFO L225 Difference]: With dead ends: 23944 [2018-11-07 17:47:31,761 INFO L226 Difference]: Without dead ends: 14602 [2018-11-07 17:47:31,788 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 270 GetRequests, 222 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=334, Invalid=1472, Unknown=0, NotChecked=0, Total=1806 [2018-11-07 17:47:31,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2018-11-07 17:47:32,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14178. [2018-11-07 17:47:32,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14178 states. [2018-11-07 17:47:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14178 states to 14178 states and 18628 transitions. [2018-11-07 17:47:32,072 INFO L78 Accepts]: Start accepts. Automaton has 14178 states and 18628 transitions. Word has length 250 [2018-11-07 17:47:32,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 17:47:32,073 INFO L480 AbstractCegarLoop]: Abstraction has 14178 states and 18628 transitions. [2018-11-07 17:47:32,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 17:47:32,073 INFO L276 IsEmpty]: Start isEmpty. Operand 14178 states and 18628 transitions. [2018-11-07 17:47:32,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-11-07 17:47:32,084 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 17:47:32,084 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:47:32,084 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 17:47:32,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 17:47:32,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2078054716, now seen corresponding path program 1 times [2018-11-07 17:47:32,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 17:47:32,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:47:32,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 17:47:32,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 17:47:32,086 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 17:47:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 17:47:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-07 17:47:32,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 17:47:32,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 17:47:32,488 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 17:47:32,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 17:47:32,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 17:47:32,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 17:47:32,489 INFO L87 Difference]: Start difference. First operand 14178 states and 18628 transitions. Second operand 4 states. Received shutdown request... [2018-11-07 17:47:32,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 17:47:32,569 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 17:47:32,575 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 17:47:32,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:47:32 BoogieIcfgContainer [2018-11-07 17:47:32,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 17:47:32,577 INFO L168 Benchmark]: Toolchain (without parser) took 210122.92 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -604.1 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2018-11-07 17:47:32,578 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 17:47:32,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1018.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-11-07 17:47:32,580 INFO L168 Benchmark]: Boogie Procedure Inliner took 197.70 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -840.4 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. [2018-11-07 17:47:32,581 INFO L168 Benchmark]: Boogie Preprocessor took 135.56 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 17:47:32,581 INFO L168 Benchmark]: RCFGBuilder took 4586.94 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 192.7 MB). Peak memory consumption was 192.7 MB. Max. memory is 7.1 GB. [2018-11-07 17:47:32,583 INFO L168 Benchmark]: TraceAbstraction took 204177.55 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 2.0 GB). Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: -19.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-11-07 17:47:32,588 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1018.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 197.70 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -840.4 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.56 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 4586.94 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 192.7 MB). Peak memory consumption was 192.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 204177.55 ms. Allocated memory was 2.3 GB in the beginning and 4.3 GB in the end (delta: 2.0 GB). Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: -19.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 66). Cancelled while BasicCegarLoop was constructing difference of abstraction (14178states) and FLOYD_HOARE automaton (currently 3 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (12 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 293 locations, 1 error locations. TIMEOUT Result, 204.1s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 173.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2292 SDtfs, 15893 SDslu, 3075 SDs, 0 SdLazy, 24583 SolverSat, 3683 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 81.0s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 1704 GetRequests, 1490 SyntacticMatches, 17 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1342 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14178occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.4s AbstIntTime, 6 AbstIntIterations, 5 AbstIntStrong, 0.9973601875831175 AbsIntWeakeningRatio, 0.12283894449499545 AbsIntAvgWeakeningVarsNumRemoved, 17.3221110100091 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 1005 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 2318 NumberOfCodeBlocks, 2318 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2533 ConstructedInterpolants, 3 QuantifiedInterpolants, 2227279 SizeOfPredicates, 1 NumberOfNonLiveVariables, 442 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 760/1021 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown