java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label13_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 16:47:27,719 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 16:47:27,724 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 16:47:27,740 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 16:47:27,741 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 16:47:27,742 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 16:47:27,743 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 16:47:27,745 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 16:47:27,747 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 16:47:27,748 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 16:47:27,749 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 16:47:27,749 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 16:47:27,750 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 16:47:27,751 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 16:47:27,752 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 16:47:27,753 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 16:47:27,754 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 16:47:27,756 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 16:47:27,758 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 16:47:27,760 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 16:47:27,761 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 16:47:27,762 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 16:47:27,765 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 16:47:27,765 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 16:47:27,765 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 16:47:27,766 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 16:47:27,767 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 16:47:27,768 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 16:47:27,769 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 16:47:27,773 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 16:47:27,774 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 16:47:27,774 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 16:47:27,775 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 16:47:27,775 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 16:47:27,776 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 16:47:27,777 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 16:47:27,777 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 16:47:27,803 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 16:47:27,803 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 16:47:27,805 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 16:47:27,805 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 16:47:27,805 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 16:47:27,805 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 16:47:27,806 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 16:47:27,806 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 16:47:27,806 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 16:47:27,806 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 16:47:27,806 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 16:47:27,807 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 16:47:27,807 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 16:47:27,808 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 16:47:27,808 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 16:47:27,808 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 16:47:27,808 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 16:47:27,809 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 16:47:27,809 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 16:47:27,810 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 16:47:27,810 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 16:47:27,810 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 16:47:27,810 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 16:47:27,810 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 16:47:27,811 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 16:47:27,811 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 16:47:27,811 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 16:47:27,811 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 16:47:27,811 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 16:47:27,811 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 16:47:27,812 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 16:47:27,812 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 16:47:27,812 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 16:47:27,812 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 16:47:27,812 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 16:47:27,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 16:47:27,896 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 16:47:27,901 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 16:47:27,903 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 16:47:27,903 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 16:47:27,904 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label13_false-unreach-call.c [2018-11-12 16:47:27,974 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dda19b0c/2f799adf2bdf43098f08351b256fe724/FLAG7028c8a82 [2018-11-12 16:47:28,736 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 16:47:28,738 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label13_false-unreach-call.c [2018-11-12 16:47:28,766 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dda19b0c/2f799adf2bdf43098f08351b256fe724/FLAG7028c8a82 [2018-11-12 16:47:28,783 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dda19b0c/2f799adf2bdf43098f08351b256fe724 [2018-11-12 16:47:28,795 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 16:47:28,797 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 16:47:28,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 16:47:28,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 16:47:28,802 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 16:47:28,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:47:28" (1/1) ... [2018-11-12 16:47:28,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b9ae0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:28, skipping insertion in model container [2018-11-12 16:47:28,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:47:28" (1/1) ... [2018-11-12 16:47:28,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 16:47:28,935 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 16:47:30,059 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 16:47:30,065 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 16:47:30,459 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 16:47:30,484 INFO L193 MainTranslator]: Completed translation [2018-11-12 16:47:30,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:30 WrapperNode [2018-11-12 16:47:30,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 16:47:30,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 16:47:30,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 16:47:30,487 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 16:47:30,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:30" (1/1) ... [2018-11-12 16:47:30,738 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:30" (1/1) ... [2018-11-12 16:47:30,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 16:47:30,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 16:47:30,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 16:47:30,748 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 16:47:30,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:30" (1/1) ... [2018-11-12 16:47:30,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:30" (1/1) ... [2018-11-12 16:47:30,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:30" (1/1) ... [2018-11-12 16:47:30,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:30" (1/1) ... [2018-11-12 16:47:30,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:30" (1/1) ... [2018-11-12 16:47:30,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:30" (1/1) ... [2018-11-12 16:47:30,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:30" (1/1) ... [2018-11-12 16:47:31,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 16:47:31,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 16:47:31,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 16:47:31,009 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 16:47:31,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 16:47:31,087 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-12 16:47:31,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 16:47:31,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 16:47:31,088 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-12 16:47:31,088 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-12 16:47:31,088 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-12 16:47:31,088 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-12 16:47:31,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 16:47:31,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 16:47:31,089 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 16:47:31,089 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 16:47:39,026 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 16:47:39,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:47:39 BoogieIcfgContainer [2018-11-12 16:47:39,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 16:47:39,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 16:47:39,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 16:47:39,031 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 16:47:39,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:47:28" (1/3) ... [2018-11-12 16:47:39,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240e1d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:47:39, skipping insertion in model container [2018-11-12 16:47:39,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:30" (2/3) ... [2018-11-12 16:47:39,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240e1d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:47:39, skipping insertion in model container [2018-11-12 16:47:39,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:47:39" (3/3) ... [2018-11-12 16:47:39,035 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label13_false-unreach-call.c [2018-11-12 16:47:39,045 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 16:47:39,055 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 16:47:39,072 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 16:47:39,116 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 16:47:39,117 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 16:47:39,117 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 16:47:39,117 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 16:47:39,117 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 16:47:39,117 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 16:47:39,118 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 16:47:39,118 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 16:47:39,154 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-11-12 16:47:39,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-12 16:47:39,162 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:47:39,164 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] [2018-11-12 16:47:39,166 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:47:39,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:47:39,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1178650194, now seen corresponding path program 1 times [2018-11-12 16:47:39,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:47:39,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:47:39,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:47:39,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:47:39,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:47:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:47:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:47:39,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:47:39,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 16:47:39,711 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:47:39,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 16:47:39,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 16:47:39,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 16:47:39,736 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 4 states. [2018-11-12 16:47:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:47:51,114 INFO L93 Difference]: Finished difference Result 2166 states and 4013 transitions. [2018-11-12 16:47:51,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 16:47:51,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-12 16:47:51,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:47:51,167 INFO L225 Difference]: With dead ends: 2166 [2018-11-12 16:47:51,167 INFO L226 Difference]: Without dead ends: 1556 [2018-11-12 16:47:51,178 INFO L604 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-11-12 16:47:51,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2018-11-12 16:47:51,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1068. [2018-11-12 16:47:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2018-11-12 16:47:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1850 transitions. [2018-11-12 16:47:51,307 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1850 transitions. Word has length 37 [2018-11-12 16:47:51,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:47:51,308 INFO L480 AbstractCegarLoop]: Abstraction has 1068 states and 1850 transitions. [2018-11-12 16:47:51,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 16:47:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1850 transitions. [2018-11-12 16:47:51,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-12 16:47:51,320 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:47:51,320 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:47:51,320 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:47:51,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:47:51,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1514580025, now seen corresponding path program 1 times [2018-11-12 16:47:51,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:47:51,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:47:51,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:47:51,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:47:51,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:47:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:47:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:47:51,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:47:51,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 16:47:51,854 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:47:51,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 16:47:51,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 16:47:51,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 16:47:51,859 INFO L87 Difference]: Start difference. First operand 1068 states and 1850 transitions. Second operand 6 states. [2018-11-12 16:47:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:47:58,921 INFO L93 Difference]: Finished difference Result 3059 states and 5419 transitions. [2018-11-12 16:47:58,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 16:47:58,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-11-12 16:47:58,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:47:58,949 INFO L225 Difference]: With dead ends: 3059 [2018-11-12 16:47:58,950 INFO L226 Difference]: Without dead ends: 1997 [2018-11-12 16:47:58,954 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 16:47:58,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2018-11-12 16:47:59,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1975. [2018-11-12 16:47:59,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2018-11-12 16:47:59,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 3181 transitions. [2018-11-12 16:47:59,043 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 3181 transitions. Word has length 113 [2018-11-12 16:47:59,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:47:59,045 INFO L480 AbstractCegarLoop]: Abstraction has 1975 states and 3181 transitions. [2018-11-12 16:47:59,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 16:47:59,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 3181 transitions. [2018-11-12 16:47:59,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-12 16:47:59,049 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:47:59,050 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:47:59,050 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:47:59,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:47:59,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1724480335, now seen corresponding path program 1 times [2018-11-12 16:47:59,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:47:59,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:47:59,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:47:59,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:47:59,052 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:47:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:47:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:47:59,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:47:59,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-12 16:47:59,304 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:47:59,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 16:47:59,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 16:47:59,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 16:47:59,305 INFO L87 Difference]: Start difference. First operand 1975 states and 3181 transitions. Second operand 6 states. [2018-11-12 16:48:05,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:48:05,151 INFO L93 Difference]: Finished difference Result 4880 states and 7834 transitions. [2018-11-12 16:48:05,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 16:48:05,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2018-11-12 16:48:05,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:48:05,172 INFO L225 Difference]: With dead ends: 4880 [2018-11-12 16:48:05,173 INFO L226 Difference]: Without dead ends: 2911 [2018-11-12 16:48:05,182 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-12 16:48:05,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2018-11-12 16:48:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2880. [2018-11-12 16:48:05,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2018-11-12 16:48:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3936 transitions. [2018-11-12 16:48:05,262 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3936 transitions. Word has length 117 [2018-11-12 16:48:05,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:48:05,262 INFO L480 AbstractCegarLoop]: Abstraction has 2880 states and 3936 transitions. [2018-11-12 16:48:05,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 16:48:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3936 transitions. [2018-11-12 16:48:05,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-12 16:48:05,266 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:48:05,266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:48:05,266 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:48:05,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:48:05,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1253038034, now seen corresponding path program 1 times [2018-11-12 16:48:05,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:48:05,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:48:05,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:48:05,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:48:05,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:48:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:48:05,542 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 16:48:05,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:48:05,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 16:48:05,543 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:48:05,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 16:48:05,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 16:48:05,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 16:48:05,545 INFO L87 Difference]: Start difference. First operand 2880 states and 3936 transitions. Second operand 4 states. [2018-11-12 16:48:10,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:48:10,686 INFO L93 Difference]: Finished difference Result 5754 states and 7882 transitions. [2018-11-12 16:48:10,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 16:48:10,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2018-11-12 16:48:10,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:48:10,700 INFO L225 Difference]: With dead ends: 5754 [2018-11-12 16:48:10,701 INFO L226 Difference]: Without dead ends: 2880 [2018-11-12 16:48:10,712 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-12 16:48:10,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2018-11-12 16:48:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2880. [2018-11-12 16:48:10,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2018-11-12 16:48:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3720 transitions. [2018-11-12 16:48:10,789 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3720 transitions. Word has length 147 [2018-11-12 16:48:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:48:10,789 INFO L480 AbstractCegarLoop]: Abstraction has 2880 states and 3720 transitions. [2018-11-12 16:48:10,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 16:48:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3720 transitions. [2018-11-12 16:48:10,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-12 16:48:10,794 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:48:10,794 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-12 16:48:10,795 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:48:10,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:48:10,795 INFO L82 PathProgramCache]: Analyzing trace with hash 535521912, now seen corresponding path program 1 times [2018-11-12 16:48:10,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:48:10,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:48:10,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:48:10,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:48:10,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:48:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:48:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-12 16:48:11,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 16:48:11,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 16:48:11,069 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:48:11,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 16:48:11,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 16:48:11,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-12 16:48:11,070 INFO L87 Difference]: Start difference. First operand 2880 states and 3720 transitions. Second operand 4 states. [2018-11-12 16:48:19,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:48:19,666 INFO L93 Difference]: Finished difference Result 11062 states and 14732 transitions. [2018-11-12 16:48:19,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 16:48:19,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-11-12 16:48:19,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:48:19,702 INFO L225 Difference]: With dead ends: 11062 [2018-11-12 16:48:19,702 INFO L226 Difference]: Without dead ends: 8188 [2018-11-12 16:48:19,713 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-12 16:48:19,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8188 states. [2018-11-12 16:48:19,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8188 to 8188. [2018-11-12 16:48:19,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8188 states. [2018-11-12 16:48:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8188 states to 8188 states and 10116 transitions. [2018-11-12 16:48:19,909 INFO L78 Accepts]: Start accepts. Automaton has 8188 states and 10116 transitions. Word has length 201 [2018-11-12 16:48:19,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:48:19,910 INFO L480 AbstractCegarLoop]: Abstraction has 8188 states and 10116 transitions. [2018-11-12 16:48:19,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 16:48:19,910 INFO L276 IsEmpty]: Start isEmpty. Operand 8188 states and 10116 transitions. [2018-11-12 16:48:19,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-12 16:48:19,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:48:19,916 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:48:19,916 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:48:19,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:48:19,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1601051847, now seen corresponding path program 1 times [2018-11-12 16:48:19,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:48:19,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:48:19,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:48:19,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:48:19,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:48:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:48:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 60 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 16:48:20,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:48:20,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:48:20,474 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-11-12 16:48:20,477 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], [906], [908], [911], [919], [927], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [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-11-12 16:48:20,526 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:48:20,526 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:48:21,216 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:48:21,225 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 16:48:21,228 INFO L272 AbstractInterpreter]: Visited 115 different actions 115 times. Never merged. Never widened. Performed 1254 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1254 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 26 variables. [2018-11-12 16:48:21,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:48:21,271 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 16:48:21,844 INFO L227 lantSequenceWeakener]: Weakened 215 states. On average, predicates are now at 75.29% of their original sizes. [2018-11-12 16:48:21,845 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 16:48:22,147 INFO L415 sIntCurrentIteration]: We unified 223 AI predicates to 223 [2018-11-12 16:48:22,147 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 16:48:22,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 16:48:22,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 12 [2018-11-12 16:48:22,148 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 16:48:22,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 16:48:22,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 16:48:22,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-12 16:48:22,150 INFO L87 Difference]: Start difference. First operand 8188 states and 10116 transitions. Second operand 8 states. [2018-11-12 16:49:05,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:49:05,899 INFO L93 Difference]: Finished difference Result 16806 states and 20694 transitions. [2018-11-12 16:49:05,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 16:49:05,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 224 [2018-11-12 16:49:05,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:49:05,932 INFO L225 Difference]: With dead ends: 16806 [2018-11-12 16:49:05,933 INFO L226 Difference]: Without dead ends: 8624 [2018-11-12 16:49:05,951 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 225 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-12 16:49:05,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8624 states. [2018-11-12 16:49:06,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8624 to 8622. [2018-11-12 16:49:06,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8622 states. [2018-11-12 16:49:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8622 states to 8622 states and 10561 transitions. [2018-11-12 16:49:06,126 INFO L78 Accepts]: Start accepts. Automaton has 8622 states and 10561 transitions. Word has length 224 [2018-11-12 16:49:06,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:49:06,127 INFO L480 AbstractCegarLoop]: Abstraction has 8622 states and 10561 transitions. [2018-11-12 16:49:06,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 16:49:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 8622 states and 10561 transitions. [2018-11-12 16:49:06,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-11-12 16:49:06,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:49:06,136 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:49:06,136 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:49:06,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:49:06,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1873400049, now seen corresponding path program 1 times [2018-11-12 16:49:06,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:49:06,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:49:06,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:49:06,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:49:06,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:49:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:49:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 100 proven. 142 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-12 16:49:06,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:49:06,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:49:06,714 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 277 with the following transitions: [2018-11-12 16:49:06,714 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], [906], [908], [911], [919], [927], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [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-11-12 16:49:06,719 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:49:06,720 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:49:06,796 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:49:08,108 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:49:08,109 INFO L272 AbstractInterpreter]: Visited 98 different actions 581 times. Merged at 8 different actions 49 times. Widened at 1 different actions 1 times. Performed 12318 root evaluator evaluations with a maximum evaluation depth of 6. Performed 12318 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 11 fixpoints after 2 different actions. Largest state had 26 variables. [2018-11-12 16:49:08,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:49:08,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:49:08,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:49:08,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 16:49:08,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:49:08,170 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:49:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:49:08,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:49:08,622 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 17 [2018-11-12 16:49:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 214 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-12 16:49:09,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:49:09,494 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-12 16:49:09,620 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-12 16:49:09,911 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 15 [2018-11-12 16:49:10,562 WARN L179 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2018-11-12 16:49:11,172 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 100 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-12 16:49:11,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:49:11,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 16 [2018-11-12 16:49:11,202 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:49:11,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 16:49:11,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 16:49:11,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-11-12 16:49:11,204 INFO L87 Difference]: Start difference. First operand 8622 states and 10561 transitions. Second operand 10 states. [2018-11-12 16:49:31,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:49:31,942 INFO L93 Difference]: Finished difference Result 30891 states and 39608 transitions. [2018-11-12 16:49:31,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 16:49:31,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 276 [2018-11-12 16:49:31,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:49:32,029 INFO L225 Difference]: With dead ends: 30891 [2018-11-12 16:49:32,030 INFO L226 Difference]: Without dead ends: 22709 [2018-11-12 16:49:32,067 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 551 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2018-11-12 16:49:32,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22709 states. [2018-11-12 16:49:32,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22709 to 22634. [2018-11-12 16:49:32,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22634 states. [2018-11-12 16:49:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22634 states to 22634 states and 28388 transitions. [2018-11-12 16:49:32,593 INFO L78 Accepts]: Start accepts. Automaton has 22634 states and 28388 transitions. Word has length 276 [2018-11-12 16:49:32,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:49:32,594 INFO L480 AbstractCegarLoop]: Abstraction has 22634 states and 28388 transitions. [2018-11-12 16:49:32,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 16:49:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 22634 states and 28388 transitions. [2018-11-12 16:49:32,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-11-12 16:49:32,602 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:49:32,603 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:49:32,603 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:49:32,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:49:32,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1917240338, now seen corresponding path program 1 times [2018-11-12 16:49:32,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:49:32,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:49:32,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:49:32,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:49:32,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:49:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:49:33,110 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-11-12 16:49:33,582 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2018-11-12 16:49:34,001 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-12 16:49:34,277 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-12 16:49:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 96 proven. 214 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 16:49:34,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:49:34,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:49:34,521 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 300 with the following transitions: [2018-11-12 16:49:34,521 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], [906], [908], [911], [919], [927], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [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-11-12 16:49:34,525 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:49:34,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:49:34,603 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:49:34,957 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:49:34,958 INFO L272 AbstractInterpreter]: Visited 120 different actions 346 times. Merged at 5 different actions 9 times. Never widened. Performed 7123 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7123 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-11-12 16:49:34,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:49:34,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:49:34,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:49:34,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-12 16:49:34,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:49:34,972 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:49:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:49:35,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:49:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 284 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-12 16:49:35,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:49:35,483 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-11-12 16:49:36,066 WARN L179 SmtUtils]: Spent 582.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-12 16:49:36,523 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 168 proven. 76 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-12 16:49:36,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:49:36,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2018-11-12 16:49:36,544 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:49:36,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 16:49:36,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 16:49:36,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-12 16:49:36,546 INFO L87 Difference]: Start difference. First operand 22634 states and 28388 transitions. Second operand 12 states. [2018-11-12 16:49:54,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 16:49:54,686 INFO L93 Difference]: Finished difference Result 51738 states and 66151 transitions. [2018-11-12 16:49:54,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-12 16:49:54,687 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 299 [2018-11-12 16:49:54,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 16:49:54,794 INFO L225 Difference]: With dead ends: 51738 [2018-11-12 16:49:54,794 INFO L226 Difference]: Without dead ends: 27718 [2018-11-12 16:49:54,847 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 649 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1456 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=789, Invalid=3767, Unknown=0, NotChecked=0, Total=4556 [2018-11-12 16:49:54,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27718 states. [2018-11-12 16:49:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27718 to 25690. [2018-11-12 16:49:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25690 states. [2018-11-12 16:49:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25690 states to 25690 states and 31162 transitions. [2018-11-12 16:49:55,437 INFO L78 Accepts]: Start accepts. Automaton has 25690 states and 31162 transitions. Word has length 299 [2018-11-12 16:49:55,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 16:49:55,440 INFO L480 AbstractCegarLoop]: Abstraction has 25690 states and 31162 transitions. [2018-11-12 16:49:55,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 16:49:55,440 INFO L276 IsEmpty]: Start isEmpty. Operand 25690 states and 31162 transitions. [2018-11-12 16:49:55,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-11-12 16:49:55,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 16:49:55,449 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 16:49:55,449 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 16:49:55,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:49:55,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1344546879, now seen corresponding path program 1 times [2018-11-12 16:49:55,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 16:49:55,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:49:55,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:49:55,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 16:49:55,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 16:49:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:49:56,159 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-12 16:49:56,364 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-12 16:49:56,675 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 7 [2018-11-12 16:49:56,922 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 92 proven. 124 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-12 16:49:56,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:49:56,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 16:49:56,923 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 317 with the following transitions: [2018-11-12 16:49:56,923 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], [906], [908], [911], [919], [927], [935], [943], [951], [959], [967], [975], [983], [991], [999], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1278], [1279], [1282], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1360], [2279], [2283], [2287], [2293], [2297], [2299], [2306], [2307], [2308], [2310], [2311] [2018-11-12 16:49:56,927 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 16:49:56,927 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 16:49:56,975 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 16:49:58,100 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 16:49:58,101 INFO L272 AbstractInterpreter]: Visited 114 different actions 676 times. Merged at 8 different actions 49 times. Widened at 1 different actions 1 times. Performed 12725 root evaluator evaluations with a maximum evaluation depth of 6. Performed 12725 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 11 fixpoints after 2 different actions. Largest state had 26 variables. [2018-11-12 16:49:58,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 16:49:58,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 16:49:58,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 16:49:58,108 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-12 16:49:58,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 16:49:58,117 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 16:49:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 16:49:58,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 16:50:02,776 WARN L179 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2018-11-12 16:50:11,648 WARN L179 SmtUtils]: Spent 6.76 s on a formula simplification. DAG size of input: 85 DAG size of output: 38 [2018-11-12 16:50:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 4 proven. 320 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-12 16:50:11,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 16:50:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 235 proven. 33 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-12 16:50:12,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 16:50:12,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 6] total 24 [2018-11-12 16:50:12,542 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 16:50:12,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 16:50:12,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 16:50:12,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=473, Unknown=2, NotChecked=0, Total=552 [2018-11-12 16:50:12,544 INFO L87 Difference]: Start difference. First operand 25690 states and 31162 transitions. Second operand 20 states. Received shutdown request... [2018-11-12 16:51:17,360 WARN L187 SmtUtils]: Removed 3 from assertion stack [2018-11-12 16:51:17,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 16:51:17,361 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 16:51:17,364 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 16:51:17,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:51:17 BoogieIcfgContainer [2018-11-12 16:51:17,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 16:51:17,366 INFO L168 Benchmark]: Toolchain (without parser) took 228570.23 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2018-11-12 16:51:17,367 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 16:51:17,368 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1687.45 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-11-12 16:51:17,368 INFO L168 Benchmark]: Boogie Procedure Inliner took 260.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 762.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -945.4 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. [2018-11-12 16:51:17,369 INFO L168 Benchmark]: Boogie Preprocessor took 260.22 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2018-11-12 16:51:17,370 INFO L168 Benchmark]: RCFGBuilder took 8018.67 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 454.5 MB). Peak memory consumption was 454.5 MB. Max. memory is 7.1 GB. [2018-11-12 16:51:17,371 INFO L168 Benchmark]: TraceAbstraction took 218337.20 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 1.7 GB in the beginning and 2.5 GB in the end (delta: -733.8 MB). Peak memory consumption was 848.5 MB. Max. memory is 7.1 GB. [2018-11-12 16:51:17,376 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.20 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 1687.45 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 260.77 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 762.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -945.4 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 260.22 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8018.67 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 454.5 MB). Peak memory consumption was 454.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 218337.20 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 1.7 GB in the beginning and 2.5 GB in the end (delta: -733.8 MB). Peak memory consumption was 848.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 98). Cancelled while BasicCegarLoop was constructing difference of abstraction (25690states) and FLOYD_HOARE automaton (currently 7 states, 20 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 81. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 604 locations, 1 error locations. TIMEOUT Result, 218.2s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 186.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3130 SDtfs, 20729 SDslu, 3514 SDs, 0 SdLazy, 35249 SolverSat, 7087 SolverUnsat, 86 SolverUnknown, 0 SolverNotchecked, 132.1s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 2200 GetRequests, 2050 SyntacticMatches, 9 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1698 ImplicationChecksByTransitivity, 22.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25690occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.8s AbstIntTime, 4 AbstIntIterations, 1 AbstIntStrong, 0.9976921190851783 AbsIntWeakeningRatio, 0.1210762331838565 AbsIntAvgWeakeningVarsNumRemoved, 19.269058295964125 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 8 MinimizatonAttempts, 2646 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 23.9s InterpolantComputationTime, 2621 NumberOfCodeBlocks, 2621 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3497 ConstructedInterpolants, 140 QuantifiedInterpolants, 5438929 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1584 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 2122/3318 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown