/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:56:36,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:56:36,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:56:36,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:56:36,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:56:36,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:56:36,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:56:36,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:56:36,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:56:36,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:56:36,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:56:36,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:56:36,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:56:36,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:56:36,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:56:36,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:56:36,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:56:36,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:56:36,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:56:36,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:56:36,742 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:56:36,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:56:36,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:56:36,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:56:36,749 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:56:36,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:56:36,749 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:56:36,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:56:36,752 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:56:36,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:56:36,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:56:36,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:56:36,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:56:36,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:56:36,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:56:36,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:56:36,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:56:36,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:56:36,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:56:36,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:56:36,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:56:36,762 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-11-23 21:56:36,789 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:56:36,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:56:36,791 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:56:36,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:56:36,796 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:56:36,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:56:36,796 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:56:36,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:56:36,797 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:56:36,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:56:36,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:56:36,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:56:36,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:56:36,798 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:56:36,798 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:56:36,799 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:56:36,799 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:56:36,799 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:56:36,799 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:56:36,799 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:56:36,800 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:56:36,800 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:56:36,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:56:36,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:56:36,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:56:36,801 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:56:36,801 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:56:36,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:56:36,804 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:56:36,804 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:56:37,070 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:56:37,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:56:37,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:56:37,098 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:56:37,098 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:56:37,099 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/rule60_list2.i [2019-11-23 21:56:37,174 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085139d6c/9df9081754834fd9be0a13a1178c30ec/FLAGa903ef4a9 [2019-11-23 21:56:37,780 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:56:37,780 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/rule60_list2.i [2019-11-23 21:56:37,800 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085139d6c/9df9081754834fd9be0a13a1178c30ec/FLAGa903ef4a9 [2019-11-23 21:56:38,081 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085139d6c/9df9081754834fd9be0a13a1178c30ec [2019-11-23 21:56:38,089 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:56:38,091 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:56:38,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:56:38,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:56:38,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:56:38,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:56:38" (1/1) ... [2019-11-23 21:56:38,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bf84482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:38, skipping insertion in model container [2019-11-23 21:56:38,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:56:38" (1/1) ... [2019-11-23 21:56:38,107 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:56:38,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:56:38,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:56:38,602 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:56:38,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:56:38,720 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:56:38,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:38 WrapperNode [2019-11-23 21:56:38,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:56:38,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:56:38,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:56:38,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:56:38,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:38" (1/1) ... [2019-11-23 21:56:38,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:38" (1/1) ... [2019-11-23 21:56:38,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:56:38,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:56:38,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:56:38,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:56:38,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:38" (1/1) ... [2019-11-23 21:56:38,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:38" (1/1) ... [2019-11-23 21:56:38,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:38" (1/1) ... [2019-11-23 21:56:38,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:38" (1/1) ... [2019-11-23 21:56:38,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:38" (1/1) ... [2019-11-23 21:56:38,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:38" (1/1) ... [2019-11-23 21:56:38,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:38" (1/1) ... [2019-11-23 21:56:38,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:56:38,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:56:38,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:56:38,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:56:38,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:38" (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-11-23 21:56:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-23 21:56:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-23 21:56:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:56:38,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:56:39,264 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:56:39,264 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-23 21:56:39,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:56:39 BoogieIcfgContainer [2019-11-23 21:56:39,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:56:39,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:56:39,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:56:39,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:56:39,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:56:38" (1/3) ... [2019-11-23 21:56:39,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cc3ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:56:39, skipping insertion in model container [2019-11-23 21:56:39,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:56:38" (2/3) ... [2019-11-23 21:56:39,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cc3ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:56:39, skipping insertion in model container [2019-11-23 21:56:39,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:56:39" (3/3) ... [2019-11-23 21:56:39,276 INFO L109 eAbstractionObserver]: Analyzing ICFG rule60_list2.i [2019-11-23 21:56:39,286 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:56:39,293 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-23 21:56:39,302 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-23 21:56:39,322 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:56:39,322 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:56:39,322 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:56:39,323 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:56:39,323 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:56:39,323 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:56:39,323 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:56:39,323 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:56:39,338 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-11-23 21:56:39,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-23 21:56:39,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:39,345 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-23 21:56:39,346 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:39,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:39,351 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-23 21:56:39,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:39,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908905795] [2019-11-23 21:56:39,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:56:39,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908905795] [2019-11-23 21:56:39,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:56:39,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:56:39,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818494101] [2019-11-23 21:56:39,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:56:39,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:39,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:56:39,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:56:39,529 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2019-11-23 21:56:39,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:39,578 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2019-11-23 21:56:39,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:56:39,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-23 21:56:39,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:39,590 INFO L225 Difference]: With dead ends: 73 [2019-11-23 21:56:39,590 INFO L226 Difference]: Without dead ends: 30 [2019-11-23 21:56:39,596 INFO L630 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-11-23 21:56:39,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-23 21:56:39,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-23 21:56:39,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-23 21:56:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-23 21:56:39,626 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 4 [2019-11-23 21:56:39,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:39,626 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-23 21:56:39,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:56:39,627 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-23 21:56:39,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 21:56:39,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:39,628 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:56:39,628 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:39,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:39,629 INFO L82 PathProgramCache]: Analyzing trace with hash 170685048, now seen corresponding path program 1 times [2019-11-23 21:56:39,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:39,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990899857] [2019-11-23 21:56:39,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:56:39,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990899857] [2019-11-23 21:56:39,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:56:39,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:56:39,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677102431] [2019-11-23 21:56:39,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:56:39,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:39,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:56:39,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:56:39,745 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2019-11-23 21:56:39,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:39,834 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-11-23 21:56:39,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:56:39,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-23 21:56:39,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:39,836 INFO L225 Difference]: With dead ends: 52 [2019-11-23 21:56:39,836 INFO L226 Difference]: Without dead ends: 32 [2019-11-23 21:56:39,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:56:39,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-23 21:56:39,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-11-23 21:56:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-23 21:56:39,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-23 21:56:39,844 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2019-11-23 21:56:39,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:39,844 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-23 21:56:39,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:56:39,845 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-23 21:56:39,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 21:56:39,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:39,846 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:56:39,846 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:39,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:39,847 INFO L82 PathProgramCache]: Analyzing trace with hash 227943350, now seen corresponding path program 1 times [2019-11-23 21:56:39,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:39,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112809228] [2019-11-23 21:56:39,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:56:40,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112809228] [2019-11-23 21:56:40,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:56:40,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:56:40,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871327566] [2019-11-23 21:56:40,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 21:56:40,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:40,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 21:56:40,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:56:40,047 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 7 states. [2019-11-23 21:56:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:40,308 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-23 21:56:40,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 21:56:40,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-23 21:56:40,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:40,310 INFO L225 Difference]: With dead ends: 42 [2019-11-23 21:56:40,310 INFO L226 Difference]: Without dead ends: 40 [2019-11-23 21:56:40,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-23 21:56:40,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-23 21:56:40,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2019-11-23 21:56:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-23 21:56:40,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-11-23 21:56:40,318 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2019-11-23 21:56:40,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:40,319 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-23 21:56:40,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 21:56:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-11-23 21:56:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 21:56:40,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:40,320 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:56:40,320 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:40,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:40,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1186712674, now seen corresponding path program 1 times [2019-11-23 21:56:40,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:40,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598848095] [2019-11-23 21:56:40,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:40,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:56:40,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598848095] [2019-11-23 21:56:40,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:56:40,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:56:40,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309385042] [2019-11-23 21:56:40,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:56:40,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:40,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:56:40,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:56:40,420 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2019-11-23 21:56:40,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:40,465 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2019-11-23 21:56:40,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:56:40,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-23 21:56:40,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:40,467 INFO L225 Difference]: With dead ends: 51 [2019-11-23 21:56:40,467 INFO L226 Difference]: Without dead ends: 28 [2019-11-23 21:56:40,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:56:40,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-23 21:56:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-23 21:56:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-23 21:56:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-23 21:56:40,473 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 19 [2019-11-23 21:56:40,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:40,474 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-23 21:56:40,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:56:40,474 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-23 21:56:40,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 21:56:40,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:40,475 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:56:40,475 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:40,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:40,476 INFO L82 PathProgramCache]: Analyzing trace with hash -93151004, now seen corresponding path program 1 times [2019-11-23 21:56:40,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:40,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710563364] [2019-11-23 21:56:40,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:56:40,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710563364] [2019-11-23 21:56:40,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:56:40,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-23 21:56:40,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303348200] [2019-11-23 21:56:40,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 21:56:40,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:40,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 21:56:40,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-23 21:56:40,661 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 12 states. [2019-11-23 21:56:41,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:41,023 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-11-23 21:56:41,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 21:56:41,023 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-11-23 21:56:41,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:41,024 INFO L225 Difference]: With dead ends: 38 [2019-11-23 21:56:41,024 INFO L226 Difference]: Without dead ends: 36 [2019-11-23 21:56:41,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-23 21:56:41,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-23 21:56:41,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-11-23 21:56:41,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-23 21:56:41,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-23 21:56:41,031 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 19 [2019-11-23 21:56:41,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:41,032 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-23 21:56:41,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 21:56:41,032 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-23 21:56:41,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 21:56:41,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:41,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:56:41,033 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:41,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:41,034 INFO L82 PathProgramCache]: Analyzing trace with hash -93091422, now seen corresponding path program 1 times [2019-11-23 21:56:41,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:41,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531839653] [2019-11-23 21:56:41,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:41,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:56:41,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531839653] [2019-11-23 21:56:41,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:56:41,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 21:56:41,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981405739] [2019-11-23 21:56:41,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 21:56:41,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:41,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 21:56:41,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:56:41,193 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 8 states. [2019-11-23 21:56:41,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:41,394 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-11-23 21:56:41,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 21:56:41,395 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-23 21:56:41,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:41,395 INFO L225 Difference]: With dead ends: 38 [2019-11-23 21:56:41,396 INFO L226 Difference]: Without dead ends: 36 [2019-11-23 21:56:41,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:56:41,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-23 21:56:41,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-11-23 21:56:41,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-23 21:56:41,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-11-23 21:56:41,401 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2019-11-23 21:56:41,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:41,401 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-23 21:56:41,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 21:56:41,401 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-11-23 21:56:41,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 21:56:41,402 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:41,402 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:56:41,403 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:41,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:41,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1793070580, now seen corresponding path program 1 times [2019-11-23 21:56:41,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:41,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786605224] [2019-11-23 21:56:41,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:41,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:56:41,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786605224] [2019-11-23 21:56:41,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:56:41,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 21:56:41,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709373183] [2019-11-23 21:56:41,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 21:56:41,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:41,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 21:56:41,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-23 21:56:41,539 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 10 states. [2019-11-23 21:56:41,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:41,829 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-11-23 21:56:41,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 21:56:41,830 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-11-23 21:56:41,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:41,830 INFO L225 Difference]: With dead ends: 38 [2019-11-23 21:56:41,830 INFO L226 Difference]: Without dead ends: 30 [2019-11-23 21:56:41,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-11-23 21:56:41,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-23 21:56:41,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-23 21:56:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-23 21:56:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-11-23 21:56:41,836 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 25 [2019-11-23 21:56:41,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:41,836 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-11-23 21:56:41,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 21:56:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-11-23 21:56:41,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 21:56:41,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:41,837 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:56:41,838 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:41,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:41,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1793130162, now seen corresponding path program 1 times [2019-11-23 21:56:41,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:41,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109661393] [2019-11-23 21:56:41,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:56:42,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109661393] [2019-11-23 21:56:42,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:56:42,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-23 21:56:42,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446106966] [2019-11-23 21:56:42,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-23 21:56:42,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:42,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-23 21:56:42,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:56:42,021 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 14 states. [2019-11-23 21:56:42,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:42,417 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-11-23 21:56:42,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 21:56:42,417 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-11-23 21:56:42,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:42,419 INFO L225 Difference]: With dead ends: 40 [2019-11-23 21:56:42,419 INFO L226 Difference]: Without dead ends: 34 [2019-11-23 21:56:42,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2019-11-23 21:56:42,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-23 21:56:42,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-11-23 21:56:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-23 21:56:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-11-23 21:56:42,424 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 25 [2019-11-23 21:56:42,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:42,425 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-11-23 21:56:42,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-23 21:56:42,425 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-11-23 21:56:42,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 21:56:42,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:42,426 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:56:42,426 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:42,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:42,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1850388464, now seen corresponding path program 1 times [2019-11-23 21:56:42,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:42,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092794831] [2019-11-23 21:56:42,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:42,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:56:42,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092794831] [2019-11-23 21:56:42,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:56:42,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 21:56:42,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548931248] [2019-11-23 21:56:42,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:56:42,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:42,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:56:42,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:56:42,494 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 5 states. [2019-11-23 21:56:42,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:42,549 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2019-11-23 21:56:42,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 21:56:42,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-23 21:56:42,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:42,553 INFO L225 Difference]: With dead ends: 36 [2019-11-23 21:56:42,553 INFO L226 Difference]: Without dead ends: 26 [2019-11-23 21:56:42,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:56:42,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-23 21:56:42,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-23 21:56:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-23 21:56:42,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2019-11-23 21:56:42,558 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 25 [2019-11-23 21:56:42,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:42,558 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2019-11-23 21:56:42,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:56:42,559 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2019-11-23 21:56:42,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 21:56:42,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:56:42,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:56:42,560 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:56:42,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:56:42,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1400103152, now seen corresponding path program 1 times [2019-11-23 21:56:42,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:56:42,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079877843] [2019-11-23 21:56:42,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:56:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:56:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:56:42,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079877843] [2019-11-23 21:56:42,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:56:42,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-23 21:56:42,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053594278] [2019-11-23 21:56:42,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 21:56:42,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:56:42,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 21:56:42,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-23 21:56:42,672 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand 13 states. [2019-11-23 21:56:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:56:43,009 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2019-11-23 21:56:43,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 21:56:43,009 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-11-23 21:56:43,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:56:43,010 INFO L225 Difference]: With dead ends: 26 [2019-11-23 21:56:43,010 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 21:56:43,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-11-23 21:56:43,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 21:56:43,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 21:56:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 21:56:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 21:56:43,013 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-11-23 21:56:43,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:56:43,013 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 21:56:43,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 21:56:43,014 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 21:56:43,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 21:56:43,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 21:56:43,197 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-11-23 21:56:43,449 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-11-23 21:56:43,449 INFO L444 ceAbstractionStarter]: For program point L895(lines 895 898) no Hoare annotation was computed. [2019-11-23 21:56:43,449 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-11-23 21:56:43,449 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 21:56:43,450 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 21:56:43,450 INFO L440 ceAbstractionStarter]: At program point L879(lines 878 880) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___getMemory_~size 8)) (.cse1 (= 0 ~guard_malloc_counter~0.base)) (.cse2 (= 0 |ULTIMATE.start_my_malloc_#res.base|)) (.cse3 (= ~elem~0.offset 0))) (or (and (= |ULTIMATE.start___getMemory_#res.offset| 0) (= 0 |ULTIMATE.start_my_malloc_#res.offset|) .cse0 (= 0 |ULTIMATE.start___getMemory_#res.base|) .cse1 .cse2 .cse3) (and (<= 1 |ULTIMATE.start_my_malloc_#res.offset|) .cse0 (= ~elem~0.base |ULTIMATE.start_my_malloc_#res.base|) (<= |ULTIMATE.start_my_malloc_#res.offset| ~guard_malloc_counter~0.offset) .cse1 .cse2 (<= 1 |ULTIMATE.start___getMemory_#res.offset|) .cse3 (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.base |ULTIMATE.start___getMemory_#res.base|)))) [2019-11-23 21:56:43,450 INFO L440 ceAbstractionStarter]: At program point L879-1(lines 878 880) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___getMemory_~size 8)) (.cse1 (= 0 |ULTIMATE.start___getMemory_#res.base|)) (.cse4 (= 0 ~guard_malloc_counter~0.base)) (.cse2 (= 0 |ULTIMATE.start_my_malloc_#res.base|)) (.cse5 (= ~elem~0.offset 0))) (or (and (= |ULTIMATE.start___getMemory_#res.offset| 0) (= 0 |ULTIMATE.start_my_malloc_#res.offset|) .cse0 .cse1 .cse2) (let ((.cse3 (+ ULTIMATE.start_main_~dev1~0.offset 1))) (and (<= .cse3 |ULTIMATE.start_my_malloc_#res.offset|) (= |ULTIMATE.start___getMemory_#res.base| ULTIMATE.start_main_~dev1~0.base) .cse0 (<= 1 ULTIMATE.start_main_~dev1~0.offset) (= ~elem~0.base |ULTIMATE.start_my_malloc_#res.base|) (<= |ULTIMATE.start_my_malloc_#res.offset| ~guard_malloc_counter~0.offset) .cse4 .cse2 .cse5 (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.base |ULTIMATE.start___getMemory_#res.base|) (<= .cse3 |ULTIMATE.start___getMemory_#res.offset|))) (and (= 0 ULTIMATE.start_main_~dev1~0.base) .cse0 .cse1 .cse4 .cse2 .cse5 (= ULTIMATE.start_main_~dev1~0.offset 0)))) [2019-11-23 21:56:43,451 INFO L444 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2019-11-23 21:56:43,451 INFO L444 ceAbstractionStarter]: For program point L871-2(line 871) no Hoare annotation was computed. [2019-11-23 21:56:43,451 INFO L444 ceAbstractionStarter]: For program point L4(lines 1 917) no Hoare annotation was computed. [2019-11-23 21:56:43,451 INFO L444 ceAbstractionStarter]: For program point L4-1(lines 1 917) no Hoare annotation was computed. [2019-11-23 21:56:43,451 INFO L444 ceAbstractionStarter]: For program point L4-2(lines 1 917) no Hoare annotation was computed. [2019-11-23 21:56:43,451 INFO L444 ceAbstractionStarter]: For program point L4-3(lines 1 917) no Hoare annotation was computed. [2019-11-23 21:56:43,451 INFO L444 ceAbstractionStarter]: For program point L896(lines 896 897) no Hoare annotation was computed. [2019-11-23 21:56:43,451 INFO L444 ceAbstractionStarter]: For program point L4-4(lines 1 917) no Hoare annotation was computed. [2019-11-23 21:56:43,452 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-11-23 21:56:43,452 INFO L444 ceAbstractionStarter]: For program point L889(lines 889 893) no Hoare annotation was computed. [2019-11-23 21:56:43,452 INFO L444 ceAbstractionStarter]: For program point L889-1(lines 889 893) no Hoare annotation was computed. [2019-11-23 21:56:43,452 INFO L444 ceAbstractionStarter]: For program point L906(lines 906 915) no Hoare annotation was computed. [2019-11-23 21:56:43,452 INFO L444 ceAbstractionStarter]: For program point L873(lines 873 874) no Hoare annotation was computed. [2019-11-23 21:56:43,452 INFO L444 ceAbstractionStarter]: For program point L906-1(lines 906 915) no Hoare annotation was computed. [2019-11-23 21:56:43,452 INFO L444 ceAbstractionStarter]: For program point L873-1(lines 873 874) no Hoare annotation was computed. [2019-11-23 21:56:43,453 INFO L444 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2019-11-23 21:56:43,453 INFO L444 ceAbstractionStarter]: For program point L6-1(line 6) no Hoare annotation was computed. [2019-11-23 21:56:43,453 INFO L444 ceAbstractionStarter]: For program point L6-2(line 6) no Hoare annotation was computed. [2019-11-23 21:56:43,453 INFO L444 ceAbstractionStarter]: For program point L6-3(line 6) no Hoare annotation was computed. [2019-11-23 21:56:43,453 INFO L444 ceAbstractionStarter]: For program point L6-4(line 6) no Hoare annotation was computed. [2019-11-23 21:56:43,453 INFO L444 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2019-11-23 21:56:43,453 INFO L444 ceAbstractionStarter]: For program point L890-2(line 890) no Hoare annotation was computed. [2019-11-23 21:56:43,453 INFO L444 ceAbstractionStarter]: For program point L890-4(line 890) no Hoare annotation was computed. [2019-11-23 21:56:43,453 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 21:56:43,453 INFO L444 ceAbstractionStarter]: For program point L891(lines 891 892) no Hoare annotation was computed. [2019-11-23 21:56:43,453 INFO L444 ceAbstractionStarter]: For program point L891-2(lines 891 892) no Hoare annotation was computed. [2019-11-23 21:56:43,454 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-11-23 21:56:43,454 INFO L444 ceAbstractionStarter]: For program point L891-4(lines 891 892) no Hoare annotation was computed. [2019-11-23 21:56:43,454 INFO L440 ceAbstractionStarter]: At program point L916(lines 902 917) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2019-11-23 21:56:43,454 INFO L440 ceAbstractionStarter]: At program point L875(lines 869 876) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___getMemory_~size 8)) (.cse1 (= 0 |ULTIMATE.start___getMemory_#res.base|)) (.cse2 (= 0 ~guard_malloc_counter~0.base)) (.cse3 (= ~elem~0.offset 0))) (or (and .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start___getMemory_#res.offset|) .cse3 (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.base |ULTIMATE.start___getMemory_#res.base|)) (and (= |ULTIMATE.start___getMemory_#res.offset| 0) .cse0 .cse1 .cse2 .cse3))) [2019-11-23 21:56:43,454 INFO L440 ceAbstractionStarter]: At program point L875-1(lines 869 876) the Hoare annotation is: (let ((.cse1 (= 0 |ULTIMATE.start___getMemory_#res.base|)) (.cse0 (= ULTIMATE.start___getMemory_~size 8)) (.cse2 (= 0 ~guard_malloc_counter~0.base)) (.cse3 (= ~elem~0.offset 0))) (or (and (= |ULTIMATE.start___getMemory_#res.offset| 0) .cse0 .cse1) (and (= 0 ULTIMATE.start_main_~dev1~0.base) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~dev1~0.offset 0)) (and (= |ULTIMATE.start___getMemory_#res.base| ULTIMATE.start_main_~dev1~0.base) .cse1 .cse0 (<= 1 ULTIMATE.start_main_~dev1~0.offset) .cse2 .cse3 (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.base |ULTIMATE.start___getMemory_#res.base|) (<= (+ ULTIMATE.start_main_~dev1~0.offset 1) |ULTIMATE.start___getMemory_#res.offset|)))) [2019-11-23 21:56:43,454 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 21:56:43,455 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-11-23 21:56:43,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:56:43 BoogieIcfgContainer [2019-11-23 21:56:43,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 21:56:43,482 INFO L168 Benchmark]: Toolchain (without parser) took 5391.29 ms. Allocated memory was 139.5 MB in the beginning and 277.9 MB in the end (delta: 138.4 MB). Free memory was 102.9 MB in the beginning and 160.3 MB in the end (delta: -57.4 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. [2019-11-23 21:56:43,483 INFO L168 Benchmark]: CDTParser took 1.39 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 21:56:43,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 629.48 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 102.7 MB in the beginning and 169.5 MB in the end (delta: -66.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-11-23 21:56:43,485 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.10 ms. Allocated memory is still 205.0 MB. Free memory was 169.5 MB in the beginning and 167.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-11-23 21:56:43,486 INFO L168 Benchmark]: Boogie Preprocessor took 29.63 ms. Allocated memory is still 205.0 MB. Free memory was 167.6 MB in the beginning and 165.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-11-23 21:56:43,486 INFO L168 Benchmark]: RCFGBuilder took 467.67 ms. Allocated memory is still 205.0 MB. Free memory was 165.7 MB in the beginning and 143.2 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2019-11-23 21:56:43,488 INFO L168 Benchmark]: TraceAbstraction took 4210.57 ms. Allocated memory was 205.0 MB in the beginning and 277.9 MB in the end (delta: 72.9 MB). Free memory was 143.2 MB in the beginning and 160.3 MB in the end (delta: -17.1 MB). Peak memory consumption was 55.8 MB. Max. memory is 7.1 GB. [2019-11-23 21:56:43,493 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.39 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 629.48 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 102.7 MB in the beginning and 169.5 MB in the end (delta: -66.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.10 ms. Allocated memory is still 205.0 MB. Free memory was 169.5 MB in the beginning and 167.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.63 ms. Allocated memory is still 205.0 MB. Free memory was 167.6 MB in the beginning and 165.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 467.67 ms. Allocated memory is still 205.0 MB. Free memory was 165.7 MB in the beginning and 143.2 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4210.57 ms. Allocated memory was 205.0 MB in the beginning and 277.9 MB in the end (delta: 72.9 MB). Free memory was 143.2 MB in the beginning and 160.3 MB in the end (delta: -17.1 MB). Peak memory consumption was 55.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 902]: Loop Invariant Derived loop invariant: size == 8 - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: (((((\result == 0 && 0 == \result) && size == 8) && 0 == \result) && 0 == \result) || (((((((((((dev1 + 1 <= \result && \result == dev1) && size == 8) && 1 <= dev1) && elem == \result) && \result <= guard_malloc_counter) && 0 == guard_malloc_counter) && 0 == \result) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) && dev1 + 1 <= \result)) || ((((((0 == dev1 && size == 8) && 0 == \result) && 0 == guard_malloc_counter) && 0 == \result) && elem == 0) && dev1 == 0) - InvariantResult [Line: 869]: Loop Invariant Derived loop invariant: ((((((size == 8 && 0 == \result) && 0 == guard_malloc_counter) && 1 <= \result) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) || ((((\result == 0 && size == 8) && 0 == \result) && 0 == guard_malloc_counter) && elem == 0) - InvariantResult [Line: 869]: Loop Invariant Derived loop invariant: (((\result == 0 && size == 8) && 0 == \result) || (((((0 == dev1 && size == 8) && 0 == \result) && 0 == guard_malloc_counter) && elem == 0) && dev1 == 0)) || ((((((((\result == dev1 && 0 == \result) && size == 8) && 1 <= dev1) && 0 == guard_malloc_counter) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) && dev1 + 1 <= \result) - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: ((((((\result == 0 && 0 == \result) && size == 8) && 0 == \result) && 0 == guard_malloc_counter) && 0 == \result) && elem == 0) || (((((((((1 <= \result && size == 8) && elem == \result) && \result <= guard_malloc_counter) && 0 == guard_malloc_counter) && 0 == \result) && 1 <= \result) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 5 error locations. Result: SAFE, OverallTime: 4.1s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 224 SDtfs, 658 SDslu, 521 SDs, 0 SdLazy, 804 SolverSat, 118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, 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, 10 MinimizatonAttempts, 34 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 16 NumberOfFragments, 236 HoareAnnotationTreeSize, 5 FomulaSimplifications, 56 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 57 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 15085 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 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...