/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/eca-rers2012/Problem01_label26.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:52:13,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:52:13,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:52:13,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:52:13,990 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:52:13,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:52:13,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:52:14,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:52:14,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:52:14,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:52:14,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:52:14,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:52:14,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:52:14,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:52:14,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:52:14,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:52:14,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:52:14,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:52:14,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:52:14,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:52:14,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:52:14,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:52:14,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:52:14,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:52:14,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:52:14,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:52:14,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:52:14,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:52:14,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:52:14,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:52:14,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:52:14,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:52:14,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:52:14,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:52:14,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:52:14,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:52:14,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:52:14,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:52:14,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:52:14,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:52:14,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:52:14,054 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 20:52:14,087 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:52:14,088 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:52:14,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:52:14,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:52:14,092 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:52:14,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:52:14,092 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:52:14,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:52:14,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:52:14,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:52:14,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:52:14,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:52:14,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:52:14,094 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:52:14,094 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:52:14,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:52:14,094 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:52:14,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:52:14,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:52:14,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:52:14,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:52:14,096 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:52:14,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:52:14,097 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:52:14,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:52:14,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:52:14,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:52:14,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:52:14,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:52:14,098 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:52:14,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:52:14,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:52:14,394 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:52:14,396 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:52:14,397 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:52:14,397 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label26.c [2019-11-23 20:52:14,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b35b7574b/efc932efd69e4aba954012317ec3a94b/FLAGc21c36729 [2019-11-23 20:52:14,998 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:52:15,000 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label26.c [2019-11-23 20:52:15,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b35b7574b/efc932efd69e4aba954012317ec3a94b/FLAGc21c36729 [2019-11-23 20:52:15,289 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b35b7574b/efc932efd69e4aba954012317ec3a94b [2019-11-23 20:52:15,300 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:52:15,301 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:52:15,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:52:15,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:52:15,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:52:15,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:15" (1/1) ... [2019-11-23 20:52:15,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d08332e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:15, skipping insertion in model container [2019-11-23 20:52:15,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:15" (1/1) ... [2019-11-23 20:52:15,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:52:15,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:52:15,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:52:15,893 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:52:16,008 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:52:16,028 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:52:16,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16 WrapperNode [2019-11-23 20:52:16,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:52:16,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:52:16,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:52:16,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:52:16,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (1/1) ... [2019-11-23 20:52:16,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (1/1) ... [2019-11-23 20:52:16,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:52:16,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:52:16,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:52:16,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:52:16,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (1/1) ... [2019-11-23 20:52:16,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (1/1) ... [2019-11-23 20:52:16,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (1/1) ... [2019-11-23 20:52:16,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (1/1) ... [2019-11-23 20:52:16,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (1/1) ... [2019-11-23 20:52:16,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (1/1) ... [2019-11-23 20:52:16,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (1/1) ... [2019-11-23 20:52:16,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:52:16,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:52:16,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:52:16,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:52:16,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (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 20:52:16,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:52:16,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:52:17,637 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:52:17,637 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:52:17,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:17 BoogieIcfgContainer [2019-11-23 20:52:17,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:52:17,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:52:17,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:52:17,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:52:17,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:52:15" (1/3) ... [2019-11-23 20:52:17,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106d113f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:17, skipping insertion in model container [2019-11-23 20:52:17,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (2/3) ... [2019-11-23 20:52:17,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106d113f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:17, skipping insertion in model container [2019-11-23 20:52:17,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:17" (3/3) ... [2019-11-23 20:52:17,647 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label26.c [2019-11-23 20:52:17,657 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:52:17,665 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:52:17,677 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:52:17,705 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:52:17,705 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:52:17,706 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:52:17,706 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:52:17,706 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:52:17,706 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:52:17,707 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:52:17,707 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:52:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-23 20:52:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-23 20:52:17,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:17,743 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, 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 20:52:17,743 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:17,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:17,750 INFO L82 PathProgramCache]: Analyzing trace with hash -583926962, now seen corresponding path program 1 times [2019-11-23 20:52:17,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:17,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603296383] [2019-11-23 20:52:17,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:18,196 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 20:52:18,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603296383] [2019-11-23 20:52:18,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:18,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:52:18,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881876316] [2019-11-23 20:52:18,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:52:18,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:18,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:52:18,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:52:18,229 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-23 20:52:19,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:19,554 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-23 20:52:19,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:52:19,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-23 20:52:19,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:19,591 INFO L225 Difference]: With dead ends: 662 [2019-11-23 20:52:19,592 INFO L226 Difference]: Without dead ends: 397 [2019-11-23 20:52:19,601 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 20:52:19,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-23 20:52:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-23 20:52:19,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-23 20:52:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 553 transitions. [2019-11-23 20:52:19,690 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 553 transitions. Word has length 103 [2019-11-23 20:52:19,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:19,691 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 553 transitions. [2019-11-23 20:52:19,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:52:19,691 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 553 transitions. [2019-11-23 20:52:19,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-23 20:52:19,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:19,695 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:19,695 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:19,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:19,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1625453403, now seen corresponding path program 1 times [2019-11-23 20:52:19,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:19,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394823832] [2019-11-23 20:52:19,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:52:19,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394823832] [2019-11-23 20:52:19,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:19,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:52:19,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070087638] [2019-11-23 20:52:19,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:52:19,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:19,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:52:19,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:52:19,927 INFO L87 Difference]: Start difference. First operand 397 states and 553 transitions. Second operand 4 states. [2019-11-23 20:52:20,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:20,928 INFO L93 Difference]: Finished difference Result 1447 states and 2019 transitions. [2019-11-23 20:52:20,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:52:20,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-23 20:52:20,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:20,935 INFO L225 Difference]: With dead ends: 1447 [2019-11-23 20:52:20,936 INFO L226 Difference]: Without dead ends: 1052 [2019-11-23 20:52:20,937 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 20:52:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-11-23 20:52:20,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 659. [2019-11-23 20:52:20,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-23 20:52:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 851 transitions. [2019-11-23 20:52:20,977 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 851 transitions. Word has length 110 [2019-11-23 20:52:20,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:20,978 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 851 transitions. [2019-11-23 20:52:20,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:52:20,978 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 851 transitions. [2019-11-23 20:52:20,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-23 20:52:20,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:20,984 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:20,984 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:20,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:20,984 INFO L82 PathProgramCache]: Analyzing trace with hash 733143454, now seen corresponding path program 1 times [2019-11-23 20:52:20,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:20,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765935042] [2019-11-23 20:52:20,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:21,053 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:52:21,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765935042] [2019-11-23 20:52:21,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:21,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:52:21,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887876056] [2019-11-23 20:52:21,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:52:21,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:21,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:52:21,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:52:21,056 INFO L87 Difference]: Start difference. First operand 659 states and 851 transitions. Second operand 4 states. [2019-11-23 20:52:21,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:21,806 INFO L93 Difference]: Finished difference Result 1578 states and 1998 transitions. [2019-11-23 20:52:21,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:52:21,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-11-23 20:52:21,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:21,813 INFO L225 Difference]: With dead ends: 1578 [2019-11-23 20:52:21,813 INFO L226 Difference]: Without dead ends: 790 [2019-11-23 20:52:21,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 20:52:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-23 20:52:21,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-23 20:52:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-23 20:52:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 930 transitions. [2019-11-23 20:52:21,837 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 930 transitions. Word has length 124 [2019-11-23 20:52:21,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:21,838 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 930 transitions. [2019-11-23 20:52:21,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:52:21,838 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 930 transitions. [2019-11-23 20:52:21,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-23 20:52:21,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:21,841 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, 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 20:52:21,842 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:21,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:21,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2001117315, now seen corresponding path program 1 times [2019-11-23 20:52:21,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:21,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315895908] [2019-11-23 20:52:21,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:21,896 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 20:52:21,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315895908] [2019-11-23 20:52:21,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:21,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:52:21,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89558240] [2019-11-23 20:52:21,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:21,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:21,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:21,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:52:21,899 INFO L87 Difference]: Start difference. First operand 790 states and 930 transitions. Second operand 3 states. [2019-11-23 20:52:22,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:22,504 INFO L93 Difference]: Finished difference Result 2233 states and 2643 transitions. [2019-11-23 20:52:22,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:22,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-23 20:52:22,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:22,518 INFO L225 Difference]: With dead ends: 2233 [2019-11-23 20:52:22,518 INFO L226 Difference]: Without dead ends: 1445 [2019-11-23 20:52:22,528 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 20:52:22,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-23 20:52:22,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2019-11-23 20:52:22,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-23 20:52:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1374 transitions. [2019-11-23 20:52:22,591 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1374 transitions. Word has length 125 [2019-11-23 20:52:22,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:22,593 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1374 transitions. [2019-11-23 20:52:22,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:22,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1374 transitions. [2019-11-23 20:52:22,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-23 20:52:22,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:22,604 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:22,604 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:22,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:22,605 INFO L82 PathProgramCache]: Analyzing trace with hash 891303243, now seen corresponding path program 1 times [2019-11-23 20:52:22,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:22,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096905069] [2019-11-23 20:52:22,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-23 20:52:22,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096905069] [2019-11-23 20:52:22,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:22,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:52:22,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206631094] [2019-11-23 20:52:22,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:22,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:22,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:22,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:52:22,759 INFO L87 Difference]: Start difference. First operand 1183 states and 1374 transitions. Second operand 3 states. [2019-11-23 20:52:23,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:23,337 INFO L93 Difference]: Finished difference Result 3150 states and 3674 transitions. [2019-11-23 20:52:23,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:23,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-11-23 20:52:23,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:23,347 INFO L225 Difference]: With dead ends: 3150 [2019-11-23 20:52:23,348 INFO L226 Difference]: Without dead ends: 1969 [2019-11-23 20:52:23,351 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 20:52:23,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-23 20:52:23,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1445. [2019-11-23 20:52:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-23 20:52:23,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1682 transitions. [2019-11-23 20:52:23,386 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1682 transitions. Word has length 129 [2019-11-23 20:52:23,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:23,387 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1682 transitions. [2019-11-23 20:52:23,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:23,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1682 transitions. [2019-11-23 20:52:23,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-23 20:52:23,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:23,391 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:23,391 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:23,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:23,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1514660785, now seen corresponding path program 1 times [2019-11-23 20:52:23,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:23,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741765956] [2019-11-23 20:52:23,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:52:23,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741765956] [2019-11-23 20:52:23,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:23,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:52:23,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131743765] [2019-11-23 20:52:23,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:23,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:23,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:23,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:52:23,467 INFO L87 Difference]: Start difference. First operand 1445 states and 1682 transitions. Second operand 3 states. [2019-11-23 20:52:23,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:23,935 INFO L93 Difference]: Finished difference Result 3019 states and 3514 transitions. [2019-11-23 20:52:23,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:23,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-23 20:52:23,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:23,943 INFO L225 Difference]: With dead ends: 3019 [2019-11-23 20:52:23,943 INFO L226 Difference]: Without dead ends: 1576 [2019-11-23 20:52:23,946 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 20:52:23,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-23 20:52:23,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2019-11-23 20:52:23,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-23 20:52:23,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1682 transitions. [2019-11-23 20:52:23,977 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1682 transitions. Word has length 131 [2019-11-23 20:52:23,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:23,977 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1682 transitions. [2019-11-23 20:52:23,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:23,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1682 transitions. [2019-11-23 20:52:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-23 20:52:23,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:23,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:23,982 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:23,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:23,982 INFO L82 PathProgramCache]: Analyzing trace with hash 263294258, now seen corresponding path program 1 times [2019-11-23 20:52:23,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:23,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950910165] [2019-11-23 20:52:23,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:52:24,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950910165] [2019-11-23 20:52:24,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:24,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:52:24,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349511738] [2019-11-23 20:52:24,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:24,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:24,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:24,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:52:24,041 INFO L87 Difference]: Start difference. First operand 1445 states and 1682 transitions. Second operand 3 states. [2019-11-23 20:52:24,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:24,507 INFO L93 Difference]: Finished difference Result 3281 states and 3792 transitions. [2019-11-23 20:52:24,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:24,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-23 20:52:24,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:24,516 INFO L225 Difference]: With dead ends: 3281 [2019-11-23 20:52:24,516 INFO L226 Difference]: Without dead ends: 1838 [2019-11-23 20:52:24,518 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 20:52:24,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-23 20:52:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2019-11-23 20:52:24,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-23 20:52:24,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1965 transitions. [2019-11-23 20:52:24,586 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1965 transitions. Word has length 132 [2019-11-23 20:52:24,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:24,586 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1965 transitions. [2019-11-23 20:52:24,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:24,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1965 transitions. [2019-11-23 20:52:24,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-23 20:52:24,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:24,590 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:24,591 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:24,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:24,591 INFO L82 PathProgramCache]: Analyzing trace with hash 294946666, now seen corresponding path program 1 times [2019-11-23 20:52:24,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:24,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122933610] [2019-11-23 20:52:24,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:24,766 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:52:24,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122933610] [2019-11-23 20:52:24,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:24,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 20:52:24,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142273863] [2019-11-23 20:52:24,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 20:52:24,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:24,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 20:52:24,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:52:24,768 INFO L87 Difference]: Start difference. First operand 1707 states and 1965 transitions. Second operand 8 states. [2019-11-23 20:52:26,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:26,007 INFO L93 Difference]: Finished difference Result 3582 states and 4117 transitions. [2019-11-23 20:52:26,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 20:52:26,009 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 136 [2019-11-23 20:52:26,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:26,027 INFO L225 Difference]: With dead ends: 3582 [2019-11-23 20:52:26,028 INFO L226 Difference]: Without dead ends: 2008 [2019-11-23 20:52:26,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:52:26,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2019-11-23 20:52:26,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1707. [2019-11-23 20:52:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-23 20:52:26,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1953 transitions. [2019-11-23 20:52:26,068 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1953 transitions. Word has length 136 [2019-11-23 20:52:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:26,069 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1953 transitions. [2019-11-23 20:52:26,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 20:52:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1953 transitions. [2019-11-23 20:52:26,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-23 20:52:26,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:26,073 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, 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] [2019-11-23 20:52:26,073 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:26,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:26,074 INFO L82 PathProgramCache]: Analyzing trace with hash 2118430365, now seen corresponding path program 1 times [2019-11-23 20:52:26,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:26,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996726032] [2019-11-23 20:52:26,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:26,187 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:52:26,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996726032] [2019-11-23 20:52:26,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:26,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:52:26,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367206380] [2019-11-23 20:52:26,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:26,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:26,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:26,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:52:26,196 INFO L87 Difference]: Start difference. First operand 1707 states and 1953 transitions. Second operand 3 states. [2019-11-23 20:52:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:26,590 INFO L93 Difference]: Finished difference Result 2102 states and 2422 transitions. [2019-11-23 20:52:26,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:26,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-11-23 20:52:26,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:26,601 INFO L225 Difference]: With dead ends: 2102 [2019-11-23 20:52:26,602 INFO L226 Difference]: Without dead ends: 2100 [2019-11-23 20:52:26,603 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 20:52:26,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-23 20:52:26,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2019-11-23 20:52:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-23 20:52:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2129 transitions. [2019-11-23 20:52:26,645 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2129 transitions. Word has length 162 [2019-11-23 20:52:26,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:26,645 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2129 transitions. [2019-11-23 20:52:26,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:26,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2129 transitions. [2019-11-23 20:52:26,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-23 20:52:26,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:26,651 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:26,651 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:26,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:26,652 INFO L82 PathProgramCache]: Analyzing trace with hash 172823534, now seen corresponding path program 1 times [2019-11-23 20:52:26,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:26,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172238551] [2019-11-23 20:52:26,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-23 20:52:26,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172238551] [2019-11-23 20:52:26,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:26,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:52:26,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233299744] [2019-11-23 20:52:26,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:26,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:26,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:26,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:52:26,715 INFO L87 Difference]: Start difference. First operand 1838 states and 2129 transitions. Second operand 3 states. [2019-11-23 20:52:27,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:27,176 INFO L93 Difference]: Finished difference Result 3674 states and 4254 transitions. [2019-11-23 20:52:27,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:27,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-23 20:52:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:27,186 INFO L225 Difference]: With dead ends: 3674 [2019-11-23 20:52:27,186 INFO L226 Difference]: Without dead ends: 1838 [2019-11-23 20:52:27,190 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 20:52:27,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-23 20:52:27,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-23 20:52:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-23 20:52:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2011 transitions. [2019-11-23 20:52:27,236 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2011 transitions. Word has length 167 [2019-11-23 20:52:27,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:27,244 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2011 transitions. [2019-11-23 20:52:27,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:27,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2011 transitions. [2019-11-23 20:52:27,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-23 20:52:27,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:27,249 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:27,250 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:27,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:27,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1369122589, now seen corresponding path program 1 times [2019-11-23 20:52:27,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:27,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423858451] [2019-11-23 20:52:27,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-23 20:52:27,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423858451] [2019-11-23 20:52:27,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:27,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:52:27,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601099897] [2019-11-23 20:52:27,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:27,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:27,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:27,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:52:27,363 INFO L87 Difference]: Start difference. First operand 1838 states and 2011 transitions. Second operand 3 states. [2019-11-23 20:52:27,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:27,744 INFO L93 Difference]: Finished difference Result 3674 states and 4020 transitions. [2019-11-23 20:52:27,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:27,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-11-23 20:52:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:27,752 INFO L225 Difference]: With dead ends: 3674 [2019-11-23 20:52:27,753 INFO L226 Difference]: Without dead ends: 1838 [2019-11-23 20:52:27,755 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 20:52:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-23 20:52:27,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2019-11-23 20:52:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-23 20:52:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1855 transitions. [2019-11-23 20:52:27,789 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1855 transitions. Word has length 197 [2019-11-23 20:52:27,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:27,789 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1855 transitions. [2019-11-23 20:52:27,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:27,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1855 transitions. [2019-11-23 20:52:27,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-23 20:52:27,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:27,795 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:27,796 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:27,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:27,796 INFO L82 PathProgramCache]: Analyzing trace with hash 2102385007, now seen corresponding path program 1 times [2019-11-23 20:52:27,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:27,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602661608] [2019-11-23 20:52:27,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 181 proven. 93 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-23 20:52:28,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602661608] [2019-11-23 20:52:28,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986573595] [2019-11-23 20:52:28,099 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 20:52:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:28,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:52:28,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:52:28,318 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-11-23 20:52:28,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:52:28,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-23 20:52:28,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634510703] [2019-11-23 20:52:28,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:28,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:28,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:28,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-23 20:52:28,321 INFO L87 Difference]: Start difference. First operand 1707 states and 1855 transitions. Second operand 3 states. [2019-11-23 20:52:28,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:28,699 INFO L93 Difference]: Finished difference Result 3410 states and 3720 transitions. [2019-11-23 20:52:28,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:28,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-11-23 20:52:28,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:28,700 INFO L225 Difference]: With dead ends: 3410 [2019-11-23 20:52:28,701 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:52:28,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 227 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-23 20:52:28,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:52:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:52:28,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:52:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:52:28,705 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 226 [2019-11-23 20:52:28,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:28,705 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:52:28,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:52:28,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:52:28,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:52:28,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:52:29,139 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 20:52:29,140 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 20:52:29,140 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,140 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,140 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,140 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,140 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,140 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,141 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 20:52:29,141 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 20:52:29,141 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-23 20:52:29,141 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-23 20:52:29,141 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-23 20:52:29,141 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-23 20:52:29,141 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-23 20:52:29,142 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-23 20:52:29,142 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 20:52:29,142 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 20:52:29,142 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,142 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,143 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,143 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,143 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,143 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,143 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 20:52:29,143 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 20:52:29,143 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-23 20:52:29,144 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-23 20:52:29,144 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-23 20:52:29,144 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-23 20:52:29,144 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-23 20:52:29,144 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-23 20:52:29,144 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 20:52:29,144 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 20:52:29,144 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 20:52:29,145 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 20:52:29,145 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 20:52:29,145 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 20:52:29,145 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-23 20:52:29,145 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,145 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,145 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,145 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,146 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,146 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 20:52:29,146 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 20:52:29,146 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-23 20:52:29,146 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-23 20:52:29,146 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-23 20:52:29,146 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-23 20:52:29,146 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-23 20:52:29,147 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-23 20:52:29,147 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 20:52:29,147 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (not (= 15 ~a8~0)) (and (not (= 1 ~a7~0)) .cse0 (= ~a20~0 1)) (and .cse0 (<= ~a20~0 0)))) [2019-11-23 20:52:29,147 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,147 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,147 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,148 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,148 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,148 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 20:52:29,148 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-23 20:52:29,148 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-23 20:52:29,148 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-23 20:52:29,148 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-23 20:52:29,149 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-23 20:52:29,149 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 20:52:29,149 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 20:52:29,149 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 20:52:29,149 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 20:52:29,149 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 20:52:29,149 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 20:52:29,149 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 20:52:29,149 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 20:52:29,150 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,150 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,150 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,150 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,150 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,150 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 20:52:29,150 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 20:52:29,150 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 20:52:29,151 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-23 20:52:29,151 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-23 20:52:29,151 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-23 20:52:29,151 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-23 20:52:29,151 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-23 20:52:29,151 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 20:52:29,151 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,151 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,152 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,152 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,152 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 20:52:29,152 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,152 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 20:52:29,152 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 20:52:29,152 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-23 20:52:29,152 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-23 20:52:29,153 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-23 20:52:29,153 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-23 20:52:29,153 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-23 20:52:29,153 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:52:29,153 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 20:52:29,153 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 20:52:29,153 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 20:52:29,154 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 20:52:29,154 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 20:52:29,154 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 20:52:29,154 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,154 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (not (= 15 ~a8~0)) (and (not (= 1 ~a7~0)) .cse0 (= ~a20~0 1)) (and .cse0 (<= ~a20~0 0)))) [2019-11-23 20:52:29,154 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,154 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,154 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,155 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,155 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 20:52:29,155 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-23 20:52:29,155 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-23 20:52:29,155 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-23 20:52:29,155 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-23 20:52:29,155 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-23 20:52:29,155 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 20:52:29,155 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 20:52:29,156 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,156 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,156 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,156 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,156 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,156 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 20:52:29,156 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:52:29,156 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 20:52:29,157 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 20:52:29,157 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 20:52:29,157 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-23 20:52:29,157 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-23 20:52:29,157 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-23 20:52:29,157 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-23 20:52:29,157 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-23 20:52:29,157 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 20:52:29,158 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 20:52:29,158 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 20:52:29,158 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,158 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,158 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,158 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,158 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-23 20:52:29,158 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,158 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,159 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 20:52:29,159 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 20:52:29,159 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:52:29,159 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-23 20:52:29,159 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-23 20:52:29,159 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-23 20:52:29,159 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-23 20:52:29,159 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-23 20:52:29,159 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-23 20:52:29,160 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 20:52:29,160 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 20:52:29,160 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 20:52:29,160 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 20:52:29,160 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,160 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,160 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,160 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,160 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,161 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 20:52:29,161 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,161 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 20:52:29,161 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 20:52:29,161 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-23 20:52:29,161 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-23 20:52:29,161 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-23 20:52:29,161 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-23 20:52:29,162 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-23 20:52:29,162 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-23 20:52:29,162 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 20:52:29,162 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 20:52:29,162 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 20:52:29,162 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:52:29,162 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 485) no Hoare annotation was computed. [2019-11-23 20:52:29,162 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 20:52:29,163 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 20:52:29,163 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 20:52:29,163 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,163 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,163 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,163 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,163 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,163 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:29,164 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 20:52:29,164 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-23 20:52:29,164 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-23 20:52:29,164 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-23 20:52:29,164 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-23 20:52:29,164 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-23 20:52:29,164 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-23 20:52:29,164 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 20:52:29,165 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 20:52:29,165 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 20:52:29,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:52:29 BoogieIcfgContainer [2019-11-23 20:52:29,182 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:52:29,184 INFO L168 Benchmark]: Toolchain (without parser) took 13882.54 ms. Allocated memory was 147.3 MB in the beginning and 458.2 MB in the end (delta: 310.9 MB). Free memory was 103.7 MB in the beginning and 388.9 MB in the end (delta: -285.2 MB). Peak memory consumption was 267.4 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:29,185 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 147.3 MB. Free memory is still 123.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-23 20:52:29,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.67 ms. Allocated memory was 147.3 MB in the beginning and 205.5 MB in the end (delta: 58.2 MB). Free memory was 103.3 MB in the beginning and 164.0 MB in the end (delta: -60.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:29,187 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.49 ms. Allocated memory is still 205.5 MB. Free memory was 164.0 MB in the beginning and 158.1 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:29,187 INFO L168 Benchmark]: Boogie Preprocessor took 106.32 ms. Allocated memory is still 205.5 MB. Free memory was 158.1 MB in the beginning and 154.3 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:29,188 INFO L168 Benchmark]: RCFGBuilder took 1393.31 ms. Allocated memory was 205.5 MB in the beginning and 236.5 MB in the end (delta: 30.9 MB). Free memory was 154.3 MB in the beginning and 158.8 MB in the end (delta: -4.5 MB). Peak memory consumption was 69.1 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:29,189 INFO L168 Benchmark]: TraceAbstraction took 11541.75 ms. Allocated memory was 236.5 MB in the beginning and 458.2 MB in the end (delta: 221.8 MB). Free memory was 158.8 MB in the beginning and 388.9 MB in the end (delta: -230.1 MB). Peak memory consumption was 233.3 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:29,193 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.23 ms. Allocated memory is still 147.3 MB. Free memory is still 123.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 723.67 ms. Allocated memory was 147.3 MB in the beginning and 205.5 MB in the end (delta: 58.2 MB). Free memory was 103.3 MB in the beginning and 164.0 MB in the end (delta: -60.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 106.49 ms. Allocated memory is still 205.5 MB. Free memory was 164.0 MB in the beginning and 158.1 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 106.32 ms. Allocated memory is still 205.5 MB. Free memory was 158.1 MB in the beginning and 154.3 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1393.31 ms. Allocated memory was 205.5 MB in the beginning and 236.5 MB in the end (delta: 30.9 MB). Free memory was 154.3 MB in the beginning and 158.8 MB in the end (delta: -4.5 MB). Peak memory consumption was 69.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11541.75 ms. Allocated memory was 236.5 MB in the beginning and 458.2 MB in the end (delta: 221.8 MB). Free memory was 158.8 MB in the beginning and 388.9 MB in the end (delta: -230.1 MB). Peak memory consumption was 233.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 485]: 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: 30]: Loop Invariant Derived loop invariant: (!(15 == a8) || ((!(1 == a7) && a21 == 1) && a20 == 1)) || (a21 == 1 && a20 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (!(15 == a8) || ((!(1 == a7) && a21 == 1) && a20 == 1)) || (a21 == 1 && a20 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 11.4s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 775 SDtfs, 1975 SDslu, 106 SDs, 0 SdLazy, 5458 SolverSat, 856 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 240 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 2135 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 40 NumberOfFragments, 47 HoareAnnotationTreeSize, 3 FomulaSimplifications, 20956 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1968 NumberOfCodeBlocks, 1968 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1955 ConstructedInterpolants, 0 QuantifiedInterpolants, 719614 SizeOfPredicates, 1 NumberOfNonLiveVariables, 432 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1058/1151 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...