java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b6335f6 [2018-10-23 10:00:37,986 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 10:00:37,987 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 10:00:37,999 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 10:00:38,000 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 10:00:38,001 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 10:00:38,002 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 10:00:38,004 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 10:00:38,005 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 10:00:38,006 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 10:00:38,007 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 10:00:38,007 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 10:00:38,008 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 10:00:38,009 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 10:00:38,010 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 10:00:38,011 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 10:00:38,012 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 10:00:38,014 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 10:00:38,016 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 10:00:38,017 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 10:00:38,019 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 10:00:38,020 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 10:00:38,022 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 10:00:38,022 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 10:00:38,023 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 10:00:38,024 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 10:00:38,025 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 10:00:38,026 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 10:00:38,027 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 10:00:38,028 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 10:00:38,028 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 10:00:38,029 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 10:00:38,029 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 10:00:38,029 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 10:00:38,030 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 10:00:38,031 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 10:00:38,031 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-23 10:00:38,062 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 10:00:38,063 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 10:00:38,064 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 10:00:38,067 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-23 10:00:38,067 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-23 10:00:38,067 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-23 10:00:38,067 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-23 10:00:38,068 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-23 10:00:38,068 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-23 10:00:38,068 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-23 10:00:38,068 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-23 10:00:38,068 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-23 10:00:38,069 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 10:00:38,069 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 10:00:38,069 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 10:00:38,069 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 10:00:38,070 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 10:00:38,070 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 10:00:38,070 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 10:00:38,070 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 10:00:38,070 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 10:00:38,071 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 10:00:38,071 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 10:00:38,071 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 10:00:38,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 10:00:38,071 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 10:00:38,072 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 10:00:38,072 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 10:00:38,072 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-23 10:00:38,072 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 10:00:38,072 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 10:00:38,072 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 10:00:38,073 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 10:00:38,073 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-23 10:00:38,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 10:00:38,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 10:00:38,139 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 10:00:38,141 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 10:00:38,141 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 10:00:38,142 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-10-23 10:00:38,212 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/677f0b5ac/f3a897f269934124a46087e197233572/FLAG2c200eade [2018-10-23 10:00:38,652 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 10:00:38,653 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-10-23 10:00:38,661 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/677f0b5ac/f3a897f269934124a46087e197233572/FLAG2c200eade [2018-10-23 10:00:38,676 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/677f0b5ac/f3a897f269934124a46087e197233572 [2018-10-23 10:00:38,687 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 10:00:38,689 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 10:00:38,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 10:00:38,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 10:00:38,695 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 10:00:38,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:00:38" (1/1) ... [2018-10-23 10:00:38,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee9ef4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:38, skipping insertion in model container [2018-10-23 10:00:38,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:00:38" (1/1) ... [2018-10-23 10:00:38,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 10:00:38,738 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 10:00:38,940 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 10:00:38,944 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 10:00:38,978 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 10:00:39,000 INFO L193 MainTranslator]: Completed translation [2018-10-23 10:00:39,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:39 WrapperNode [2018-10-23 10:00:39,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 10:00:39,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 10:00:39,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 10:00:39,002 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 10:00:39,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:39" (1/1) ... [2018-10-23 10:00:39,023 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:39" (1/1) ... [2018-10-23 10:00:39,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 10:00:39,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 10:00:39,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 10:00:39,065 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 10:00:39,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:39" (1/1) ... [2018-10-23 10:00:39,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:39" (1/1) ... [2018-10-23 10:00:39,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:39" (1/1) ... [2018-10-23 10:00:39,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:39" (1/1) ... [2018-10-23 10:00:39,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:39" (1/1) ... [2018-10-23 10:00:39,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:39" (1/1) ... [2018-10-23 10:00:39,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:39" (1/1) ... [2018-10-23 10:00:39,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 10:00:39,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 10:00:39,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 10:00:39,116 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 10:00:39,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:39" (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-23 10:00:39,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-23 10:00:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-23 10:00:39,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 10:00:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 10:00:39,250 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-23 10:00:39,250 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-23 10:00:39,848 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 10:00:39,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:00:39 BoogieIcfgContainer [2018-10-23 10:00:39,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 10:00:39,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 10:00:39,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 10:00:39,853 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 10:00:39,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 10:00:38" (1/3) ... [2018-10-23 10:00:39,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c86d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:00:39, skipping insertion in model container [2018-10-23 10:00:39,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:39" (2/3) ... [2018-10-23 10:00:39,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c86d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:00:39, skipping insertion in model container [2018-10-23 10:00:39,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:00:39" (3/3) ... [2018-10-23 10:00:39,857 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+lhb-reducer.c [2018-10-23 10:00:39,867 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 10:00:39,875 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-10-23 10:00:39,893 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-10-23 10:00:39,928 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 10:00:39,929 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 10:00:39,929 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 10:00:39,929 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 10:00:39,929 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 10:00:39,929 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 10:00:39,929 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 10:00:39,929 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 10:00:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-10-23 10:00:39,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-23 10:00:39,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:00:39,959 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:00:39,962 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:00:39,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:00:39,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1494900034, now seen corresponding path program 1 times [2018-10-23 10:00:39,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:00:40,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:40,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:00:40,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:40,030 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:00:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:00:40,192 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-23 10:00:40,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:00:40,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 10:00:40,194 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:00:40,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 10:00:40,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 10:00:40,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 10:00:40,215 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-10-23 10:00:40,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:00:40,311 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2018-10-23 10:00:40,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 10:00:40,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-23 10:00:40,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:00:40,329 INFO L225 Difference]: With dead ends: 56 [2018-10-23 10:00:40,329 INFO L226 Difference]: Without dead ends: 34 [2018-10-23 10:00:40,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 10:00:40,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-23 10:00:40,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-10-23 10:00:40,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-23 10:00:40,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-10-23 10:00:40,386 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2018-10-23 10:00:40,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:00:40,387 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-10-23 10:00:40,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 10:00:40,387 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-10-23 10:00:40,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-23 10:00:40,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:00:40,390 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:00:40,390 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:00:40,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:00:40,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1256853917, now seen corresponding path program 1 times [2018-10-23 10:00:40,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:00:40,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:40,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:00:40,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:40,394 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:00:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:00:40,581 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-23 10:00:40,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:00:40,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 10:00:40,582 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:00:40,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 10:00:40,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 10:00:40,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-23 10:00:40,586 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2018-10-23 10:00:40,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:00:40,758 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-10-23 10:00:40,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 10:00:40,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-10-23 10:00:40,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:00:40,761 INFO L225 Difference]: With dead ends: 53 [2018-10-23 10:00:40,761 INFO L226 Difference]: Without dead ends: 51 [2018-10-23 10:00:40,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-23 10:00:40,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-23 10:00:40,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-10-23 10:00:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-23 10:00:40,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-10-23 10:00:40,769 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2018-10-23 10:00:40,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:00:40,770 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-10-23 10:00:40,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 10:00:40,770 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-10-23 10:00:40,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-23 10:00:40,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:00:40,771 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:00:40,771 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:00:40,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:00:40,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1192177656, now seen corresponding path program 1 times [2018-10-23 10:00:40,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:00:40,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:40,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:00:40,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:40,774 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:00:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:00:40,860 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-23 10:00:40,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:00:40,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 10:00:40,861 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:00:40,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 10:00:40,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 10:00:40,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 10:00:40,863 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 3 states. [2018-10-23 10:00:40,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:00:40,934 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-10-23 10:00:40,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 10:00:40,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-23 10:00:40,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:00:40,937 INFO L225 Difference]: With dead ends: 62 [2018-10-23 10:00:40,937 INFO L226 Difference]: Without dead ends: 41 [2018-10-23 10:00:40,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 10:00:40,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-23 10:00:40,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2018-10-23 10:00:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-23 10:00:40,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-10-23 10:00:40,947 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2018-10-23 10:00:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:00:40,949 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-10-23 10:00:40,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 10:00:40,950 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-10-23 10:00:40,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-23 10:00:40,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:00:40,950 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:00:40,953 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:00:40,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:00:40,953 INFO L82 PathProgramCache]: Analyzing trace with hash -249616619, now seen corresponding path program 1 times [2018-10-23 10:00:40,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:00:40,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:40,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:00:40,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:40,955 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:00:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:00:41,066 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-23 10:00:41,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:00:41,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 10:00:41,067 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:00:41,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 10:00:41,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 10:00:41,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 10:00:41,068 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 3 states. [2018-10-23 10:00:41,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:00:41,232 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-10-23 10:00:41,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 10:00:41,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-23 10:00:41,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:00:41,234 INFO L225 Difference]: With dead ends: 56 [2018-10-23 10:00:41,234 INFO L226 Difference]: Without dead ends: 35 [2018-10-23 10:00:41,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 10:00:41,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-23 10:00:41,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-10-23 10:00:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-23 10:00:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-10-23 10:00:41,247 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 15 [2018-10-23 10:00:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:00:41,248 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-10-23 10:00:41,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 10:00:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-10-23 10:00:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-23 10:00:41,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:00:41,249 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:00:41,250 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:00:41,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:00:41,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1739668830, now seen corresponding path program 1 times [2018-10-23 10:00:41,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:00:41,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:41,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:00:41,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:41,252 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:00:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:00:41,863 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-10-23 10:00:42,076 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-10-23 10:00:42,424 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-23 10:00:42,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:00:42,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-23 10:00:42,425 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:00:42,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-23 10:00:42,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-23 10:00:42,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-10-23 10:00:42,426 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 10 states. [2018-10-23 10:00:45,297 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 23 [2018-10-23 10:00:59,304 WARN L179 SmtUtils]: Spent 11.53 s on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2018-10-23 10:01:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:01:01,435 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-10-23 10:01:01,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-23 10:01:01,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-10-23 10:01:01,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:01:01,437 INFO L225 Difference]: With dead ends: 48 [2018-10-23 10:01:01,437 INFO L226 Difference]: Without dead ends: 32 [2018-10-23 10:01:01,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-10-23 10:01:01,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-23 10:01:01,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-10-23 10:01:01,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-23 10:01:01,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-10-23 10:01:01,447 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2018-10-23 10:01:01,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:01:01,448 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-10-23 10:01:01,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-23 10:01:01,448 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-10-23 10:01:01,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-23 10:01:01,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:01:01,449 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] [2018-10-23 10:01:01,450 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:01:01,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:01:01,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1253973443, now seen corresponding path program 1 times [2018-10-23 10:01:01,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:01:01,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:01:01,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:01:01,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:01:01,452 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:01:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:01:01,821 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-23 10:01:01,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:01:01,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-23 10:01:01,822 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:01:01,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 10:01:01,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 10:01:01,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-23 10:01:01,824 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2018-10-23 10:01:02,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:01:02,084 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-10-23 10:01:02,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 10:01:02,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-10-23 10:01:02,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:01:02,085 INFO L225 Difference]: With dead ends: 44 [2018-10-23 10:01:02,086 INFO L226 Difference]: Without dead ends: 42 [2018-10-23 10:01:02,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-10-23 10:01:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-23 10:01:02,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28. [2018-10-23 10:01:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-23 10:01:02,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-10-23 10:01:02,093 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2018-10-23 10:01:02,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:01:02,093 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-10-23 10:01:02,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 10:01:02,093 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-10-23 10:01:02,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-23 10:01:02,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:01:02,094 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:01:02,095 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:01:02,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:01:02,095 INFO L82 PathProgramCache]: Analyzing trace with hash 899200671, now seen corresponding path program 1 times [2018-10-23 10:01:02,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:01:02,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:01:02,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:01:02,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:01:02,097 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:01:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:01:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:01:04,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:01:04,354 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-23 10:01:04,355 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-10-23 10:01:04,357 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [14], [17], [20], [22], [28], [30], [33], [58], [61], [65], [68], [69], [71], [73], [106], [107], [108] [2018-10-23 10:01:04,414 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-23 10:01:04,415 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-23 10:01:04,648 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-23 10:01:07,497 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-23 10:01:07,498 INFO L272 AbstractInterpreter]: Visited 22 different actions 87 times. Merged at 5 different actions 65 times. Widened at 2 different actions 18 times. Found 1 fixpoints after 1 different actions. Largest state had 45 variables. [2018-10-23 10:01:07,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:01:07,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-23 10:01:07,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:01:07,552 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-23 10:01:07,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:01:07,568 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-23 10:01:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:01:07,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 10:01:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:01:09,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-23 10:01:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:01:11,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-23 10:01:11,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2018-10-23 10:01:11,646 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-23 10:01:11,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 10:01:11,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 10:01:11,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=49, Unknown=1, NotChecked=0, Total=72 [2018-10-23 10:01:11,647 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2018-10-23 10:01:14,328 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2018-10-23 10:01:16,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:01:16,997 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-10-23 10:01:16,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 10:01:16,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-10-23 10:01:16,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:01:16,999 INFO L225 Difference]: With dead ends: 41 [2018-10-23 10:01:16,999 INFO L226 Difference]: Without dead ends: 31 [2018-10-23 10:01:16,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=28, Invalid=61, Unknown=1, NotChecked=0, Total=90 [2018-10-23 10:01:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-23 10:01:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-23 10:01:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-23 10:01:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-10-23 10:01:17,005 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23 [2018-10-23 10:01:17,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:01:17,006 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-10-23 10:01:17,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 10:01:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-10-23 10:01:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-23 10:01:17,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:01:17,007 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-23 10:01:17,007 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:01:17,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:01:17,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1779426667, now seen corresponding path program 1 times [2018-10-23 10:01:17,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:01:17,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:01:17,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:01:17,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:01:17,009 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:01:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:01:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:01:34,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:01:34,083 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-23 10:01:34,083 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-10-23 10:01:34,083 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [14], [17], [20], [22], [28], [30], [33], [36], [39], [42], [44], [50], [58], [61], [65], [68], [69], [71], [73], [106], [107], [108] [2018-10-23 10:01:34,086 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-23 10:01:34,086 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-23 10:01:34,112 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-23 10:01:36,971 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-23 10:01:36,971 INFO L272 AbstractInterpreter]: Visited 27 different actions 94 times. Merged at 7 different actions 67 times. Widened at 2 different actions 18 times. Found 2 fixpoints after 2 different actions. Largest state had 48 variables. [2018-10-23 10:01:36,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:01:36,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-23 10:01:36,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:01:36,978 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-23 10:01:36,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:01:36,986 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-23 10:01:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:01:37,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 10:01:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:01:39,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-23 10:01:42,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:01:42,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-23 10:01:42,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 12 [2018-10-23 10:01:42,345 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-23 10:01:42,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-23 10:01:42,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-23 10:01:42,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=87, Unknown=10, NotChecked=0, Total=132 [2018-10-23 10:01:42,346 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 10 states. [2018-10-23 10:02:02,019 WARN L179 SmtUtils]: Spent 6.08 s on a formula simplification. DAG size of input: 43 DAG size of output: 24 [2018-10-23 10:02:11,367 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2018-10-23 10:02:42,946 WARN L179 SmtUtils]: Spent 21.01 s on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2018-10-23 10:03:17,708 WARN L179 SmtUtils]: Spent 17.73 s on a formula simplification that was a NOOP. DAG size: 42 [2018-10-23 10:03:21,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:03:21,763 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-10-23 10:03:21,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-23 10:03:21,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-10-23 10:03:21,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:03:21,844 INFO L225 Difference]: With dead ends: 35 [2018-10-23 10:03:21,844 INFO L226 Difference]: Without dead ends: 0 [2018-10-23 10:03:21,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 96.7s TimeCoverageRelationStatistics Valid=136, Invalid=266, Unknown=18, NotChecked=0, Total=420 [2018-10-23 10:03:21,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-23 10:03:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-23 10:03:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-23 10:03:21,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-23 10:03:21,845 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-10-23 10:03:21,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:03:21,846 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-23 10:03:21,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-23 10:03:21,846 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-23 10:03:21,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-23 10:03:21,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-23 10:03:40,838 WARN L179 SmtUtils]: Spent 18.90 s on a formula simplification that was a NOOP. DAG size: 46 Received shutdown request... [2018-10-23 10:05:25,620 WARN L187 SmtUtils]: Removed 3 from assertion stack [2018-10-23 10:05:25,620 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-10-23 10:05:25,621 INFO L168 Benchmark]: Toolchain (without parser) took 286933.77 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 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 414.2 MB. Max. memory is 7.1 GB. [2018-10-23 10:05:25,622 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-10-23 10:05:25,623 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-23 10:05:25,624 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 10:05:25,624 INFO L168 Benchmark]: Boogie Preprocessor took 47.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 10:05:25,625 INFO L168 Benchmark]: RCFGBuilder took 733.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -782.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2018-10-23 10:05:25,626 INFO L168 Benchmark]: TraceAbstraction took 285770.83 ms. Allocated memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: 727.7 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -295.6 MB). Peak memory consumption was 432.1 MB. Max. memory is 7.1 GB. [2018-10-23 10:05:25,635 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 310.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 733.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 754.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -782.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 285770.83 ms. Allocated memory was 2.3 GB in the beginning and 3.0 GB in the end (delta: 727.7 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -295.6 MB). Peak memory consumption was 432.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 104]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 107. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown