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-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label56_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 02:02:59,539 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 02:02:59,541 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 02:02:59,557 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 02:02:59,558 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 02:02:59,559 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 02:02:59,560 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 02:02:59,562 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 02:02:59,565 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 02:02:59,566 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 02:02:59,567 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 02:02:59,567 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 02:02:59,570 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 02:02:59,571 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 02:02:59,572 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 02:02:59,576 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 02:02:59,577 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 02:02:59,579 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 02:02:59,581 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 02:02:59,582 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 02:02:59,583 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 02:02:59,584 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 02:02:59,590 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 02:02:59,591 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 02:02:59,591 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 02:02:59,592 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 02:02:59,593 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 02:02:59,596 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 02:02:59,600 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 02:02:59,601 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 02:02:59,601 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 02:02:59,604 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 02:02:59,604 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 02:02:59,604 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 02:02:59,606 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 02:02:59,607 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 02:02:59,608 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 02:02:59,630 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 02:02:59,630 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 02:02:59,631 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 02:02:59,631 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 02:02:59,631 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 02:02:59,631 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 02:02:59,632 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 02:02:59,632 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 02:02:59,632 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 02:02:59,632 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 02:02:59,632 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 02:02:59,633 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 02:02:59,633 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 02:02:59,633 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 02:02:59,634 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 02:02:59,634 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 02:02:59,634 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 02:02:59,634 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 02:02:59,634 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 02:02:59,635 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 02:02:59,635 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 02:02:59,635 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 02:02:59,635 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 02:02:59,635 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 02:02:59,636 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 02:02:59,636 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 02:02:59,636 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 02:02:59,636 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 02:02:59,636 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 02:02:59,637 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 02:02:59,637 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 02:02:59,637 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 02:02:59,637 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 02:02:59,637 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 02:02:59,637 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 02:02:59,638 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 02:02:59,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 02:02:59,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 02:02:59,704 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 02:02:59,705 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 02:02:59,706 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 02:02:59,706 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label56_true-unreach-call.c [2018-10-25 02:02:59,775 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0b04afca2/6121419359c442968b9f63122923bd45/FLAG78ff56fc3 [2018-10-25 02:03:00,529 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 02:03:00,530 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label56_true-unreach-call.c [2018-10-25 02:03:00,559 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0b04afca2/6121419359c442968b9f63122923bd45/FLAG78ff56fc3 [2018-10-25 02:03:00,580 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0b04afca2/6121419359c442968b9f63122923bd45 [2018-10-25 02:03:00,592 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 02:03:00,594 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 02:03:00,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 02:03:00,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 02:03:00,601 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 02:03:00,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:03:00" (1/1) ... [2018-10-25 02:03:00,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24d685f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:00, skipping insertion in model container [2018-10-25 02:03:00,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:03:00" (1/1) ... [2018-10-25 02:03:00,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 02:03:00,749 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 02:03:01,784 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:03:01,789 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 02:03:02,158 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:03:02,183 INFO L193 MainTranslator]: Completed translation [2018-10-25 02:03:02,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:02 WrapperNode [2018-10-25 02:03:02,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 02:03:02,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 02:03:02,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 02:03:02,185 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 02:03:02,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:02" (1/1) ... [2018-10-25 02:03:02,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:02" (1/1) ... [2018-10-25 02:03:02,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 02:03:02,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 02:03:02,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 02:03:02,677 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 02:03:02,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:02" (1/1) ... [2018-10-25 02:03:02,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:02" (1/1) ... [2018-10-25 02:03:02,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:02" (1/1) ... [2018-10-25 02:03:02,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:02" (1/1) ... [2018-10-25 02:03:02,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:02" (1/1) ... [2018-10-25 02:03:02,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:02" (1/1) ... [2018-10-25 02:03:02,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:02" (1/1) ... [2018-10-25 02:03:03,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 02:03:03,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 02:03:03,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 02:03:03,010 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 02:03:03,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:02" (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-25 02:03:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 02:03:03,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 02:03:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-10-25 02:03:03,087 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-10-25 02:03:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 02:03:03,087 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 02:03:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 02:03:03,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 02:03:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 02:03:03,088 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 02:03:15,880 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 02:03:15,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:03:15 BoogieIcfgContainer [2018-10-25 02:03:15,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 02:03:15,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 02:03:15,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 02:03:15,889 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 02:03:15,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 02:03:00" (1/3) ... [2018-10-25 02:03:15,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769e9d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:03:15, skipping insertion in model container [2018-10-25 02:03:15,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:03:02" (2/3) ... [2018-10-25 02:03:15,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@769e9d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:03:15, skipping insertion in model container [2018-10-25 02:03:15,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:03:15" (3/3) ... [2018-10-25 02:03:15,893 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label56_true-unreach-call.c [2018-10-25 02:03:15,903 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 02:03:15,915 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 02:03:15,933 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 02:03:15,978 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 02:03:15,978 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 02:03:15,978 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 02:03:15,979 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 02:03:15,979 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 02:03:15,979 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 02:03:15,979 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 02:03:15,979 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 02:03:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-10-25 02:03:16,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-25 02:03:16,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:03:16,034 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:03:16,036 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:03:16,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:03:16,043 INFO L82 PathProgramCache]: Analyzing trace with hash -813169730, now seen corresponding path program 1 times [2018-10-25 02:03:16,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:03:16,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:03:16,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:03:16,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:03:16,092 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:03:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:03:16,619 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-25 02:03:16,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:03:16,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 02:03:16,623 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:03:16,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 02:03:16,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 02:03:16,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:03:16,652 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 4 states. [2018-10-25 02:03:26,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:03:26,813 INFO L93 Difference]: Finished difference Result 2125 states and 3954 transitions. [2018-10-25 02:03:26,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 02:03:26,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-10-25 02:03:26,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:03:26,849 INFO L225 Difference]: With dead ends: 2125 [2018-10-25 02:03:26,850 INFO L226 Difference]: Without dead ends: 1515 [2018-10-25 02:03:26,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:03:26,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2018-10-25 02:03:27,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1043. [2018-10-25 02:03:27,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2018-10-25 02:03:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1647 transitions. [2018-10-25 02:03:27,018 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1647 transitions. Word has length 73 [2018-10-25 02:03:27,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:03:27,019 INFO L481 AbstractCegarLoop]: Abstraction has 1043 states and 1647 transitions. [2018-10-25 02:03:27,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 02:03:27,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1647 transitions. [2018-10-25 02:03:27,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-25 02:03:27,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:03:27,031 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:03:27,032 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:03:27,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:03:27,032 INFO L82 PathProgramCache]: Analyzing trace with hash -840736881, now seen corresponding path program 1 times [2018-10-25 02:03:27,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:03:27,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:03:27,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:03:27,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:03:27,034 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:03:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:03:27,346 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:03:27,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:03:27,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 02:03:27,347 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:03:27,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 02:03:27,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 02:03:27,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-25 02:03:27,350 INFO L87 Difference]: Start difference. First operand 1043 states and 1647 transitions. Second operand 5 states. [2018-10-25 02:03:36,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:03:36,044 INFO L93 Difference]: Finished difference Result 3017 states and 4847 transitions. [2018-10-25 02:03:36,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:03:36,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2018-10-25 02:03:36,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:03:36,058 INFO L225 Difference]: With dead ends: 3017 [2018-10-25 02:03:36,059 INFO L226 Difference]: Without dead ends: 1980 [2018-10-25 02:03:36,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-25 02:03:36,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2018-10-25 02:03:36,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1954. [2018-10-25 02:03:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2018-10-25 02:03:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2892 transitions. [2018-10-25 02:03:36,139 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2892 transitions. Word has length 145 [2018-10-25 02:03:36,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:03:36,139 INFO L481 AbstractCegarLoop]: Abstraction has 1954 states and 2892 transitions. [2018-10-25 02:03:36,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 02:03:36,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2892 transitions. [2018-10-25 02:03:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-25 02:03:36,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:03:36,154 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:03:36,154 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:03:36,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:03:36,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1157485801, now seen corresponding path program 1 times [2018-10-25 02:03:36,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:03:36,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:03:36,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:03:36,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:03:36,157 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:03:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:03:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:03:36,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:03:36,561 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:03:36,562 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-10-25 02:03:36,564 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [990], [998], [1006], [1014], [1022], [1030], [1038], [1046], [1054], [1062], [1070], [1078], [1086], [1094], [1102], [1110], [1118], [1126], [1134], [1142], [1150], [1158], [1166], [1174], [1182], [1190], [1194], [1196], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-10-25 02:03:36,610 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:03:36,610 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:03:38,242 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:03:38,243 INFO L272 AbstractInterpreter]: Visited 83 different actions 235 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-25 02:03:38,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:03:38,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:03:38,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:03:38,290 INFO L194 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-25 02:03:38,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:03:38,308 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:03:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:03:38,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:04:03,375 WARN L179 SmtUtils]: Spent 24.36 s on a formula simplification. DAG size of input: 135 DAG size of output: 98 [2018-10-25 02:04:23,696 WARN L179 SmtUtils]: Spent 16.10 s on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2018-10-25 02:04:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 4 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:04:24,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:04:29,010 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 133 DAG size of output: 16 [2018-10-25 02:04:29,058 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 28 [2018-10-25 02:04:31,724 WARN L179 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 26 [2018-10-25 02:04:32,070 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:04:32,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-25 02:04:32,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 15 [2018-10-25 02:04:32,105 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:04:32,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:04:32,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:04:32,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=162, Unknown=3, NotChecked=0, Total=210 [2018-10-25 02:04:32,109 INFO L87 Difference]: Start difference. First operand 1954 states and 2892 transitions. Second operand 6 states. [2018-10-25 02:05:32,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:05:32,392 INFO L93 Difference]: Finished difference Result 7539 states and 11522 transitions. [2018-10-25 02:05:32,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 02:05:32,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-10-25 02:05:32,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:05:32,434 INFO L225 Difference]: With dead ends: 7539 [2018-10-25 02:05:32,435 INFO L226 Difference]: Without dead ends: 5591 [2018-10-25 02:05:32,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 52.4s TimeCoverageRelationStatistics Valid=45, Invalid=162, Unknown=3, NotChecked=0, Total=210 [2018-10-25 02:05:32,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5591 states. [2018-10-25 02:05:32,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5591 to 5549. [2018-10-25 02:05:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5549 states. [2018-10-25 02:05:32,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5549 states to 5549 states and 8015 transitions. [2018-10-25 02:05:32,624 INFO L78 Accepts]: Start accepts. Automaton has 5549 states and 8015 transitions. Word has length 148 [2018-10-25 02:05:32,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:05:32,624 INFO L481 AbstractCegarLoop]: Abstraction has 5549 states and 8015 transitions. [2018-10-25 02:05:32,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 02:05:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 5549 states and 8015 transitions. [2018-10-25 02:05:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-25 02:05:32,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:05:32,630 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:05:32,631 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:05:32,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:05:32,631 INFO L82 PathProgramCache]: Analyzing trace with hash -792846689, now seen corresponding path program 1 times [2018-10-25 02:05:32,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:05:32,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:05:32,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:05:32,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:05:32,633 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:05:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:05:32,866 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 02:05:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:05:32,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:05:32,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 02:05:32,936 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:05:32,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:05:32,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:05:32,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:05:32,938 INFO L87 Difference]: Start difference. First operand 5549 states and 8015 transitions. Second operand 6 states. [2018-10-25 02:05:38,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:05:38,810 INFO L93 Difference]: Finished difference Result 13857 states and 20357 transitions. [2018-10-25 02:05:38,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 02:05:38,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2018-10-25 02:05:38,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:05:38,865 INFO L225 Difference]: With dead ends: 13857 [2018-10-25 02:05:38,865 INFO L226 Difference]: Without dead ends: 8314 [2018-10-25 02:05:38,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 02:05:38,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8314 states. [2018-10-25 02:05:39,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8314 to 8251. [2018-10-25 02:05:39,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8251 states. [2018-10-25 02:05:39,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8251 states to 8251 states and 10596 transitions. [2018-10-25 02:05:39,158 INFO L78 Accepts]: Start accepts. Automaton has 8251 states and 10596 transitions. Word has length 153 [2018-10-25 02:05:39,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:05:39,159 INFO L481 AbstractCegarLoop]: Abstraction has 8251 states and 10596 transitions. [2018-10-25 02:05:39,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 02:05:39,159 INFO L276 IsEmpty]: Start isEmpty. Operand 8251 states and 10596 transitions. [2018-10-25 02:05:39,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-25 02:05:39,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:05:39,168 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:05:39,168 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:05:39,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:05:39,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1851802376, now seen corresponding path program 1 times [2018-10-25 02:05:39,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:05:39,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:05:39,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:05:39,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:05:39,170 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:05:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:05:39,493 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 137 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-25 02:05:39,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:05:39,493 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:05:39,493 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 238 with the following transitions: [2018-10-25 02:05:39,494 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [990], [998], [1006], [1014], [1022], [1030], [1038], [1046], [1054], [1062], [1070], [1078], [1086], [1094], [1102], [1110], [1118], [1126], [1134], [1142], [1150], [1158], [1166], [1174], [1182], [1190], [1194], [1196], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1227], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1282], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-10-25 02:05:39,499 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:05:39,499 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:05:42,191 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:05:42,191 INFO L272 AbstractInterpreter]: Visited 97 different actions 193 times. Merged at 7 different actions 11 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 26 variables. [2018-10-25 02:05:42,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:05:42,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:05:42,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:05:42,230 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 02:05:42,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:05:42,241 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:05:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:05:42,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:05:42,793 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 137 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-25 02:05:42,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:05:42,949 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-25 02:05:43,051 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-25 02:05:43,903 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 137 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:05:43,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 02:05:43,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2018-10-25 02:05:43,926 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 02:05:43,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 02:05:43,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 02:05:43,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-10-25 02:05:43,928 INFO L87 Difference]: Start difference. First operand 8251 states and 10596 transitions. Second operand 10 states. [2018-10-25 02:06:06,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:06:06,168 INFO L93 Difference]: Finished difference Result 36001 states and 50405 transitions. [2018-10-25 02:06:06,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-25 02:06:06,169 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 237 [2018-10-25 02:06:06,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:06:06,322 INFO L225 Difference]: With dead ends: 36001 [2018-10-25 02:06:06,323 INFO L226 Difference]: Without dead ends: 27756 [2018-10-25 02:06:06,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 467 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2018-10-25 02:06:06,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27756 states. [2018-10-25 02:06:07,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27756 to 27558. [2018-10-25 02:06:07,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27558 states. [2018-10-25 02:06:07,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27558 states to 27558 states and 35253 transitions. [2018-10-25 02:06:07,299 INFO L78 Accepts]: Start accepts. Automaton has 27558 states and 35253 transitions. Word has length 237 [2018-10-25 02:06:07,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:06:07,301 INFO L481 AbstractCegarLoop]: Abstraction has 27558 states and 35253 transitions. [2018-10-25 02:06:07,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 02:06:07,301 INFO L276 IsEmpty]: Start isEmpty. Operand 27558 states and 35253 transitions. [2018-10-25 02:06:07,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-25 02:06:07,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:06:07,328 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:06:07,329 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:06:07,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:06:07,329 INFO L82 PathProgramCache]: Analyzing trace with hash -831861875, now seen corresponding path program 1 times [2018-10-25 02:06:07,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:06:07,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:06:07,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:06:07,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:06:07,331 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:06:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:06:07,636 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 02:06:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 127 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:06:08,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:06:08,465 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:06:08,466 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 259 with the following transitions: [2018-10-25 02:06:08,466 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [990], [998], [1006], [1014], [1022], [1030], [1038], [1046], [1054], [1062], [1070], [1078], [1086], [1094], [1102], [1110], [1118], [1126], [1134], [1142], [1150], [1158], [1166], [1174], [1182], [1190], [1194], [1196], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-10-25 02:06:08,471 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:06:08,472 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:06:09,680 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 02:06:09,680 INFO L272 AbstractInterpreter]: Visited 119 different actions 343 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-10-25 02:06:09,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:06:09,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 02:06:09,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:06:09,718 INFO L194 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-25 02:06:09,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:06:09,733 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 02:06:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:06:09,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 02:06:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-25 02:06:09,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 02:06:10,397 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-25 02:06:10,420 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 02:06:10,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2018-10-25 02:06:10,420 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:06:10,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:06:10,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:06:10,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-10-25 02:06:10,422 INFO L87 Difference]: Start difference. First operand 27558 states and 35253 transitions. Second operand 3 states. [2018-10-25 02:06:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:06:14,386 INFO L93 Difference]: Finished difference Result 55110 states and 70654 transitions. [2018-10-25 02:06:14,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:06:14,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2018-10-25 02:06:14,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:06:14,486 INFO L225 Difference]: With dead ends: 55110 [2018-10-25 02:06:14,487 INFO L226 Difference]: Without dead ends: 27558 [2018-10-25 02:06:14,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 516 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-10-25 02:06:14,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27558 states. [2018-10-25 02:06:15,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27558 to 26249. [2018-10-25 02:06:15,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26249 states. [2018-10-25 02:06:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26249 states to 26249 states and 32217 transitions. [2018-10-25 02:06:15,181 INFO L78 Accepts]: Start accepts. Automaton has 26249 states and 32217 transitions. Word has length 258 [2018-10-25 02:06:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:06:15,182 INFO L481 AbstractCegarLoop]: Abstraction has 26249 states and 32217 transitions. [2018-10-25 02:06:15,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:06:15,182 INFO L276 IsEmpty]: Start isEmpty. Operand 26249 states and 32217 transitions. [2018-10-25 02:06:15,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-25 02:06:15,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:06:15,195 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:06:15,195 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:06:15,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:06:15,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1777408073, now seen corresponding path program 1 times [2018-10-25 02:06:15,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:06:15,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:06:15,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:06:15,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:06:15,197 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:06:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:06:15,885 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-25 02:06:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 132 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 02:06:16,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 02:06:16,187 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 02:06:16,187 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 261 with the following transitions: [2018-10-25 02:06:16,188 INFO L202 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [990], [998], [1006], [1014], [1022], [1030], [1038], [1046], [1054], [1062], [1070], [1078], [1086], [1094], [1102], [1110], [1118], [1126], [1134], [1142], [1150], [1158], [1166], [1174], [1182], [1190], [1194], [1196], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1231], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1384], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-10-25 02:06:16,196 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 02:06:16,196 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 02:06:16,385 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 02:06:16,386 INFO L272 AbstractInterpreter]: Visited 115 different actions 115 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-10-25 02:06:16,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:06:16,422 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 02:06:16,951 INFO L232 lantSequenceWeakener]: Weakened 251 states. On average, predicates are now at 75.88% of their original sizes. [2018-10-25 02:06:16,951 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 02:06:17,034 INFO L413 sIntCurrentIteration]: We have 259 unified AI predicates [2018-10-25 02:06:17,034 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 02:06:17,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 02:06:17,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-25 02:06:17,035 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:06:17,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 02:06:17,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 02:06:17,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 02:06:17,037 INFO L87 Difference]: Start difference. First operand 26249 states and 32217 transitions. Second operand 6 states. [2018-10-25 02:06:39,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 02:06:39,827 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger: modulus not positive at java.math.BigInteger.mod(BigInteger.java:2458) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:154) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.explicit.ExplicitValueValue.modulo(ExplicitValueValue.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:100) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:78) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.ConditionalEvaluator.evaluate(ConditionalEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:160) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:142) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:128) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:362) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:353) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:125) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:305) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:537) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:249) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:673) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-25 02:06:39,832 INFO L168 Benchmark]: Toolchain (without parser) took 219238.76 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-25 02:06:39,833 INFO L168 Benchmark]: CDTParser took 0.18 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-25 02:06:39,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1588.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2018-10-25 02:06:39,834 INFO L168 Benchmark]: Boogie Procedure Inliner took 491.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -924.0 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. [2018-10-25 02:06:39,836 INFO L168 Benchmark]: Boogie Preprocessor took 332.58 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 7.1 GB. [2018-10-25 02:06:39,836 INFO L168 Benchmark]: RCFGBuilder took 12874.08 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 457.7 MB). Peak memory consumption was 457.7 MB. Max. memory is 7.1 GB. [2018-10-25 02:06:39,837 INFO L168 Benchmark]: TraceAbstraction took 203945.98 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 1.7 GB in the beginning and 2.7 GB in the end (delta: -1.0 GB). Peak memory consumption was 720.2 MB. Max. memory is 7.1 GB. [2018-10-25 02:06:39,843 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.18 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 1588.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 491.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 772.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -924.0 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 332.58 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 12874.08 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 457.7 MB). Peak memory consumption was 457.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 203945.98 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 1.7 GB in the beginning and 2.7 GB in the end (delta: -1.0 GB). Peak memory consumption was 720.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger: modulus not positive de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger: modulus not positive: java.math.BigInteger.mod(BigInteger.java:2458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...