java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/psyco/psyco_io_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:22:08,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:22:08,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:22:08,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:22:08,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:22:08,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:22:08,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:22:08,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:22:08,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:22:08,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:22:08,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:22:08,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:22:08,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:22:08,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:22:08,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:22:08,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:22:08,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:22:08,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:22:08,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:22:08,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:22:08,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:22:08,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:22:08,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:22:08,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:22:08,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:22:08,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:22:08,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:22:08,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:22:08,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:22:08,136 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:22:08,136 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:22:08,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:22:08,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:22:08,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:22:08,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:22:08,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:22:08,140 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:22:08,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:22:08,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:22:08,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:22:08,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:22:08,143 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:22:08,158 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:22:08,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:22:08,160 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:22:08,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:22:08,160 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:22:08,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:22:08,161 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:22:08,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:22:08,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:22:08,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:22:08,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:22:08,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:22:08,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:22:08,162 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:22:08,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:22:08,162 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:22:08,162 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:22:08,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:22:08,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:22:08,163 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:22:08,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:22:08,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:22:08,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:22:08,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:22:08,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:22:08,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:22:08,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:22:08,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:22:08,165 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:22:08,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:22:08,459 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:22:08,463 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:22:08,465 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:22:08,465 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:22:08,466 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_io_1.c [2019-10-15 01:22:08,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e638095a/286d7d358652456fa0a102d2cf8dc0e3/FLAG0b20d66ab [2019-10-15 01:22:09,102 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:22:09,103 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_io_1.c [2019-10-15 01:22:09,112 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e638095a/286d7d358652456fa0a102d2cf8dc0e3/FLAG0b20d66ab [2019-10-15 01:22:09,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e638095a/286d7d358652456fa0a102d2cf8dc0e3 [2019-10-15 01:22:09,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:22:09,382 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:22:09,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:09,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:22:09,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:22:09,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:09" (1/1) ... [2019-10-15 01:22:09,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d2aae7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09, skipping insertion in model container [2019-10-15 01:22:09,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:22:09" (1/1) ... [2019-10-15 01:22:09,399 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:22:09,446 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:22:09,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:09,759 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:22:09,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:22:09,910 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:22:09,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09 WrapperNode [2019-10-15 01:22:09,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:22:09,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:22:09,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:22:09,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:22:09,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09" (1/1) ... [2019-10-15 01:22:09,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09" (1/1) ... [2019-10-15 01:22:09,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09" (1/1) ... [2019-10-15 01:22:09,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09" (1/1) ... [2019-10-15 01:22:09,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09" (1/1) ... [2019-10-15 01:22:09,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09" (1/1) ... [2019-10-15 01:22:09,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09" (1/1) ... [2019-10-15 01:22:09,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:22:09,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:22:09,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:22:09,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:22:09,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09" (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 [2019-10-15 01:22:10,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:22:10,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:22:10,022 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:22:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:22:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:22:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:22:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:22:10,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:22:10,462 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:22:10,463 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-15 01:22:10,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:10 BoogieIcfgContainer [2019-10-15 01:22:10,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:22:10,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:22:10,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:22:10,468 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:22:10,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:22:09" (1/3) ... [2019-10-15 01:22:10,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0ecaae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:10, skipping insertion in model container [2019-10-15 01:22:10,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:22:09" (2/3) ... [2019-10-15 01:22:10,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0ecaae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:22:10, skipping insertion in model container [2019-10-15 01:22:10,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:22:10" (3/3) ... [2019-10-15 01:22:10,472 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_io_1.c [2019-10-15 01:22:10,481 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:22:10,488 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:22:10,497 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:22:10,521 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:22:10,521 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:22:10,521 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:22:10,521 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:22:10,522 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:22:10,522 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:22:10,522 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:22:10,522 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:22:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2019-10-15 01:22:10,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 01:22:10,550 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:10,551 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:10,552 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:10,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:10,558 INFO L82 PathProgramCache]: Analyzing trace with hash -901605196, now seen corresponding path program 1 times [2019-10-15 01:22:10,567 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:10,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518448192] [2019-10-15 01:22:10,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:10,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:10,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:10,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518448192] [2019-10-15 01:22:10,712 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:10,712 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 01:22:10,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513932249] [2019-10-15 01:22:10,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 01:22:10,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:10,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 01:22:10,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:22:10,737 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 2 states. [2019-10-15 01:22:10,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:10,768 INFO L93 Difference]: Finished difference Result 136 states and 250 transitions. [2019-10-15 01:22:10,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 01:22:10,770 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-15 01:22:10,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:10,782 INFO L225 Difference]: With dead ends: 136 [2019-10-15 01:22:10,782 INFO L226 Difference]: Without dead ends: 61 [2019-10-15 01:22:10,786 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:22:10,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-15 01:22:10,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-10-15 01:22:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-15 01:22:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 91 transitions. [2019-10-15 01:22:10,834 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 91 transitions. Word has length 13 [2019-10-15 01:22:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:10,834 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 91 transitions. [2019-10-15 01:22:10,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 01:22:10,835 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 91 transitions. [2019-10-15 01:22:10,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 01:22:10,836 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:10,836 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:10,836 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:10,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:10,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1647463811, now seen corresponding path program 1 times [2019-10-15 01:22:10,837 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:10,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537266892] [2019-10-15 01:22:10,838 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:10,838 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:10,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:10,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537266892] [2019-10-15 01:22:10,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:10,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:10,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056072035] [2019-10-15 01:22:10,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:10,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:10,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:10,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:10,917 INFO L87 Difference]: Start difference. First operand 61 states and 91 transitions. Second operand 3 states. [2019-10-15 01:22:10,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:10,971 INFO L93 Difference]: Finished difference Result 119 states and 180 transitions. [2019-10-15 01:22:10,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:10,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-15 01:22:10,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:10,974 INFO L225 Difference]: With dead ends: 119 [2019-10-15 01:22:10,974 INFO L226 Difference]: Without dead ends: 64 [2019-10-15 01:22:10,975 INFO L600 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 [2019-10-15 01:22:10,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-15 01:22:10,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-10-15 01:22:10,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-15 01:22:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2019-10-15 01:22:10,986 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 14 [2019-10-15 01:22:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:10,986 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2019-10-15 01:22:10,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2019-10-15 01:22:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:22:10,988 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:10,988 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:10,988 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:10,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1212559863, now seen corresponding path program 1 times [2019-10-15 01:22:10,989 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:10,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058244717] [2019-10-15 01:22:10,990 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:10,990 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:10,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:11,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058244717] [2019-10-15 01:22:11,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:11,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:11,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747747997] [2019-10-15 01:22:11,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:11,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:11,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:11,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:11,048 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand 3 states. [2019-10-15 01:22:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:11,110 INFO L93 Difference]: Finished difference Result 113 states and 169 transitions. [2019-10-15 01:22:11,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:11,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-15 01:22:11,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:11,114 INFO L225 Difference]: With dead ends: 113 [2019-10-15 01:22:11,114 INFO L226 Difference]: Without dead ends: 56 [2019-10-15 01:22:11,118 INFO L600 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 [2019-10-15 01:22:11,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-15 01:22:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-10-15 01:22:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-15 01:22:11,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2019-10-15 01:22:11,139 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 19 [2019-10-15 01:22:11,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:11,139 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2019-10-15 01:22:11,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2019-10-15 01:22:11,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:22:11,146 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:11,146 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:11,146 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:11,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:11,147 INFO L82 PathProgramCache]: Analyzing trace with hash -2054021688, now seen corresponding path program 1 times [2019-10-15 01:22:11,147 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:11,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303425176] [2019-10-15 01:22:11,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:11,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:11,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:11,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303425176] [2019-10-15 01:22:11,244 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:11,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:11,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92938364] [2019-10-15 01:22:11,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:11,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:11,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:11,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:11,247 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand 3 states. [2019-10-15 01:22:11,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:11,323 INFO L93 Difference]: Finished difference Result 140 states and 210 transitions. [2019-10-15 01:22:11,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:11,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:22:11,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:11,326 INFO L225 Difference]: With dead ends: 140 [2019-10-15 01:22:11,326 INFO L226 Difference]: Without dead ends: 94 [2019-10-15 01:22:11,327 INFO L600 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 [2019-10-15 01:22:11,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-15 01:22:11,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-10-15 01:22:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-15 01:22:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 132 transitions. [2019-10-15 01:22:11,338 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 132 transitions. Word has length 24 [2019-10-15 01:22:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:11,338 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 132 transitions. [2019-10-15 01:22:11,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 132 transitions. [2019-10-15 01:22:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 01:22:11,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:11,340 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:11,340 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:11,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:11,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1279925660, now seen corresponding path program 1 times [2019-10-15 01:22:11,341 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:11,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575893708] [2019-10-15 01:22:11,342 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:11,342 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:11,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:11,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:22:11,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575893708] [2019-10-15 01:22:11,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:11,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:11,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818206835] [2019-10-15 01:22:11,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:11,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:11,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:11,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:11,391 INFO L87 Difference]: Start difference. First operand 91 states and 132 transitions. Second operand 3 states. [2019-10-15 01:22:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:11,442 INFO L93 Difference]: Finished difference Result 180 states and 262 transitions. [2019-10-15 01:22:11,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:11,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 01:22:11,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:11,444 INFO L225 Difference]: With dead ends: 180 [2019-10-15 01:22:11,445 INFO L226 Difference]: Without dead ends: 101 [2019-10-15 01:22:11,446 INFO L600 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 [2019-10-15 01:22:11,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-15 01:22:11,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-10-15 01:22:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-15 01:22:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2019-10-15 01:22:11,457 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 25 [2019-10-15 01:22:11,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:11,457 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2019-10-15 01:22:11,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:11,469 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2019-10-15 01:22:11,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-15 01:22:11,471 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:11,471 INFO L380 BasicCegarLoop]: trace histogram [3, 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] [2019-10-15 01:22:11,471 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:11,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:11,472 INFO L82 PathProgramCache]: Analyzing trace with hash -964230168, now seen corresponding path program 1 times [2019-10-15 01:22:11,475 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:11,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275473214] [2019-10-15 01:22:11,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:11,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:11,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:11,553 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:22:11,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275473214] [2019-10-15 01:22:11,554 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:11,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:22:11,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464445235] [2019-10-15 01:22:11,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:22:11,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:11,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:22:11,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:22:11,556 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand 3 states. [2019-10-15 01:22:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:11,584 INFO L93 Difference]: Finished difference Result 164 states and 234 transitions. [2019-10-15 01:22:11,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:22:11,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-15 01:22:11,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:11,586 INFO L225 Difference]: With dead ends: 164 [2019-10-15 01:22:11,586 INFO L226 Difference]: Without dead ends: 77 [2019-10-15 01:22:11,587 INFO L600 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 [2019-10-15 01:22:11,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-15 01:22:11,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-10-15 01:22:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-15 01:22:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 105 transitions. [2019-10-15 01:22:11,595 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 105 transitions. Word has length 36 [2019-10-15 01:22:11,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:11,595 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 105 transitions. [2019-10-15 01:22:11,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:22:11,595 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 105 transitions. [2019-10-15 01:22:11,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-15 01:22:11,597 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:22:11,597 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:22:11,597 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:22:11,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:22:11,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1856126908, now seen corresponding path program 1 times [2019-10-15 01:22:11,598 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:22:11,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146667415] [2019-10-15 01:22:11,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:11,599 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:22:11,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:22:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:22:11,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:22:11,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146667415] [2019-10-15 01:22:11,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:22:11,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:22:11,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79025928] [2019-10-15 01:22:11,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:22:11,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:22:11,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:22:11,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:22:11,667 INFO L87 Difference]: Start difference. First operand 77 states and 105 transitions. Second operand 4 states. [2019-10-15 01:22:11,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:22:11,731 INFO L93 Difference]: Finished difference Result 80 states and 108 transitions. [2019-10-15 01:22:11,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:22:11,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-15 01:22:11,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:22:11,733 INFO L225 Difference]: With dead ends: 80 [2019-10-15 01:22:11,733 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:22:11,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:22:11,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:22:11,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:22:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:22:11,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:22:11,735 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-10-15 01:22:11,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:22:11,735 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:22:11,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:22:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:22:11,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:22:11,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:22:11,842 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:22:11,843 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:22:11,843 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:22:11,843 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:22:11,843 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:22:11,843 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:22:11,843 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:22:11,843 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 13 344) no Hoare annotation was computed. [2019-10-15 01:22:11,844 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 47) no Hoare annotation was computed. [2019-10-15 01:22:11,844 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 101) no Hoare annotation was computed. [2019-10-15 01:22:11,844 INFO L443 ceAbstractionStarter]: For program point L53(lines 53 104) no Hoare annotation was computed. [2019-10-15 01:22:11,844 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 217) no Hoare annotation was computed. [2019-10-15 01:22:11,844 INFO L443 ceAbstractionStarter]: For program point L70(lines 70 85) no Hoare annotation was computed. [2019-10-15 01:22:11,844 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 333) no Hoare annotation was computed. [2019-10-15 01:22:11,844 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 201) no Hoare annotation was computed. [2019-10-15 01:22:11,844 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 69) no Hoare annotation was computed. [2019-10-15 01:22:11,845 INFO L439 ceAbstractionStarter]: At program point L335(lines 23 339) the Hoare annotation is: (let ((.cse0 (= main_~this_sink~0 0))) (or (and (= 2 main_~q~0) .cse0) (and (= main_~q~0 0) .cse0) (and (<= 3 main_~q~0) (not .cse0)))) [2019-10-15 01:22:11,845 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 317) no Hoare annotation was computed. [2019-10-15 01:22:11,845 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 13 344) no Hoare annotation was computed. [2019-10-15 01:22:11,845 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 185) no Hoare annotation was computed. [2019-10-15 01:22:11,845 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 301) no Hoare annotation was computed. [2019-10-15 01:22:11,845 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 169) no Hoare annotation was computed. [2019-10-15 01:22:11,845 INFO L443 ceAbstractionStarter]: For program point L88(lines 88 99) no Hoare annotation was computed. [2019-10-15 01:22:11,846 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 285) no Hoare annotation was computed. [2019-10-15 01:22:11,846 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 215) no Hoare annotation was computed. [2019-10-15 01:22:11,846 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 153) no Hoare annotation was computed. [2019-10-15 01:22:11,846 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 220) no Hoare annotation was computed. [2019-10-15 01:22:11,846 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 83) no Hoare annotation was computed. [2019-10-15 01:22:11,846 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 331) no Hoare annotation was computed. [2019-10-15 01:22:11,846 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 269) no Hoare annotation was computed. [2019-10-15 01:22:11,846 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 336) no Hoare annotation was computed. [2019-10-15 01:22:11,847 INFO L443 ceAbstractionStarter]: For program point L188(lines 188 199) no Hoare annotation was computed. [2019-10-15 01:22:11,847 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 137) no Hoare annotation was computed. [2019-10-15 01:22:11,847 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 67) no Hoare annotation was computed. [2019-10-15 01:22:11,847 INFO L439 ceAbstractionStarter]: At program point L23-2(lines 23 339) the Hoare annotation is: (let ((.cse0 (= main_~this_sink~0 0))) (or (and (= main_~q~0 0) .cse0) (and (<= 3 main_~q~0) (not .cse0)))) [2019-10-15 01:22:11,847 INFO L443 ceAbstractionStarter]: For program point L23-3(lines 23 339) no Hoare annotation was computed. [2019-10-15 01:22:11,847 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 315) no Hoare annotation was computed. [2019-10-15 01:22:11,848 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 253) no Hoare annotation was computed. [2019-10-15 01:22:11,848 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 183) no Hoare annotation was computed. [2019-10-15 01:22:11,848 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 121) no Hoare annotation was computed. [2019-10-15 01:22:11,848 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 42) no Hoare annotation was computed. [2019-10-15 01:22:11,848 INFO L443 ceAbstractionStarter]: For program point L288(lines 288 299) no Hoare annotation was computed. [2019-10-15 01:22:11,848 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 237) no Hoare annotation was computed. [2019-10-15 01:22:11,848 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 167) no Hoare annotation was computed. [2019-10-15 01:22:11,849 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 283) no Hoare annotation was computed. [2019-10-15 01:22:11,849 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 151) no Hoare annotation was computed. [2019-10-15 01:22:11,849 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 267) no Hoare annotation was computed. [2019-10-15 01:22:11,849 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 135) no Hoare annotation was computed. [2019-10-15 01:22:11,849 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 251) no Hoare annotation was computed. [2019-10-15 01:22:11,849 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 119) no Hoare annotation was computed. [2019-10-15 01:22:11,849 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 235) no Hoare annotation was computed. [2019-10-15 01:22:11,849 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2019-10-15 01:22:11,850 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 210) no Hoare annotation was computed. [2019-10-15 01:22:11,850 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2019-10-15 01:22:11,850 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-10-15 01:22:11,850 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 194) no Hoare annotation was computed. [2019-10-15 01:22:11,850 INFO L443 ceAbstractionStarter]: For program point L60(lines 60 62) no Hoare annotation was computed. [2019-10-15 01:22:11,850 INFO L443 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2019-10-15 01:22:11,850 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 178) no Hoare annotation was computed. [2019-10-15 01:22:11,851 INFO L439 ceAbstractionStarter]: At program point L325(lines 13 344) the Hoare annotation is: false [2019-10-15 01:22:11,851 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2019-10-15 01:22:11,851 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 162) no Hoare annotation was computed. [2019-10-15 01:22:11,851 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 278) no Hoare annotation was computed. [2019-10-15 01:22:11,851 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 146) no Hoare annotation was computed. [2019-10-15 01:22:11,851 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 262) no Hoare annotation was computed. [2019-10-15 01:22:11,851 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 130) no Hoare annotation was computed. [2019-10-15 01:22:11,852 INFO L443 ceAbstractionStarter]: For program point L244(lines 244 246) no Hoare annotation was computed. [2019-10-15 01:22:11,852 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 114) no Hoare annotation was computed. [2019-10-15 01:22:11,852 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 230) no Hoare annotation was computed. [2019-10-15 01:22:11,852 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 13 344) the Hoare annotation is: true [2019-10-15 01:22:11,852 INFO L443 ceAbstractionStarter]: For program point L33(lines 33 52) no Hoare annotation was computed. [2019-10-15 01:22:11,852 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 49) no Hoare annotation was computed. [2019-10-15 01:22:11,852 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 343) no Hoare annotation was computed. [2019-10-15 01:22:11,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:22:11 BoogieIcfgContainer [2019-10-15 01:22:11,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:22:11,872 INFO L168 Benchmark]: Toolchain (without parser) took 2489.01 ms. Allocated memory was 138.4 MB in the beginning and 235.4 MB in the end (delta: 97.0 MB). Free memory was 102.6 MB in the beginning and 164.7 MB in the end (delta: -62.1 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:22:11,873 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:22:11,874 INFO L168 Benchmark]: CACSL2BoogieTranslator took 528.72 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 102.2 MB in the beginning and 181.2 MB in the end (delta: -79.0 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-10-15 01:22:11,875 INFO L168 Benchmark]: Boogie Preprocessor took 41.27 ms. Allocated memory is still 202.4 MB. Free memory was 181.2 MB in the beginning and 179.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-10-15 01:22:11,876 INFO L168 Benchmark]: RCFGBuilder took 510.67 ms. Allocated memory is still 202.4 MB. Free memory was 178.5 MB in the beginning and 152.2 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:22:11,877 INFO L168 Benchmark]: TraceAbstraction took 1403.84 ms. Allocated memory was 202.4 MB in the beginning and 235.4 MB in the end (delta: 33.0 MB). Free memory was 152.2 MB in the beginning and 164.7 MB in the end (delta: -12.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-10-15 01:22:11,881 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 528.72 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 102.2 MB in the beginning and 181.2 MB in the end (delta: -79.0 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.27 ms. Allocated memory is still 202.4 MB. Free memory was 181.2 MB in the beginning and 179.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 510.67 ms. Allocated memory is still 202.4 MB. Free memory was 178.5 MB in the beginning and 152.2 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1403.84 ms. Allocated memory was 202.4 MB in the beginning and 235.4 MB in the end (delta: 33.0 MB). Free memory was 152.2 MB in the beginning and 164.7 MB in the end (delta: -12.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 343]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((2 == q && this_sink == 0) || (q == 0 && this_sink == 0)) || (3 <= q && !(this_sink == 0)) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (q == 0 && this_sink == 0) || (3 <= q && !(this_sink == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 1 error locations. Result: SAFE, OverallTime: 1.3s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 549 SDtfs, 190 SDslu, 291 SDs, 0 SdLazy, 87 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 14 NumberOfFragments, 44 HoareAnnotationTreeSize, 7 FomulaSimplifications, 29 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 6831 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 27/27 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...