java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8c3fbe1 [2018-10-22 16:10:35,920 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-22 16:10:35,922 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-22 16:10:35,934 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-22 16:10:35,934 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-22 16:10:35,935 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-22 16:10:35,936 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-22 16:10:35,938 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-22 16:10:35,940 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-22 16:10:35,941 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-22 16:10:35,942 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-22 16:10:35,942 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-22 16:10:35,943 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-22 16:10:35,944 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-22 16:10:35,945 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-22 16:10:35,946 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-22 16:10:35,947 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-22 16:10:35,948 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-22 16:10:35,950 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-22 16:10:35,952 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-22 16:10:35,953 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-22 16:10:35,954 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-22 16:10:35,956 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-22 16:10:35,957 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-22 16:10:35,957 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-22 16:10:35,958 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-22 16:10:35,959 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-22 16:10:35,960 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-22 16:10:35,961 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-22 16:10:35,962 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-22 16:10:35,962 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-22 16:10:35,963 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-22 16:10:35,963 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-22 16:10:35,963 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-22 16:10:35,964 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-22 16:10:35,965 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-22 16:10:35,965 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-22 16:10:35,980 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-22 16:10:35,981 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-22 16:10:35,981 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-22 16:10:35,982 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-22 16:10:35,982 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-22 16:10:35,982 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-22 16:10:35,982 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-22 16:10:35,982 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-22 16:10:35,983 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-22 16:10:35,983 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-22 16:10:35,983 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-22 16:10:35,983 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-22 16:10:35,984 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-22 16:10:35,984 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-22 16:10:35,984 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-22 16:10:35,985 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-22 16:10:35,985 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-22 16:10:35,985 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-22 16:10:35,985 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-22 16:10:35,985 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-22 16:10:35,986 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-22 16:10:35,986 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-22 16:10:35,986 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-22 16:10:35,986 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-22 16:10:35,986 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 16:10:35,987 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-22 16:10:35,987 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-22 16:10:35,987 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-22 16:10:35,987 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-22 16:10:35,987 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-22 16:10:35,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-22 16:10:35,988 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-22 16:10:35,988 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-22 16:10:35,988 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-22 16:10:36,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-22 16:10:36,044 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-22 16:10:36,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-22 16:10:36,049 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-22 16:10:36,050 INFO L276 PluginConnector]: CDTParser initialized [2018-10-22 16:10:36,050 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c [2018-10-22 16:10:36,112 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/029979431/41025378977e40c7b077c396e93f5501/FLAGf06755276 [2018-10-22 16:10:36,626 INFO L298 CDTParser]: Found 1 translation units. [2018-10-22 16:10:36,626 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/nested_true-unreach-call.c [2018-10-22 16:10:36,634 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/029979431/41025378977e40c7b077c396e93f5501/FLAGf06755276 [2018-10-22 16:10:36,651 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/029979431/41025378977e40c7b077c396e93f5501 [2018-10-22 16:10:36,665 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-22 16:10:36,666 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-22 16:10:36,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-22 16:10:36,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-22 16:10:36,676 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-22 16:10:36,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 04:10:36" (1/1) ... [2018-10-22 16:10:36,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e66237e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:10:36, skipping insertion in model container [2018-10-22 16:10:36,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 04:10:36" (1/1) ... [2018-10-22 16:10:36,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-22 16:10:36,712 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-22 16:10:36,902 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 16:10:36,906 INFO L189 MainTranslator]: Completed pre-run [2018-10-22 16:10:36,933 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 16:10:36,951 INFO L193 MainTranslator]: Completed translation [2018-10-22 16:10:36,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:10:36 WrapperNode [2018-10-22 16:10:36,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-22 16:10:36,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-22 16:10:36,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-22 16:10:36,954 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-22 16:10:36,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:10:36" (1/1) ... [2018-10-22 16:10:36,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:10:36" (1/1) ... [2018-10-22 16:10:36,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-22 16:10:36,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-22 16:10:36,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-22 16:10:36,978 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-22 16:10:36,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:10:36" (1/1) ... [2018-10-22 16:10:36,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:10:36" (1/1) ... [2018-10-22 16:10:36,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:10:36" (1/1) ... [2018-10-22 16:10:36,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:10:36" (1/1) ... [2018-10-22 16:10:36,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:10:36" (1/1) ... [2018-10-22 16:10:36,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:10:36" (1/1) ... [2018-10-22 16:10:36,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:10:36" (1/1) ... [2018-10-22 16:10:37,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-22 16:10:37,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-22 16:10:37,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-22 16:10:37,004 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-22 16:10:37,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:10:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-22 16:10:37,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-22 16:10:37,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-22 16:10:37,122 INFO L130 BoogieDeclarations]: Found specification of procedure nondet [2018-10-22 16:10:37,123 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet [2018-10-22 16:10:37,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-22 16:10:37,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-22 16:10:37,123 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-22 16:10:37,123 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-22 16:10:37,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-22 16:10:37,124 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-22 16:10:37,468 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-22 16:10:37,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 04:10:37 BoogieIcfgContainer [2018-10-22 16:10:37,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-22 16:10:37,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-22 16:10:37,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-22 16:10:37,480 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-22 16:10:37,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 04:10:36" (1/3) ... [2018-10-22 16:10:37,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230d382a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 04:10:37, skipping insertion in model container [2018-10-22 16:10:37,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 04:10:36" (2/3) ... [2018-10-22 16:10:37,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230d382a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 04:10:37, skipping insertion in model container [2018-10-22 16:10:37,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 04:10:37" (3/3) ... [2018-10-22 16:10:37,485 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call.c [2018-10-22 16:10:37,496 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-22 16:10:37,502 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-22 16:10:37,516 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-22 16:10:37,547 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-22 16:10:37,548 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-22 16:10:37,548 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-22 16:10:37,548 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-22 16:10:37,548 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-22 16:10:37,549 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-22 16:10:37,549 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-22 16:10:37,549 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-22 16:10:37,549 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-22 16:10:37,568 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-10-22 16:10:37,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-22 16:10:37,574 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:10:37,575 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:10:37,577 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:10:37,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:10:37,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1030098894, now seen corresponding path program 1 times [2018-10-22 16:10:37,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:10:37,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:37,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:10:37,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:37,639 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:10:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:10:37,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 16:10:37,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 16:10:37,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-22 16:10:37,709 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:10:37,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-22 16:10:37,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-22 16:10:37,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-22 16:10:37,730 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-10-22 16:10:37,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:10:37,756 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2018-10-22 16:10:37,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-22 16:10:37,758 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-10-22 16:10:37,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:10:37,767 INFO L225 Difference]: With dead ends: 44 [2018-10-22 16:10:37,767 INFO L226 Difference]: Without dead ends: 25 [2018-10-22 16:10:37,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-22 16:10:37,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-22 16:10:37,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-22 16:10:37,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-22 16:10:37,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-10-22 16:10:37,813 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 19 [2018-10-22 16:10:37,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:10:37,814 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-10-22 16:10:37,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-22 16:10:37,814 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-10-22 16:10:37,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-22 16:10:37,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:10:37,816 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] [2018-10-22 16:10:37,816 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:10:37,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:10:37,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1176183033, now seen corresponding path program 1 times [2018-10-22 16:10:37,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:10:37,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:37,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:10:37,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:37,818 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:10:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:10:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 16:10:37,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 16:10:37,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-22 16:10:37,897 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:10:37,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 16:10:37,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 16:10:37,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-22 16:10:37,900 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 3 states. [2018-10-22 16:10:38,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:10:38,103 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-10-22 16:10:38,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 16:10:38,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-22 16:10:38,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:10:38,105 INFO L225 Difference]: With dead ends: 46 [2018-10-22 16:10:38,105 INFO L226 Difference]: Without dead ends: 31 [2018-10-22 16:10:38,107 INFO L605 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-10-22 16:10:38,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-22 16:10:38,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-10-22 16:10:38,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-22 16:10:38,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-10-22 16:10:38,114 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 20 [2018-10-22 16:10:38,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:10:38,114 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-10-22 16:10:38,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 16:10:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-10-22 16:10:38,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-22 16:10:38,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:10:38,116 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:10:38,117 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:10:38,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:10:38,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1045124110, now seen corresponding path program 1 times [2018-10-22 16:10:38,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:10:38,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:38,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:10:38,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:38,119 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:10:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:10:38,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 16:10:38,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:10:38,282 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 16:10:38,283 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-22 16:10:38,285 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [40], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-22 16:10:38,339 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 16:10:38,339 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 16:10:38,636 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 16:10:38,638 INFO L272 AbstractInterpreter]: Visited 18 different actions 66 times. Merged at 4 different actions 38 times. Widened at 1 different actions 6 times. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-10-22 16:10:38,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:10:38,670 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 16:10:38,815 INFO L232 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 62.04% of their original sizes. [2018-10-22 16:10:38,815 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 16:10:39,188 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 16:10:39,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 16:10:39,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-10-22 16:10:39,189 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:10:39,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-22 16:10:39,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-22 16:10:39,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-22 16:10:39,194 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 6 states. [2018-10-22 16:10:39,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:10:39,674 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2018-10-22 16:10:39,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-22 16:10:39,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-10-22 16:10:39,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:10:39,678 INFO L225 Difference]: With dead ends: 58 [2018-10-22 16:10:39,678 INFO L226 Difference]: Without dead ends: 41 [2018-10-22 16:10:39,679 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-22 16:10:39,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-22 16:10:39,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-10-22 16:10:39,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-22 16:10:39,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-10-22 16:10:39,689 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 24 [2018-10-22 16:10:39,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:10:39,689 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-10-22 16:10:39,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-22 16:10:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-10-22 16:10:39,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-22 16:10:39,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:10:39,691 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:10:39,691 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:10:39,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:10:39,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1102382412, now seen corresponding path program 1 times [2018-10-22 16:10:39,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:10:39,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:39,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:10:39,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:39,694 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:10:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:10:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 16:10:39,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:10:39,840 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 16:10:39,840 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-22 16:10:39,841 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [42], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-22 16:10:39,843 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 16:10:39,844 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 16:10:39,927 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 16:10:39,927 INFO L272 AbstractInterpreter]: Visited 22 different actions 60 times. Merged at 4 different actions 30 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-10-22 16:10:39,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:10:39,942 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 16:10:40,047 INFO L232 lantSequenceWeakener]: Weakened 22 states. On average, predicates are now at 60.23% of their original sizes. [2018-10-22 16:10:40,049 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 16:10:40,446 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 16:10:40,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 16:10:40,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-10-22 16:10:40,447 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:10:40,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-22 16:10:40,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-22 16:10:40,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-22 16:10:40,449 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 10 states. [2018-10-22 16:10:41,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:10:41,381 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2018-10-22 16:10:41,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-22 16:10:41,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-10-22 16:10:41,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:10:41,383 INFO L225 Difference]: With dead ends: 66 [2018-10-22 16:10:41,383 INFO L226 Difference]: Without dead ends: 49 [2018-10-22 16:10:41,384 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-22 16:10:41,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-22 16:10:41,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-10-22 16:10:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-22 16:10:41,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-10-22 16:10:41,397 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 24 [2018-10-22 16:10:41,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:10:41,397 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-10-22 16:10:41,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-22 16:10:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-10-22 16:10:41,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-22 16:10:41,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:10:41,399 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:10:41,399 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:10:41,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:10:41,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1438151120, now seen corresponding path program 1 times [2018-10-22 16:10:41,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:10:41,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:41,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:10:41,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:41,402 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:10:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:10:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 16:10:41,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:10:41,469 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 16:10:41,469 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-22 16:10:41,469 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [34], [40], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-22 16:10:41,471 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 16:10:41,472 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 16:10:41,487 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 16:10:41,487 INFO L272 AbstractInterpreter]: Visited 17 different actions 21 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-10-22 16:10:41,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:10:41,521 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 16:10:41,560 INFO L232 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 67.65% of their original sizes. [2018-10-22 16:10:41,560 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 16:10:41,842 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 16:10:41,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 16:10:41,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-10-22 16:10:41,843 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:10:41,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-22 16:10:41,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-22 16:10:41,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-22 16:10:41,845 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 6 states. [2018-10-22 16:10:42,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:10:42,231 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2018-10-22 16:10:42,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-22 16:10:42,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-10-22 16:10:42,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:10:42,235 INFO L225 Difference]: With dead ends: 71 [2018-10-22 16:10:42,235 INFO L226 Difference]: Without dead ends: 54 [2018-10-22 16:10:42,235 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-22 16:10:42,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-22 16:10:42,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-10-22 16:10:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-22 16:10:42,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-10-22 16:10:42,251 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2018-10-22 16:10:42,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:10:42,252 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-10-22 16:10:42,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-22 16:10:42,252 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-10-22 16:10:42,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-22 16:10:42,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:10:42,256 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:10:42,256 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:10:42,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:10:42,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1472263337, now seen corresponding path program 1 times [2018-10-22 16:10:42,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:10:42,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:42,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:10:42,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:42,258 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:10:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:10:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 16:10:42,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:10:42,379 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 16:10:42,379 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-22 16:10:42,380 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [40], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-22 16:10:42,382 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 16:10:42,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 16:10:42,479 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 16:10:42,479 INFO L272 AbstractInterpreter]: Visited 23 different actions 95 times. Merged at 6 different actions 51 times. Widened at 1 different actions 7 times. Found 13 fixpoints after 4 different actions. Largest state had 8 variables. [2018-10-22 16:10:42,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:10:42,517 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 16:10:42,564 INFO L232 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 58.01% of their original sizes. [2018-10-22 16:10:42,565 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 16:10:43,223 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 16:10:43,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 16:10:43,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-10-22 16:10:43,225 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:10:43,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-22 16:10:43,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-22 16:10:43,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-10-22 16:10:43,227 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 12 states. [2018-10-22 16:10:43,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:10:43,935 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-10-22 16:10:43,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-22 16:10:43,935 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-10-22 16:10:43,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:10:43,937 INFO L225 Difference]: With dead ends: 78 [2018-10-22 16:10:43,937 INFO L226 Difference]: Without dead ends: 61 [2018-10-22 16:10:43,937 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-10-22 16:10:43,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-22 16:10:43,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2018-10-22 16:10:43,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-22 16:10:43,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2018-10-22 16:10:43,949 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 28 [2018-10-22 16:10:43,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:10:43,949 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-10-22 16:10:43,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-22 16:10:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2018-10-22 16:10:43,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-22 16:10:43,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:10:43,951 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:10:43,951 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:10:43,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:10:43,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1415005035, now seen corresponding path program 1 times [2018-10-22 16:10:43,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:10:43,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:43,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:10:43,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:43,953 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:10:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:10:44,056 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 16:10:44,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:10:44,057 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 16:10:44,057 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-22 16:10:44,057 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [42], [48], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-22 16:10:44,059 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 16:10:44,060 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 16:10:44,146 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 16:10:44,146 INFO L272 AbstractInterpreter]: Visited 23 different actions 92 times. Merged at 8 different actions 48 times. Widened at 1 different actions 6 times. Found 11 fixpoints after 3 different actions. Largest state had 8 variables. [2018-10-22 16:10:44,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:10:44,156 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 16:10:44,197 INFO L232 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 58.01% of their original sizes. [2018-10-22 16:10:44,197 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 16:10:44,479 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 16:10:44,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 16:10:44,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2018-10-22 16:10:44,480 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:10:44,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-22 16:10:44,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-22 16:10:44,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-10-22 16:10:44,481 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 12 states. [2018-10-22 16:10:45,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:10:45,467 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2018-10-22 16:10:45,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-22 16:10:45,468 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-10-22 16:10:45,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:10:45,469 INFO L225 Difference]: With dead ends: 69 [2018-10-22 16:10:45,469 INFO L226 Difference]: Without dead ends: 67 [2018-10-22 16:10:45,470 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-10-22 16:10:45,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-22 16:10:45,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-10-22 16:10:45,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-22 16:10:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-10-22 16:10:45,480 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 28 [2018-10-22 16:10:45,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:10:45,481 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-10-22 16:10:45,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-22 16:10:45,481 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-10-22 16:10:45,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-22 16:10:45,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:10:45,482 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 16:10:45,483 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:10:45,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:10:45,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1416852077, now seen corresponding path program 1 times [2018-10-22 16:10:45,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:10:45,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:45,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:10:45,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:45,484 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:10:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:10:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 16:10:45,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:10:45,661 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 16:10:45,662 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-22 16:10:45,662 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [42], [46], [55], [58], [60], [66], [67], [68], [70], [71], [72] [2018-10-22 16:10:45,664 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 16:10:45,664 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 16:10:45,734 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-22 16:10:45,734 INFO L272 AbstractInterpreter]: Visited 24 different actions 90 times. Merged at 7 different actions 47 times. Widened at 1 different actions 6 times. Found 12 fixpoints after 4 different actions. Largest state had 8 variables. [2018-10-22 16:10:45,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:10:45,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-22 16:10:45,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:10:45,773 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-22 16:10:45,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:10:45,790 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 16:10:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:10:45,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 16:10:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 16:10:45,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 16:10:45,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 16:10:46,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:10:46,003 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 16:10:46,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:10:46,022 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 16:10:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:10:46,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 16:10:46,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-22 16:10:46,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 16:10:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-22 16:10:46,229 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-10-22 16:10:46,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5, 5, 5] total 12 [2018-10-22 16:10:46,229 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:10:46,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-22 16:10:46,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-22 16:10:46,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-22 16:10:46,230 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 4 states. [2018-10-22 16:10:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:10:46,387 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2018-10-22 16:10:46,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-22 16:10:46,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-10-22 16:10:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:10:46,389 INFO L225 Difference]: With dead ends: 102 [2018-10-22 16:10:46,390 INFO L226 Difference]: Without dead ends: 69 [2018-10-22 16:10:46,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-22 16:10:46,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-22 16:10:46,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2018-10-22 16:10:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-22 16:10:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-10-22 16:10:46,406 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 28 [2018-10-22 16:10:46,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:10:46,406 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-10-22 16:10:46,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-22 16:10:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-10-22 16:10:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-22 16:10:46,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:10:46,408 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-10-22 16:10:46,408 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:10:46,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:10:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash 992707110, now seen corresponding path program 1 times [2018-10-22 16:10:46,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:10:46,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:46,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:10:46,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:46,409 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:10:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:10:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-22 16:10:46,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:10:46,452 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 16:10:46,453 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-10-22 16:10:46,453 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [32], [34], [40], [42], [48], [55], [58], [60], [63], [65], [66], [67], [68], [70], [71], [72], [73] [2018-10-22 16:10:46,455 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 16:10:46,455 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 16:10:46,715 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 16:10:46,715 INFO L272 AbstractInterpreter]: Visited 26 different actions 413 times. Merged at 10 different actions 229 times. Widened at 3 different actions 44 times. Found 24 fixpoints after 5 different actions. Largest state had 8 variables. [2018-10-22 16:10:46,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:10:46,753 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 16:10:46,804 INFO L232 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 49.32% of their original sizes. [2018-10-22 16:10:46,804 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 16:10:47,106 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 16:10:47,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 16:10:47,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-22 16:10:47,107 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:10:47,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-22 16:10:47,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-22 16:10:47,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-10-22 16:10:47,107 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 14 states. [2018-10-22 16:10:49,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:10:49,244 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2018-10-22 16:10:49,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-22 16:10:49,244 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2018-10-22 16:10:49,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:10:49,245 INFO L225 Difference]: With dead ends: 112 [2018-10-22 16:10:49,245 INFO L226 Difference]: Without dead ends: 89 [2018-10-22 16:10:49,246 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-10-22 16:10:49,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-22 16:10:49,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2018-10-22 16:10:49,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-22 16:10:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2018-10-22 16:10:49,263 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 39 [2018-10-22 16:10:49,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:10:49,264 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2018-10-22 16:10:49,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-22 16:10:49,264 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2018-10-22 16:10:49,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-22 16:10:49,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:10:49,267 INFO L375 BasicCegarLoop]: trace histogram [4, 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] [2018-10-22 16:10:49,267 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:10:49,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:10:49,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1385734120, now seen corresponding path program 1 times [2018-10-22 16:10:49,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:10:49,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:49,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:10:49,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:49,268 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:10:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:10:49,396 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-22 16:10:49,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:10:49,397 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 16:10:49,397 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-10-22 16:10:49,397 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [40], [42], [48], [55], [58], [60], [63], [65], [66], [67], [68], [70], [71], [72], [73] [2018-10-22 16:10:49,399 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 16:10:49,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 16:10:49,902 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 16:10:49,903 INFO L272 AbstractInterpreter]: Visited 27 different actions 554 times. Merged at 12 different actions 271 times. Widened at 3 different actions 39 times. Found 72 fixpoints after 8 different actions. Largest state had 8 variables. [2018-10-22 16:10:49,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:10:49,940 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 16:10:49,993 INFO L232 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 50.68% of their original sizes. [2018-10-22 16:10:49,993 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 16:10:50,508 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 16:10:50,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 16:10:50,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [4] total 19 [2018-10-22 16:10:50,508 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:10:50,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-22 16:10:50,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-22 16:10:50,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-10-22 16:10:50,510 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand 17 states. [2018-10-22 16:10:51,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:10:51,516 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2018-10-22 16:10:51,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-22 16:10:51,516 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-10-22 16:10:51,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:10:51,517 INFO L225 Difference]: With dead ends: 106 [2018-10-22 16:10:51,518 INFO L226 Difference]: Without dead ends: 104 [2018-10-22 16:10:51,518 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2018-10-22 16:10:51,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-22 16:10:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2018-10-22 16:10:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-22 16:10:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2018-10-22 16:10:51,552 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 39 [2018-10-22 16:10:51,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:10:51,553 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2018-10-22 16:10:51,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-22 16:10:51,553 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2018-10-22 16:10:51,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-22 16:10:51,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 16:10:51,557 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 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] [2018-10-22 16:10:51,557 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 16:10:51,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:10:51,558 INFO L82 PathProgramCache]: Analyzing trace with hash -819542281, now seen corresponding path program 1 times [2018-10-22 16:10:51,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 16:10:51,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:51,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:10:51,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 16:10:51,562 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 16:10:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:10:51,779 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-22 16:10:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-22 16:10:51,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:10:51,798 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 16:10:51,798 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-10-22 16:10:51,798 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [12], [18], [22], [25], [27], [30], [32], [34], [40], [42], [46], [48], [55], [58], [60], [63], [65], [66], [67], [68], [70], [71], [72], [73] [2018-10-22 16:10:51,800 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 16:10:51,800 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 16:10:52,625 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-22 16:10:52,626 INFO L272 AbstractInterpreter]: Visited 29 different actions 1068 times. Merged at 13 different actions 433 times. Widened at 3 different actions 65 times. Found 173 fixpoints after 10 different actions. Largest state had 8 variables. [2018-10-22 16:10:52,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 16:10:52,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-22 16:10:52,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 16:10:52,664 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 16:10:52,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 16:10:52,679 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 16:10:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 16:10:52,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 16:10:52,823 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-22 16:10:52,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 16:10:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-22 16:10:53,099 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-22 16:10:53,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2018-10-22 16:10:53,099 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 16:10:53,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-22 16:10:53,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-22 16:10:53,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-22 16:10:53,101 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand 3 states. [2018-10-22 16:10:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 16:10:53,229 INFO L93 Difference]: Finished difference Result 110 states and 135 transitions. [2018-10-22 16:10:53,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-22 16:10:53,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-10-22 16:10:53,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 16:10:53,231 INFO L225 Difference]: With dead ends: 110 [2018-10-22 16:10:53,232 INFO L226 Difference]: Without dead ends: 0 [2018-10-22 16:10:53,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-22 16:10:53,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-22 16:10:53,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-22 16:10:53,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-22 16:10:53,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-22 16:10:53,235 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-10-22 16:10:53,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 16:10:53,235 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-22 16:10:53,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-22 16:10:53,235 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-22 16:10:53,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-22 16:10:53,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-22 16:10:53,427 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 106 [2018-10-22 16:10:53,534 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 182 [2018-10-22 16:10:53,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 16:10:53,733 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 93 [2018-10-22 16:10:53,927 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-22 16:10:55,812 WARN L179 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 113 DAG size of output: 42 [2018-10-22 16:10:56,349 WARN L179 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 60 [2018-10-22 16:10:56,471 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 40 [2018-10-22 16:10:56,478 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-22 16:10:56,478 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-22 16:10:56,478 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-22 16:10:56,479 INFO L425 ceAbstractionStarter]: For program point nondetFINAL(lines 15 19) no Hoare annotation was computed. [2018-10-22 16:10:56,479 INFO L428 ceAbstractionStarter]: At program point nondetENTRY(lines 15 19) the Hoare annotation is: true [2018-10-22 16:10:56,479 INFO L425 ceAbstractionStarter]: For program point nondetEXIT(lines 15 19) no Hoare annotation was computed. [2018-10-22 16:10:56,479 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-22 16:10:56,479 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (* 2 ~last~0))) (and (<= .cse0 4294967294) (<= 0 (+ .cse0 4294967296)))) [2018-10-22 16:10:56,479 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-22 16:10:56,479 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-22 16:10:56,480 INFO L421 ceAbstractionStarter]: At program point L33(lines 24 34) the Hoare annotation is: (let ((.cse0 (* 2 |old(~last~0)|))) (or (< 4294967294 .cse0) (< (+ .cse0 4294967296) 0) (and (let ((.cse1 (= main_~b~0 0)) (.cse2 (<= (+ main_~a~0 main_~b~0) 0))) (or (and .cse1 .cse2 (<= main_~c~0 main_~a~0)) (and .cse1 (<= (+ ~last~0 1) main_~c~0) .cse2 (<= 0 (* 2 ~last~0)) (<= main_~c~0 (+ main_~a~0 1))))) (<= (+ ~last~0 main_~b~0) 2147483647) (<= main_~b~0 main_~c~0) (<= 0 (+ ~last~0 main_~a~0 2147483648))) (and (<= ~last~0 (+ main_~st~0 2147483646)) (<= 200000 (+ main_~st~0 main_~c~0)) (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0) (<= (+ main_~st~0 199999) main_~c~0) (<= (* 2 main_~c~0) 400000) (<= (+ main_~st~0 1) main_~a~0) (<= 0 (+ ~last~0 main_~st~0 2147483647)) (<= 2 (+ main_~a~0 main_~st~0))))) [2018-10-22 16:10:56,480 INFO L421 ceAbstractionStarter]: At program point L31-1(lines 31 32) the Hoare annotation is: (let ((.cse0 (* 2 |old(~last~0)|))) (or (< 4294967294 .cse0) (< (+ .cse0 4294967296) 0) (and (<= ~last~0 (+ main_~st~0 2147483646)) (<= 200000 (+ main_~st~0 main_~c~0)) (<= main_~a~0 main_~b~0) (<= main_~b~0 main_~a~0) (<= (+ main_~st~0 199999) main_~c~0) (<= (* 2 main_~c~0) 400000) (<= (+ main_~st~0 1) main_~a~0) (<= 0 (+ ~last~0 main_~st~0 2147483647)) (<= 2 (+ main_~a~0 main_~st~0))))) [2018-10-22 16:10:56,480 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-10-22 16:10:56,481 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 21 35) no Hoare annotation was computed. [2018-10-22 16:10:56,481 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 21 35) the Hoare annotation is: (let ((.cse0 (* 2 |old(~last~0)|))) (or (< 4294967294 .cse0) (< (+ .cse0 4294967296) 0) (let ((.cse1 (* 2 ~last~0))) (and (<= .cse1 4294967294) (<= 0 (+ .cse1 4294967296)))))) [2018-10-22 16:10:56,481 INFO L425 ceAbstractionStarter]: For program point L28-1(lines 24 34) no Hoare annotation was computed. [2018-10-22 16:10:56,481 INFO L425 ceAbstractionStarter]: For program point L26-1(lines 26 27) no Hoare annotation was computed. [2018-10-22 16:10:56,481 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 34) no Hoare annotation was computed. [2018-10-22 16:10:56,481 INFO L425 ceAbstractionStarter]: For program point L26-3(lines 26 27) no Hoare annotation was computed. [2018-10-22 16:10:56,481 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-22 16:10:56,481 INFO L421 ceAbstractionStarter]: At program point L26-4(lines 26 27) the Hoare annotation is: (let ((.cse8 (* 2 main_~st~0))) (let ((.cse0 (* 2 |old(~last~0)|)) (.cse1 (<= .cse8 2)) (.cse2 (<= 1 (+ main_~st~0 main_~c~0))) (.cse3 (<= main_~a~0 main_~b~0)) (.cse4 (<= main_~b~0 main_~a~0)) (.cse5 (<= (* 2 main_~c~0) 400000)) (.cse6 (<= 0 (+ ~last~0 main_~st~0 2147483647))) (.cse7 (<= main_~st~0 (+ main_~b~0 1)))) (or (< 4294967294 .cse0) (< (+ .cse0 4294967296) 0) (and .cse1 .cse2 .cse3 (<= (* 2 ~last~0) 4294967294) .cse4 .cse5 (<= 1 main_~st~0) .cse6 .cse7) (and .cse1 (<= 0 .cse8) .cse2 .cse3 .cse4 .cse5 (<= (+ ~last~0 1) main_~c~0) .cse6 .cse7 (<= 0 (+ main_~a~0 main_~st~0)))))) [2018-10-22 16:10:56,482 INFO L425 ceAbstractionStarter]: For program point L26-5(lines 24 34) no Hoare annotation was computed. [2018-10-22 16:10:56,482 INFO L425 ceAbstractionStarter]: For program point L24-3(lines 21 35) no Hoare annotation was computed. [2018-10-22 16:10:56,482 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2018-10-22 16:10:56,482 INFO L425 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-10-22 16:10:56,482 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 8 13) no Hoare annotation was computed. [2018-10-22 16:10:56,482 INFO L425 ceAbstractionStarter]: For program point L9(lines 9 11) no Hoare annotation was computed. [2018-10-22 16:10:56,482 INFO L425 ceAbstractionStarter]: For program point L9-2(lines 8 13) no Hoare annotation was computed. [2018-10-22 16:10:56,482 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-10-22 16:10:56,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 04:10:56 BoogieIcfgContainer [2018-10-22 16:10:56,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-22 16:10:56,497 INFO L168 Benchmark]: Toolchain (without parser) took 19831.84 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -925.0 MB). Peak memory consumption was 832.6 MB. Max. memory is 7.1 GB. [2018-10-22 16:10:56,498 INFO L168 Benchmark]: CDTParser took 0.17 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-10-22 16:10:56,499 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.77 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-22 16:10:56,499 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-22 16:10:56,500 INFO L168 Benchmark]: Boogie Preprocessor took 25.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-22 16:10:56,500 INFO L168 Benchmark]: RCFGBuilder took 465.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.2 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2018-10-22 16:10:56,501 INFO L168 Benchmark]: TraceAbstraction took 19026.71 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 328.7 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -130.4 MB). Peak memory consumption was 875.4 MB. Max. memory is 7.1 GB. [2018-10-22 16:10:56,506 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.17 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 284.77 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 24.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.34 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 465.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.2 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19026.71 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 328.7 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -130.4 MB). Peak memory consumption was 875.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((4294967294 < 2 * \old(last) || 2 * \old(last) + 4294967296 < 0) || ((((((((2 * st <= 2 && 1 <= st + c) && a <= b) && 2 * last <= 4294967294) && b <= a) && 2 * c <= 400000) && 1 <= st) && 0 <= last + st + 2147483647) && st <= b + 1)) || (((((((((2 * st <= 2 && 0 <= 2 * st) && 1 <= st + c) && a <= b) && b <= a) && 2 * c <= 400000) && last + 1 <= c) && 0 <= last + st + 2147483647) && st <= b + 1) && 0 <= a + st) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((4294967294 < 2 * \old(last) || 2 * \old(last) + 4294967296 < 0) || ((((((b == 0 && a + b <= 0) && c <= a) || ((((b == 0 && last + 1 <= c) && a + b <= 0) && 0 <= 2 * last) && c <= a + 1)) && last + b <= 2147483647) && b <= c) && 0 <= last + a + 2147483648)) || ((((((((last <= st + 2147483646 && 200000 <= st + c) && a <= b) && b <= a) && st + 199999 <= c) && 2 * c <= 400000) && st + 1 <= a) && 0 <= last + st + 2147483647) && 2 <= a + st) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. SAFE Result, 18.9s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 7.2s AutomataDifference, 0.0s DeadEndRemovalTime, 3.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 270 SDtfs, 234 SDslu, 639 SDs, 0 SdLazy, 296 SolverSat, 89 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 417 GetRequests, 330 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.5s AbstIntTime, 9 AbstIntIterations, 7 AbstIntStrong, 0.9001256281407035 AbsIntWeakeningRatio, 0.5728643216080402 AbsIntAvgWeakeningVarsNumRemoved, 19.452261306532662 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 87 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 23 PreInvPairs, 40 NumberOfFragments, 317 HoareAnnotationTreeSize, 23 FomulaSimplifications, 18256 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1178 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 497 ConstructedInterpolants, 0 QuantifiedInterpolants, 24349 SizeOfPredicates, 6 NumberOfNonLiveVariables, 258 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 151/203 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...