/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/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:31:56,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:31:56,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:31:56,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:31:56,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:31:56,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:31:56,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:31:56,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:31:56,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:31:56,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:31:56,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:31:56,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:31:56,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:31:56,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:31:56,780 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:31:56,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:31:56,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:31:56,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:31:56,785 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:31:56,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:31:56,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:31:56,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:31:56,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:31:56,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:31:56,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:31:56,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:31:56,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:31:56,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:31:56,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:31:56,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:31:56,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:31:56,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:31:56,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:31:56,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:31:56,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:31:56,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:31:56,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:31:56,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:31:56,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:31:56,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:31:56,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:31:56,805 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:31:56,820 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:31:56,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:31:56,821 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:31:56,821 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:31:56,821 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:31:56,821 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:31:56,821 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:31:56,822 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:31:56,822 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:31:56,822 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:31:56,822 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:31:56,822 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:31:56,823 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:31:56,823 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:31:56,823 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:31:56,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:31:56,824 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:31:56,824 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:31:56,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:31:56,825 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:31:56,825 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:31:56,825 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:31:56,825 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:31:56,825 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:31:56,826 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:31:56,826 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:31:56,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:31:56,826 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:31:56,826 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:31:56,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:31:56,827 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:31:56,827 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:31:56,827 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:31:56,827 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:31:56,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:31:56,828 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:31:56,828 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:31:56,828 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:31:57,119 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:31:57,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:31:57,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:31:57,136 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:31:57,136 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:31:57,137 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label05.c [2019-11-23 23:31:57,212 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef587d335/11fd827c18d14a70a95a131a1bcda62a/FLAG4b20f1cc9 [2019-11-23 23:31:57,771 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:31:57,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label05.c [2019-11-23 23:31:57,783 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef587d335/11fd827c18d14a70a95a131a1bcda62a/FLAG4b20f1cc9 [2019-11-23 23:31:58,052 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef587d335/11fd827c18d14a70a95a131a1bcda62a [2019-11-23 23:31:58,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:31:58,064 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:31:58,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:58,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:31:58,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:31:58,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:58" (1/1) ... [2019-11-23 23:31:58,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bea9702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:58, skipping insertion in model container [2019-11-23 23:31:58,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:58" (1/1) ... [2019-11-23 23:31:58,085 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:31:58,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:31:58,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:58,704 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:31:58,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:58,845 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:31:58,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:58 WrapperNode [2019-11-23 23:31:58,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:58,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:58,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:31:58,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:31:58,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:58" (1/1) ... [2019-11-23 23:31:58,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:58" (1/1) ... [2019-11-23 23:31:58,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:58,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:31:58,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:31:58,952 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:31:58,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:58" (1/1) ... [2019-11-23 23:31:58,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:58" (1/1) ... [2019-11-23 23:31:58,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:58" (1/1) ... [2019-11-23 23:31:58,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:58" (1/1) ... [2019-11-23 23:31:58,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:58" (1/1) ... [2019-11-23 23:31:59,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:58" (1/1) ... [2019-11-23 23:31:59,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:58" (1/1) ... [2019-11-23 23:31:59,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:31:59,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:31:59,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:31:59,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:31:59,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:58" (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 23:31:59,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:31:59,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:32:01,109 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:32:01,110 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:32:01,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:01 BoogieIcfgContainer [2019-11-23 23:32:01,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:32:01,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:32:01,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:32:01,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:32:01,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:31:58" (1/3) ... [2019-11-23 23:32:01,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e4ac21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:01, skipping insertion in model container [2019-11-23 23:32:01,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:58" (2/3) ... [2019-11-23 23:32:01,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e4ac21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:01, skipping insertion in model container [2019-11-23 23:32:01,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:01" (3/3) ... [2019-11-23 23:32:01,120 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label05.c [2019-11-23 23:32:01,130 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:32:01,138 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:32:01,150 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:32:01,177 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:32:01,178 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:32:01,178 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:32:01,178 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:32:01,178 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:32:01,178 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:32:01,179 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:32:01,179 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:32:01,198 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-23 23:32:01,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 23:32:01,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:01,210 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:32:01,210 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:01,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:01,216 INFO L82 PathProgramCache]: Analyzing trace with hash 925959951, now seen corresponding path program 1 times [2019-11-23 23:32:01,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:01,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252314012] [2019-11-23 23:32:01,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:01,560 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 23:32:01,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252314012] [2019-11-23 23:32:01,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:01,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:01,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131450575] [2019-11-23 23:32:01,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:01,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:01,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:01,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:01,587 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-11-23 23:32:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:02,379 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-11-23 23:32:02,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:02,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-23 23:32:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:02,403 INFO L225 Difference]: With dead ends: 333 [2019-11-23 23:32:02,403 INFO L226 Difference]: Without dead ends: 243 [2019-11-23 23:32:02,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:02,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-23 23:32:02,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-11-23 23:32:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-23 23:32:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 453 transitions. [2019-11-23 23:32:02,499 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 453 transitions. Word has length 80 [2019-11-23 23:32:02,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:02,500 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 453 transitions. [2019-11-23 23:32:02,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:02,501 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 453 transitions. [2019-11-23 23:32:02,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 23:32:02,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:02,506 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:02,506 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:02,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:02,506 INFO L82 PathProgramCache]: Analyzing trace with hash 221760430, now seen corresponding path program 1 times [2019-11-23 23:32:02,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:02,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817959784] [2019-11-23 23:32:02,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:02,642 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:02,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817959784] [2019-11-23 23:32:02,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:02,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:02,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686260282] [2019-11-23 23:32:02,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:02,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:02,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:02,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:02,648 INFO L87 Difference]: Start difference. First operand 243 states and 453 transitions. Second operand 4 states. [2019-11-23 23:32:03,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:03,209 INFO L93 Difference]: Finished difference Result 805 states and 1497 transitions. [2019-11-23 23:32:03,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:03,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-23 23:32:03,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:03,215 INFO L225 Difference]: With dead ends: 805 [2019-11-23 23:32:03,216 INFO L226 Difference]: Without dead ends: 563 [2019-11-23 23:32:03,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:03,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-11-23 23:32:03,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 403. [2019-11-23 23:32:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-11-23 23:32:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 718 transitions. [2019-11-23 23:32:03,272 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 718 transitions. Word has length 98 [2019-11-23 23:32:03,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:03,273 INFO L462 AbstractCegarLoop]: Abstraction has 403 states and 718 transitions. [2019-11-23 23:32:03,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 718 transitions. [2019-11-23 23:32:03,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 23:32:03,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:03,282 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:03,282 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:03,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:03,285 INFO L82 PathProgramCache]: Analyzing trace with hash 11625656, now seen corresponding path program 1 times [2019-11-23 23:32:03,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:03,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008148944] [2019-11-23 23:32:03,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:03,362 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:03,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008148944] [2019-11-23 23:32:03,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:03,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:32:03,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055207799] [2019-11-23 23:32:03,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:03,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:03,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:03,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:03,365 INFO L87 Difference]: Start difference. First operand 403 states and 718 transitions. Second operand 3 states. [2019-11-23 23:32:03,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:03,754 INFO L93 Difference]: Finished difference Result 1125 states and 1996 transitions. [2019-11-23 23:32:03,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:03,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-23 23:32:03,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:03,760 INFO L225 Difference]: With dead ends: 1125 [2019-11-23 23:32:03,760 INFO L226 Difference]: Without dead ends: 723 [2019-11-23 23:32:03,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 23:32:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-11-23 23:32:03,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2019-11-23 23:32:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-11-23 23:32:03,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1164 transitions. [2019-11-23 23:32:03,788 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1164 transitions. Word has length 102 [2019-11-23 23:32:03,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:03,788 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 1164 transitions. [2019-11-23 23:32:03,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:03,788 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1164 transitions. [2019-11-23 23:32:03,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-23 23:32:03,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:03,791 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:03,791 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:03,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:03,792 INFO L82 PathProgramCache]: Analyzing trace with hash -279017040, now seen corresponding path program 1 times [2019-11-23 23:32:03,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:03,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305417337] [2019-11-23 23:32:03,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:03,857 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:32:03,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305417337] [2019-11-23 23:32:03,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:03,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:03,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302253751] [2019-11-23 23:32:03,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:03,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:03,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:03,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:03,859 INFO L87 Difference]: Start difference. First operand 723 states and 1164 transitions. Second operand 4 states. [2019-11-23 23:32:04,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:04,609 INFO L93 Difference]: Finished difference Result 2165 states and 3408 transitions. [2019-11-23 23:32:04,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:04,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-23 23:32:04,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:04,619 INFO L225 Difference]: With dead ends: 2165 [2019-11-23 23:32:04,620 INFO L226 Difference]: Without dead ends: 1443 [2019-11-23 23:32:04,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:04,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2019-11-23 23:32:04,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1203. [2019-11-23 23:32:04,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-11-23 23:32:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1714 transitions. [2019-11-23 23:32:04,657 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1714 transitions. Word has length 111 [2019-11-23 23:32:04,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:04,657 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1714 transitions. [2019-11-23 23:32:04,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1714 transitions. [2019-11-23 23:32:04,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-23 23:32:04,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:04,661 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:32:04,661 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:04,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:04,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1735808491, now seen corresponding path program 1 times [2019-11-23 23:32:04,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:04,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82106425] [2019-11-23 23:32:04,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:32:04,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82106425] [2019-11-23 23:32:04,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:04,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:04,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547200475] [2019-11-23 23:32:04,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:04,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:04,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:04,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:04,746 INFO L87 Difference]: Start difference. First operand 1203 states and 1714 transitions. Second operand 4 states. [2019-11-23 23:32:05,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:05,403 INFO L93 Difference]: Finished difference Result 2885 states and 4133 transitions. [2019-11-23 23:32:05,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:05,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-23 23:32:05,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:05,411 INFO L225 Difference]: With dead ends: 2885 [2019-11-23 23:32:05,411 INFO L226 Difference]: Without dead ends: 1683 [2019-11-23 23:32:05,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:05,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2019-11-23 23:32:05,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1123. [2019-11-23 23:32:05,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-11-23 23:32:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1478 transitions. [2019-11-23 23:32:05,443 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1478 transitions. Word has length 118 [2019-11-23 23:32:05,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:05,443 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1478 transitions. [2019-11-23 23:32:05,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:05,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1478 transitions. [2019-11-23 23:32:05,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 23:32:05,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:05,447 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:05,447 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:05,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:05,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1692464007, now seen corresponding path program 1 times [2019-11-23 23:32:05,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:05,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475716986] [2019-11-23 23:32:05,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-23 23:32:05,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475716986] [2019-11-23 23:32:05,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:05,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:05,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486731790] [2019-11-23 23:32:05,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:05,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:05,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:05,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:05,524 INFO L87 Difference]: Start difference. First operand 1123 states and 1478 transitions. Second operand 3 states. [2019-11-23 23:32:05,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:05,930 INFO L93 Difference]: Finished difference Result 2405 states and 3125 transitions. [2019-11-23 23:32:05,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:05,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-23 23:32:05,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:05,941 INFO L225 Difference]: With dead ends: 2405 [2019-11-23 23:32:05,941 INFO L226 Difference]: Without dead ends: 1203 [2019-11-23 23:32:05,943 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 23:32:05,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-11-23 23:32:05,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1043. [2019-11-23 23:32:05,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-23 23:32:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1309 transitions. [2019-11-23 23:32:05,966 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1309 transitions. Word has length 131 [2019-11-23 23:32:05,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:05,967 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1309 transitions. [2019-11-23 23:32:05,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:05,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1309 transitions. [2019-11-23 23:32:05,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-23 23:32:05,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:05,970 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:32:05,970 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:05,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:05,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1947473484, now seen corresponding path program 1 times [2019-11-23 23:32:05,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:05,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062330497] [2019-11-23 23:32:05,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-23 23:32:06,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062330497] [2019-11-23 23:32:06,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:06,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:32:06,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465821302] [2019-11-23 23:32:06,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:32:06,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:06,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:32:06,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:32:06,085 INFO L87 Difference]: Start difference. First operand 1043 states and 1309 transitions. Second operand 3 states. [2019-11-23 23:32:06,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:06,512 INFO L93 Difference]: Finished difference Result 2485 states and 3103 transitions. [2019-11-23 23:32:06,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:32:06,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-23 23:32:06,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:06,518 INFO L225 Difference]: With dead ends: 2485 [2019-11-23 23:32:06,518 INFO L226 Difference]: Without dead ends: 1043 [2019-11-23 23:32:06,520 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 23:32:06,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-23 23:32:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 963. [2019-11-23 23:32:06,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-11-23 23:32:06,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1138 transitions. [2019-11-23 23:32:06,541 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1138 transitions. Word has length 140 [2019-11-23 23:32:06,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:06,542 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1138 transitions. [2019-11-23 23:32:06,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:32:06,542 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1138 transitions. [2019-11-23 23:32:06,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-23 23:32:06,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:06,545 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:32:06,545 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:06,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:06,545 INFO L82 PathProgramCache]: Analyzing trace with hash -275459511, now seen corresponding path program 1 times [2019-11-23 23:32:06,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:06,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677927027] [2019-11-23 23:32:06,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 94 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-23 23:32:06,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677927027] [2019-11-23 23:32:06,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970198648] [2019-11-23 23:32:06,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:32:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:06,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:32:06,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:32:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 23:32:06,908 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:32:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-23 23:32:06,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:32:06,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 9 [2019-11-23 23:32:06,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642720012] [2019-11-23 23:32:06,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:06,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:06,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:06,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:32:06,985 INFO L87 Difference]: Start difference. First operand 963 states and 1138 transitions. Second operand 4 states. [2019-11-23 23:32:07,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:07,315 INFO L93 Difference]: Finished difference Result 1683 states and 1954 transitions. [2019-11-23 23:32:07,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:07,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-23 23:32:07,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:07,316 INFO L225 Difference]: With dead ends: 1683 [2019-11-23 23:32:07,316 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:32:07,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-23 23:32:07,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:32:07,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:32:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:32:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:32:07,319 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154 [2019-11-23 23:32:07,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:07,320 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:32:07,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:07,320 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:32:07,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:32:07,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:32:07,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:32:07,848 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2019-11-23 23:32:08,070 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2019-11-23 23:32:08,075 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 23:32:08,075 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 23:32:08,075 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 23:32:08,075 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 23:32:08,075 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 23:32:08,076 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 23:32:08,076 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 23:32:08,076 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 23:32:08,076 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 23:32:08,076 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 23:32:08,076 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 23:32:08,076 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 23:32:08,077 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 23:32:08,077 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 23:32:08,077 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 23:32:08,077 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 23:32:08,077 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 23:32:08,077 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 23:32:08,078 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 23:32:08,078 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 23:32:08,078 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 23:32:08,078 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 23:32:08,078 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 23:32:08,078 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 23:32:08,079 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 23:32:08,079 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:32:08,079 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 23:32:08,079 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 23:32:08,079 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 23:32:08,080 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 23:32:08,080 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 23:32:08,080 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 23:32:08,080 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 23:32:08,080 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 23:32:08,080 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 23:32:08,081 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 23:32:08,081 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 550) no Hoare annotation was computed. [2019-11-23 23:32:08,081 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 23:32:08,081 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 23:32:08,081 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 23:32:08,081 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 23:32:08,082 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse1 (= ~a25~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse0 (not .cse7)) (.cse5 (= ~a17~0 8)) (.cse4 (not .cse1)) (.cse3 (not (= ~a28~0 11)))) (let ((.cse6 (<= ~a17~0 7)) (.cse2 (= ~a11~0 1)) (.cse8 (let ((.cse10 (<= ~a19~0 0))) (or (and .cse10 .cse4 .cse5) (and .cse0 .cse4 .cse5 .cse3) (and .cse10 .cse4 .cse3)))) (.cse9 (< ~a17~0 9))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse3) (and .cse6 .cse7 (= ~a28~0 7) .cse2) (and .cse6 .cse4 .cse7 .cse2) (and .cse5 .cse7 .cse1) (and .cse8 .cse2) (and .cse0 .cse9 .cse1 .cse3) (and .cse8 .cse9))))) [2019-11-23 23:32:08,082 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 23:32:08,082 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 23:32:08,082 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 23:32:08,083 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 23:32:08,083 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 23:32:08,083 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 23:32:08,083 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 23:32:08,083 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 23:32:08,083 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 23:32:08,083 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 23:32:08,084 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse1 (= ~a25~0 1)) (.cse7 (= ~a19~0 1))) (let ((.cse0 (not .cse7)) (.cse5 (= ~a17~0 8)) (.cse4 (not .cse1)) (.cse3 (not (= ~a28~0 11)))) (let ((.cse6 (<= ~a17~0 7)) (.cse2 (= ~a11~0 1)) (.cse8 (let ((.cse10 (<= ~a19~0 0))) (or (and .cse10 .cse4 .cse5) (and .cse0 .cse4 .cse5 .cse3) (and .cse10 .cse4 .cse3)))) (.cse9 (< ~a17~0 9))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse3) (and .cse6 .cse7 (= ~a28~0 7) .cse2) (and .cse6 .cse4 .cse7 .cse2) (and .cse5 .cse7 .cse1) (and .cse8 .cse2) (and .cse0 .cse9 .cse1 .cse3) (and .cse8 .cse9))))) [2019-11-23 23:32:08,084 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 23:32:08,084 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 23:32:08,084 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 23:32:08,084 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 23:32:08,084 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 23:32:08,084 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 23:32:08,085 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 23:32:08,085 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 23:32:08,085 INFO L444 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:08,085 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 23:32:08,085 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 23:32:08,085 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:32:08,085 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 23:32:08,085 INFO L444 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 23:32:08,086 INFO L444 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-23 23:32:08,086 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 23:32:08,086 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 23:32:08,086 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 23:32:08,086 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 23:32:08,086 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 23:32:08,086 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 23:32:08,086 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 23:32:08,087 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 23:32:08,087 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 23:32:08,087 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 23:32:08,087 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 23:32:08,087 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 23:32:08,087 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 23:32:08,087 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 23:32:08,088 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 23:32:08,088 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 23:32:08,088 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 23:32:08,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:32:08 BoogieIcfgContainer [2019-11-23 23:32:08,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:32:08,114 INFO L168 Benchmark]: Toolchain (without parser) took 10049.86 ms. Allocated memory was 139.5 MB in the beginning and 367.5 MB in the end (delta: 228.1 MB). Free memory was 101.6 MB in the beginning and 158.2 MB in the end (delta: -56.7 MB). Peak memory consumption was 171.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:08,115 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-23 23:32:08,116 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.40 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 101.3 MB in the beginning and 167.4 MB in the end (delta: -66.1 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:08,117 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.70 ms. Allocated memory is still 202.9 MB. Free memory was 166.8 MB in the beginning and 161.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:08,118 INFO L168 Benchmark]: Boogie Preprocessor took 85.63 ms. Allocated memory is still 202.9 MB. Free memory was 161.4 MB in the beginning and 156.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:08,119 INFO L168 Benchmark]: RCFGBuilder took 2074.37 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 156.7 MB in the beginning and 186.9 MB in the end (delta: -30.3 MB). Peak memory consumption was 111.6 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:08,120 INFO L168 Benchmark]: TraceAbstraction took 6999.81 ms. Allocated memory was 247.5 MB in the beginning and 367.5 MB in the end (delta: 120.1 MB). Free memory was 186.9 MB in the beginning and 158.2 MB in the end (delta: 28.7 MB). Peak memory consumption was 148.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:08,124 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.20 ms. Allocated memory is still 139.5 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 780.40 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 101.3 MB in the beginning and 167.4 MB in the end (delta: -66.1 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 104.70 ms. Allocated memory is still 202.9 MB. Free memory was 166.8 MB in the beginning and 161.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 85.63 ms. Allocated memory is still 202.9 MB. Free memory was 161.4 MB in the beginning and 156.7 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2074.37 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 156.7 MB in the beginning and 186.9 MB in the end (delta: -30.3 MB). Peak memory consumption was 111.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6999.81 ms. Allocated memory was 247.5 MB in the beginning and 367.5 MB in the end (delta: 120.1 MB). Free memory was 186.9 MB in the beginning and 158.2 MB in the end (delta: 28.7 MB). Peak memory consumption was 148.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 550]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((!(a19 == 1) && a25 == 1) && a11 == 1) && !(a28 == 11)) || ((!(a25 == 1) && a17 == 8) && !(a28 == 11))) || (((a17 <= 7 && a19 == 1) && a28 == 7) && a11 == 1)) || (((a17 <= 7 && !(a25 == 1)) && a19 == 1) && a11 == 1)) || ((a17 == 8 && a19 == 1) && a25 == 1)) || (((((a19 <= 0 && !(a25 == 1)) && a17 == 8) || (((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && !(a28 == 11))) || ((a19 <= 0 && !(a25 == 1)) && !(a28 == 11))) && a11 == 1)) || (((!(a19 == 1) && a17 < 9) && a25 == 1) && !(a28 == 11))) || (((((a19 <= 0 && !(a25 == 1)) && a17 == 8) || (((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && !(a28 == 11))) || ((a19 <= 0 && !(a25 == 1)) && !(a28 == 11))) && a17 < 9) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((!(a19 == 1) && a25 == 1) && a11 == 1) && !(a28 == 11)) || ((!(a25 == 1) && a17 == 8) && !(a28 == 11))) || (((a17 <= 7 && a19 == 1) && a28 == 7) && a11 == 1)) || (((a17 <= 7 && !(a25 == 1)) && a19 == 1) && a11 == 1)) || ((a17 == 8 && a19 == 1) && a25 == 1)) || (((((a19 <= 0 && !(a25 == 1)) && a17 == 8) || (((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && !(a28 == 11))) || ((a19 <= 0 && !(a25 == 1)) && !(a28 == 11))) && a11 == 1)) || (((!(a19 == 1) && a17 < 9) && a25 == 1) && !(a28 == 11))) || (((((a19 <= 0 && !(a25 == 1)) && a17 == 8) || (((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && !(a28 == 11))) || ((a19 <= 0 && !(a25 == 1)) && !(a28 == 11))) && a17 < 9) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 6.9s, OverallIterations: 8, TraceHistogramMax: 5, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 569 SDtfs, 1119 SDslu, 98 SDs, 0 SdLazy, 2688 SolverSat, 659 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 334 GetRequests, 315 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1203occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 1200 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 36 NumberOfFragments, 337 HoareAnnotationTreeSize, 3 FomulaSimplifications, 860 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 536 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1088 NumberOfCodeBlocks, 1088 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1232 ConstructedInterpolants, 0 QuantifiedInterpolants, 286747 SizeOfPredicates, 0 NumberOfNonLiveVariables, 369 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 752/755 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...