/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/Problem02_label19.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:53:55,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:53:55,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:53:55,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:53:55,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:53:55,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:53:55,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:53:55,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:53:55,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:53:55,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:53:55,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:53:55,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:53:55,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:53:55,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:53:55,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:53:55,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:53:55,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:53:55,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:53:55,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:53:55,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:53:55,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:53:55,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:53:55,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:53:55,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:53:55,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:53:55,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:53:55,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:53:55,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:53:55,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:53:55,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:53:55,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:53:55,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:53:55,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:53:55,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:53:55,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:53:55,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:53:55,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:53:55,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:53:55,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:53:55,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:53:55,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:53:55,957 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:53:55,976 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:53:55,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:53:55,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:53:55,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:53:55,979 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:53:55,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:53:55,979 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:53:55,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:53:55,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:53:55,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:53:55,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:53:55,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:53:55,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:53:55,982 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:53:55,982 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:53:55,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:53:55,983 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:53:55,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:53:55,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:53:55,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:53:55,984 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:53:55,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:53:55,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:53:55,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:53:55,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:53:55,985 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:53:55,985 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:53:55,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:53:55,985 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:53:55,985 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:53:56,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:53:56,290 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:53:56,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:53:56,296 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:53:56,296 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:53:56,297 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label19.c [2019-11-23 20:53:56,361 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28eb9b05e/a9bcae80abc540ebbae67ed9e8b37c35/FLAG0255bb046 [2019-11-23 20:53:56,966 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:53:56,972 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label19.c [2019-11-23 20:53:56,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28eb9b05e/a9bcae80abc540ebbae67ed9e8b37c35/FLAG0255bb046 [2019-11-23 20:53:57,250 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28eb9b05e/a9bcae80abc540ebbae67ed9e8b37c35 [2019-11-23 20:53:57,264 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:53:57,265 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:53:57,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:53:57,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:53:57,270 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:53:57,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:53:57" (1/1) ... [2019-11-23 20:53:57,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa1d389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:57, skipping insertion in model container [2019-11-23 20:53:57,275 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:53:57" (1/1) ... [2019-11-23 20:53:57,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:53:57,345 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:53:57,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:53:57,836 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:53:57,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:53:57,952 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:53:57,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:57 WrapperNode [2019-11-23 20:53:57,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:53:57,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:53:57,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:53:57,954 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:53:57,963 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:53:57" (1/1) ... [2019-11-23 20:53:57,981 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:53:57" (1/1) ... [2019-11-23 20:53:58,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:53:58,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:53:58,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:53:58,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:53:58,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:57" (1/1) ... [2019-11-23 20:53:58,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:57" (1/1) ... [2019-11-23 20:53:58,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:57" (1/1) ... [2019-11-23 20:53:58,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:57" (1/1) ... [2019-11-23 20:53:58,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:57" (1/1) ... [2019-11-23 20:53:58,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:57" (1/1) ... [2019-11-23 20:53:58,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:57" (1/1) ... [2019-11-23 20:53:58,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:53:58,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:53:58,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:53:58,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:53:58,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:57" (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:53:58,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:53:58,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:53:59,514 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:53:59,514 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:53:59,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:53:59 BoogieIcfgContainer [2019-11-23 20:53:59,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:53:59,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:53:59,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:53:59,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:53:59,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:53:57" (1/3) ... [2019-11-23 20:53:59,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3b36da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:53:59, skipping insertion in model container [2019-11-23 20:53:59,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:57" (2/3) ... [2019-11-23 20:53:59,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3b36da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:53:59, skipping insertion in model container [2019-11-23 20:53:59,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:53:59" (3/3) ... [2019-11-23 20:53:59,526 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label19.c [2019-11-23 20:53:59,537 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:53:59,546 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:53:59,559 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:53:59,591 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:53:59,592 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:53:59,592 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:53:59,592 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:53:59,592 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:53:59,593 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:53:59,593 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:53:59,593 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:53:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-23 20:53:59,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-23 20:53:59,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:53:59,637 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] [2019-11-23 20:53:59,638 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:53:59,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:53:59,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1607169461, now seen corresponding path program 1 times [2019-11-23 20:53:59,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:53:59,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562566010] [2019-11-23 20:53:59,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:53:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:00,125 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:54:00,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562566010] [2019-11-23 20:54:00,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:00,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:54:00,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748177690] [2019-11-23 20:54:00,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:54:00,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:00,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:54:00,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:00,152 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-11-23 20:54:01,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:01,586 INFO L93 Difference]: Finished difference Result 789 states and 1377 transitions. [2019-11-23 20:54:01,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:54:01,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-23 20:54:01,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:01,613 INFO L225 Difference]: With dead ends: 789 [2019-11-23 20:54:01,613 INFO L226 Difference]: Without dead ends: 465 [2019-11-23 20:54:01,624 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:54:01,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-11-23 20:54:01,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 309. [2019-11-23 20:54:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-23 20:54:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 453 transitions. [2019-11-23 20:54:01,724 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 453 transitions. Word has length 92 [2019-11-23 20:54:01,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:01,725 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 453 transitions. [2019-11-23 20:54:01,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:54:01,725 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 453 transitions. [2019-11-23 20:54:01,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-23 20:54:01,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:01,735 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 20:54:01,736 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:01,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:01,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1513780896, now seen corresponding path program 1 times [2019-11-23 20:54:01,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:01,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490361570] [2019-11-23 20:54:01,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:54:01,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490361570] [2019-11-23 20:54:01,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:01,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:54:01,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924453643] [2019-11-23 20:54:01,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:54:01,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:01,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:54:01,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:54:01,896 INFO L87 Difference]: Start difference. First operand 309 states and 453 transitions. Second operand 3 states. [2019-11-23 20:54:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:02,559 INFO L93 Difference]: Finished difference Result 899 states and 1323 transitions. [2019-11-23 20:54:02,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:54:02,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-23 20:54:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:02,564 INFO L225 Difference]: With dead ends: 899 [2019-11-23 20:54:02,564 INFO L226 Difference]: Without dead ends: 592 [2019-11-23 20:54:02,565 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:54:02,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-11-23 20:54:02,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-11-23 20:54:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-23 20:54:02,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 765 transitions. [2019-11-23 20:54:02,591 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 765 transitions. Word has length 96 [2019-11-23 20:54:02,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:02,592 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 765 transitions. [2019-11-23 20:54:02,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:54:02,592 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 765 transitions. [2019-11-23 20:54:02,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 20:54:02,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:02,596 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-11-23 20:54:02,597 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:02,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:02,597 INFO L82 PathProgramCache]: Analyzing trace with hash 308279990, now seen corresponding path program 1 times [2019-11-23 20:54:02,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:02,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409726301] [2019-11-23 20:54:02,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:02,710 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:54:02,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409726301] [2019-11-23 20:54:02,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:02,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:54:02,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185191011] [2019-11-23 20:54:02,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:54:02,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:02,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:54:02,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:02,713 INFO L87 Difference]: Start difference. First operand 592 states and 765 transitions. Second operand 4 states. [2019-11-23 20:54:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:03,870 INFO L93 Difference]: Finished difference Result 2169 states and 2837 transitions. [2019-11-23 20:54:03,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:54:03,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-23 20:54:03,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:03,879 INFO L225 Difference]: With dead ends: 2169 [2019-11-23 20:54:03,879 INFO L226 Difference]: Without dead ends: 1437 [2019-11-23 20:54:03,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:54:03,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2019-11-23 20:54:03,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1150. [2019-11-23 20:54:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-11-23 20:54:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1467 transitions. [2019-11-23 20:54:03,914 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1467 transitions. Word has length 101 [2019-11-23 20:54:03,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:03,914 INFO L462 AbstractCegarLoop]: Abstraction has 1150 states and 1467 transitions. [2019-11-23 20:54:03,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:54:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1467 transitions. [2019-11-23 20:54:03,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-23 20:54:03,919 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:03,920 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-23 20:54:03,920 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:03,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:03,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1263008387, now seen corresponding path program 1 times [2019-11-23 20:54:03,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:03,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152466374] [2019-11-23 20:54:03,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:03,964 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:54:03,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152466374] [2019-11-23 20:54:03,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:03,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:54:03,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167704048] [2019-11-23 20:54:03,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:54:03,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:03,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:54:03,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:54:03,967 INFO L87 Difference]: Start difference. First operand 1150 states and 1467 transitions. Second operand 3 states. [2019-11-23 20:54:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:04,527 INFO L93 Difference]: Finished difference Result 3278 states and 4207 transitions. [2019-11-23 20:54:04,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:54:04,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-11-23 20:54:04,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:04,542 INFO L225 Difference]: With dead ends: 3278 [2019-11-23 20:54:04,542 INFO L226 Difference]: Without dead ends: 2130 [2019-11-23 20:54:04,545 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:54:04,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2019-11-23 20:54:04,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 1850. [2019-11-23 20:54:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2019-11-23 20:54:04,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2333 transitions. [2019-11-23 20:54:04,652 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2333 transitions. Word has length 109 [2019-11-23 20:54:04,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:04,652 INFO L462 AbstractCegarLoop]: Abstraction has 1850 states and 2333 transitions. [2019-11-23 20:54:04,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:54:04,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2333 transitions. [2019-11-23 20:54:04,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 20:54:04,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:04,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:04,660 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:04,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:04,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1854205693, now seen corresponding path program 1 times [2019-11-23 20:54:04,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:04,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152115760] [2019-11-23 20:54:04,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:54:04,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152115760] [2019-11-23 20:54:04,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:04,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:54:04,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049781110] [2019-11-23 20:54:04,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:54:04,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:04,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:54:04,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:04,758 INFO L87 Difference]: Start difference. First operand 1850 states and 2333 transitions. Second operand 4 states. [2019-11-23 20:54:05,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:05,544 INFO L93 Difference]: Finished difference Result 3984 states and 4981 transitions. [2019-11-23 20:54:05,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:54:05,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-23 20:54:05,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:05,556 INFO L225 Difference]: With dead ends: 3984 [2019-11-23 20:54:05,556 INFO L226 Difference]: Without dead ends: 2136 [2019-11-23 20:54:05,559 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:54:05,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2019-11-23 20:54:05,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 2131. [2019-11-23 20:54:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-11-23 20:54:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2423 transitions. [2019-11-23 20:54:05,611 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2423 transitions. Word has length 150 [2019-11-23 20:54:05,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:05,612 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 2423 transitions. [2019-11-23 20:54:05,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:54:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2423 transitions. [2019-11-23 20:54:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-23 20:54:05,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:05,641 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 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] [2019-11-23 20:54:05,642 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:05,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:05,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2077294402, now seen corresponding path program 1 times [2019-11-23 20:54:05,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:05,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796619392] [2019-11-23 20:54:05,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:05,727 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:54:05,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796619392] [2019-11-23 20:54:05,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:05,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:54:05,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771512005] [2019-11-23 20:54:05,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:54:05,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:05,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:54:05,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:54:05,731 INFO L87 Difference]: Start difference. First operand 2131 states and 2423 transitions. Second operand 3 states. [2019-11-23 20:54:06,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:06,259 INFO L93 Difference]: Finished difference Result 4266 states and 4853 transitions. [2019-11-23 20:54:06,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:54:06,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-11-23 20:54:06,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:06,269 INFO L225 Difference]: With dead ends: 4266 [2019-11-23 20:54:06,269 INFO L226 Difference]: Without dead ends: 2137 [2019-11-23 20:54:06,273 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:54:06,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2019-11-23 20:54:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2131. [2019-11-23 20:54:06,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-11-23 20:54:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2379 transitions. [2019-11-23 20:54:06,316 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2379 transitions. Word has length 159 [2019-11-23 20:54:06,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:06,317 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 2379 transitions. [2019-11-23 20:54:06,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:54:06,317 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2379 transitions. [2019-11-23 20:54:06,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-23 20:54:06,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:06,322 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-11-23 20:54:06,322 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:06,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:06,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1420578269, now seen corresponding path program 1 times [2019-11-23 20:54:06,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:06,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558663674] [2019-11-23 20:54:06,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-23 20:54:06,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558663674] [2019-11-23 20:54:06,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:06,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:54:06,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545215305] [2019-11-23 20:54:06,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:54:06,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:06,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:54:06,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:06,388 INFO L87 Difference]: Start difference. First operand 2131 states and 2379 transitions. Second operand 4 states. [2019-11-23 20:54:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:06,947 INFO L93 Difference]: Finished difference Result 4258 states and 4754 transitions. [2019-11-23 20:54:06,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:54:06,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-23 20:54:06,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:06,955 INFO L225 Difference]: With dead ends: 4258 [2019-11-23 20:54:06,955 INFO L226 Difference]: Without dead ends: 2129 [2019-11-23 20:54:06,958 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:54:06,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2019-11-23 20:54:06,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 2129. [2019-11-23 20:54:06,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2129 states. [2019-11-23 20:54:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 2307 transitions. [2019-11-23 20:54:06,996 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 2307 transitions. Word has length 161 [2019-11-23 20:54:06,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:06,996 INFO L462 AbstractCegarLoop]: Abstraction has 2129 states and 2307 transitions. [2019-11-23 20:54:06,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:54:06,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2307 transitions. [2019-11-23 20:54:07,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-23 20:54:07,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:07,001 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-11-23 20:54:07,001 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:07,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:07,002 INFO L82 PathProgramCache]: Analyzing trace with hash 72359917, now seen corresponding path program 1 times [2019-11-23 20:54:07,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:07,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004122599] [2019-11-23 20:54:07,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-23 20:54:07,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004122599] [2019-11-23 20:54:07,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:07,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:54:07,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392298065] [2019-11-23 20:54:07,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:54:07,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:07,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:54:07,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:54:07,057 INFO L87 Difference]: Start difference. First operand 2129 states and 2307 transitions. Second operand 3 states. [2019-11-23 20:54:07,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:07,549 INFO L93 Difference]: Finished difference Result 4538 states and 4924 transitions. [2019-11-23 20:54:07,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:54:07,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-11-23 20:54:07,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:07,559 INFO L225 Difference]: With dead ends: 4538 [2019-11-23 20:54:07,559 INFO L226 Difference]: Without dead ends: 2270 [2019-11-23 20:54:07,563 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:54:07,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2019-11-23 20:54:07,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 2268. [2019-11-23 20:54:07,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2268 states. [2019-11-23 20:54:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 2449 transitions. [2019-11-23 20:54:07,606 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 2449 transitions. Word has length 170 [2019-11-23 20:54:07,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:07,607 INFO L462 AbstractCegarLoop]: Abstraction has 2268 states and 2449 transitions. [2019-11-23 20:54:07,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:54:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 2449 transitions. [2019-11-23 20:54:07,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-23 20:54:07,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:07,613 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:07,613 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:07,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:07,613 INFO L82 PathProgramCache]: Analyzing trace with hash -648360830, now seen corresponding path program 1 times [2019-11-23 20:54:07,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:07,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288955522] [2019-11-23 20:54:07,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-23 20:54:07,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288955522] [2019-11-23 20:54:07,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:07,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:54:07,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781487777] [2019-11-23 20:54:07,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:54:07,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:07,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:54:07,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:07,748 INFO L87 Difference]: Start difference. First operand 2268 states and 2449 transitions. Second operand 4 states. [2019-11-23 20:54:08,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:08,601 INFO L93 Difference]: Finished difference Result 5239 states and 5687 transitions. [2019-11-23 20:54:08,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:54:08,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-11-23 20:54:08,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:08,613 INFO L225 Difference]: With dead ends: 5239 [2019-11-23 20:54:08,613 INFO L226 Difference]: Without dead ends: 2973 [2019-11-23 20:54:08,616 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:54:08,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2019-11-23 20:54:08,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2689. [2019-11-23 20:54:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2689 states. [2019-11-23 20:54:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 2886 transitions. [2019-11-23 20:54:08,667 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 2886 transitions. Word has length 171 [2019-11-23 20:54:08,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:08,667 INFO L462 AbstractCegarLoop]: Abstraction has 2689 states and 2886 transitions. [2019-11-23 20:54:08,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:54:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 2886 transitions. [2019-11-23 20:54:08,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-23 20:54:08,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:08,673 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 20:54:08,673 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:08,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:08,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1613967385, now seen corresponding path program 1 times [2019-11-23 20:54:08,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:08,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170230622] [2019-11-23 20:54:08,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:54:08,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170230622] [2019-11-23 20:54:08,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:08,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:54:08,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817896684] [2019-11-23 20:54:08,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:54:08,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:08,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:54:08,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:08,843 INFO L87 Difference]: Start difference. First operand 2689 states and 2886 transitions. Second operand 4 states. [2019-11-23 20:54:09,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:09,589 INFO L93 Difference]: Finished difference Result 5658 states and 6067 transitions. [2019-11-23 20:54:09,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:54:09,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-11-23 20:54:09,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:09,597 INFO L225 Difference]: With dead ends: 5658 [2019-11-23 20:54:09,598 INFO L226 Difference]: Without dead ends: 2550 [2019-11-23 20:54:09,601 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:54:09,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2019-11-23 20:54:09,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2406. [2019-11-23 20:54:09,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2406 states. [2019-11-23 20:54:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 2525 transitions. [2019-11-23 20:54:09,634 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 2525 transitions. Word has length 194 [2019-11-23 20:54:09,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:09,635 INFO L462 AbstractCegarLoop]: Abstraction has 2406 states and 2525 transitions. [2019-11-23 20:54:09,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:54:09,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 2525 transitions. [2019-11-23 20:54:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-23 20:54:09,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:09,641 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:54:09,641 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:09,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:09,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1509674929, now seen corresponding path program 1 times [2019-11-23 20:54:09,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:09,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118038767] [2019-11-23 20:54:09,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:09,726 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 106 proven. 8 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-23 20:54:09,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118038767] [2019-11-23 20:54:09,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656798194] [2019-11-23 20:54:09,726 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:54:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:09,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:54:09,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:54:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-23 20:54:09,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:54:09,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-11-23 20:54:09,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035143011] [2019-11-23 20:54:09,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:54:09,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:09,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:54:09,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:54:09,998 INFO L87 Difference]: Start difference. First operand 2406 states and 2525 transitions. Second operand 3 states. [2019-11-23 20:54:10,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:10,217 INFO L93 Difference]: Finished difference Result 4380 states and 4595 transitions. [2019-11-23 20:54:10,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:54:10,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-11-23 20:54:10,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:10,221 INFO L225 Difference]: With dead ends: 4380 [2019-11-23 20:54:10,221 INFO L226 Difference]: Without dead ends: 992 [2019-11-23 20:54:10,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 200 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:54:10,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-11-23 20:54:10,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2019-11-23 20:54:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2019-11-23 20:54:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1026 transitions. [2019-11-23 20:54:10,242 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1026 transitions. Word has length 201 [2019-11-23 20:54:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:10,243 INFO L462 AbstractCegarLoop]: Abstraction has 992 states and 1026 transitions. [2019-11-23 20:54:10,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:54:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1026 transitions. [2019-11-23 20:54:10,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-23 20:54:10,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:54:10,247 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 20:54:10,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:54:10,452 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:54:10,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:54:10,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2063084960, now seen corresponding path program 1 times [2019-11-23 20:54:10,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:54:10,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844275502] [2019-11-23 20:54:10,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:54:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:54:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-23 20:54:10,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844275502] [2019-11-23 20:54:10,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:54:10,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:54:10,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907504508] [2019-11-23 20:54:10,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:54:10,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:54:10,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:54:10,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:54:10,718 INFO L87 Difference]: Start difference. First operand 992 states and 1026 transitions. Second operand 4 states. [2019-11-23 20:54:10,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:54:10,938 INFO L93 Difference]: Finished difference Result 1839 states and 1907 transitions. [2019-11-23 20:54:10,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:54:10,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-11-23 20:54:10,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:54:10,939 INFO L225 Difference]: With dead ends: 1839 [2019-11-23 20:54:10,939 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:54:10,941 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:54:10,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:54:10,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:54:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:54:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:54:10,942 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 240 [2019-11-23 20:54:10,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:54:10,942 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:54:10,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:54:10,942 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:54:10,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:54:10,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:54:11,328 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-11-23 20:54:11,628 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-11-23 20:54:11,632 INFO L444 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,632 INFO L444 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,633 INFO L444 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,633 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-23 20:54:11,633 INFO L444 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-23 20:54:11,633 INFO L444 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-23 20:54:11,634 INFO L444 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-23 20:54:11,634 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-23 20:54:11,634 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-23 20:54:11,634 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-23 20:54:11,634 INFO L444 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,634 INFO L444 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,635 INFO L444 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,635 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-23 20:54:11,635 INFO L444 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-23 20:54:11,635 INFO L444 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-23 20:54:11,635 INFO L444 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-23 20:54:11,635 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-23 20:54:11,635 INFO L444 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-23 20:54:11,635 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-23 20:54:11,635 INFO L444 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,636 INFO L444 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,636 INFO L444 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,636 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-23 20:54:11,636 INFO L444 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-23 20:54:11,636 INFO L444 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-23 20:54:11,636 INFO L444 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-23 20:54:11,636 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-23 20:54:11,636 INFO L444 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,637 INFO L444 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,637 INFO L444 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,637 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-23 20:54:11,637 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-23 20:54:11,637 INFO L444 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-23 20:54:11,637 INFO L444 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-23 20:54:11,637 INFO L444 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-23 20:54:11,637 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-23 20:54:11,638 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-23 20:54:11,638 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-23 20:54:11,638 INFO L444 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,638 INFO L444 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,638 INFO L444 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,638 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-23 20:54:11,638 INFO L444 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-23 20:54:11,639 INFO L444 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-23 20:54:11,639 INFO L444 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-23 20:54:11,639 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-23 20:54:11,639 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-23 20:54:11,639 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-23 20:54:11,639 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-23 20:54:11,639 INFO L444 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,639 INFO L444 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,639 INFO L444 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,640 INFO L444 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-23 20:54:11,640 INFO L444 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-23 20:54:11,640 INFO L444 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-23 20:54:11,640 INFO L444 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-23 20:54:11,640 INFO L444 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-23 20:54:11,640 INFO L444 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-23 20:54:11,640 INFO L444 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-23 20:54:11,640 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-23 20:54:11,641 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-23 20:54:11,641 INFO L444 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,641 INFO L444 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,641 INFO L444 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,641 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-23 20:54:11,641 INFO L444 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-23 20:54:11,641 INFO L444 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-23 20:54:11,641 INFO L444 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-23 20:54:11,641 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-23 20:54:11,642 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-23 20:54:11,642 INFO L444 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,642 INFO L444 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,642 INFO L444 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,642 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-23 20:54:11,642 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-23 20:54:11,642 INFO L444 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-23 20:54:11,642 INFO L444 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-23 20:54:11,643 INFO L444 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-23 20:54:11,643 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:54:11,643 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-23 20:54:11,643 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-23 20:54:11,643 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-23 20:54:11,643 INFO L444 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,643 INFO L444 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,643 INFO L444 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,644 INFO L444 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-23 20:54:11,644 INFO L444 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-23 20:54:11,644 INFO L444 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-23 20:54:11,644 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-23 20:54:11,644 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-23 20:54:11,644 INFO L444 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,644 INFO L444 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,644 INFO L444 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,645 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-23 20:54:11,645 INFO L444 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-23 20:54:11,645 INFO L444 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-23 20:54:11,645 INFO L444 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-23 20:54:11,645 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-23 20:54:11,645 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-23 20:54:11,645 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-23 20:54:11,645 INFO L444 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-23 20:54:11,646 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-23 20:54:11,646 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-23 20:54:11,646 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:54:11,646 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 448) no Hoare annotation was computed. [2019-11-23 20:54:11,646 INFO L444 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-23 20:54:11,646 INFO L444 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,646 INFO L444 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,647 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-23 20:54:11,647 INFO L444 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-23 20:54:11,647 INFO L444 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-23 20:54:11,647 INFO L444 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-23 20:54:11,647 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-23 20:54:11,647 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-23 20:54:11,647 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-23 20:54:11,647 INFO L444 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-23 20:54:11,648 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-23 20:54:11,648 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse5 (= ~a25~0 1))) (let ((.cse0 (= ~a11~0 1)) (.cse8 (= ~a17~0 8)) (.cse2 (= ~a28~0 7)) (.cse10 (<= 10 ~a28~0)) (.cse7 (not .cse5)) (.cse3 (= ~a19~0 1)) (.cse9 (not (= ~a28~0 11))) (.cse6 (= ~a28~0 10)) (.cse4 (<= ~a11~0 0)) (.cse1 (<= ~a17~0 8))) (or (and (= ~a28~0 9) .cse0 .cse1) (and .cse2 .cse0 .cse1) (and (not .cse2) .cse3 .cse4 .cse5 .cse1) (and .cse6 .cse0) (and .cse6 .cse3 .cse4) (and .cse7 .cse8 .cse4 .cse9) (and .cse10 .cse7 .cse0) (and .cse8 .cse4 .cse2) (and .cse10 .cse7 .cse3 .cse4 .cse9) (and .cse6 .cse4 .cse5 .cse1)))) [2019-11-23 20:54:11,648 INFO L444 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,648 INFO L444 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,648 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-23 20:54:11,649 INFO L444 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-23 20:54:11,649 INFO L444 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-23 20:54:11,649 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-23 20:54:11,649 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-23 20:54:11,649 INFO L444 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-23 20:54:11,649 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-23 20:54:11,649 INFO L444 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,649 INFO L444 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,650 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-23 20:54:11,650 INFO L444 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-23 20:54:11,650 INFO L444 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-23 20:54:11,650 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-23 20:54:11,650 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-23 20:54:11,650 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-23 20:54:11,650 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-23 20:54:11,650 INFO L444 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-23 20:54:11,651 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-23 20:54:11,651 INFO L444 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,651 INFO L444 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,651 INFO L444 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-23 20:54:11,651 INFO L444 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-23 20:54:11,651 INFO L444 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-23 20:54:11,651 INFO L444 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-23 20:54:11,651 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-23 20:54:11,651 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-23 20:54:11,652 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse5 (= ~a25~0 1))) (let ((.cse0 (= ~a11~0 1)) (.cse8 (= ~a17~0 8)) (.cse2 (= ~a28~0 7)) (.cse10 (<= 10 ~a28~0)) (.cse7 (not .cse5)) (.cse3 (= ~a19~0 1)) (.cse9 (not (= ~a28~0 11))) (.cse6 (= ~a28~0 10)) (.cse4 (<= ~a11~0 0)) (.cse1 (<= ~a17~0 8))) (or (and (= ~a28~0 9) .cse0 .cse1) (and .cse2 .cse0 .cse1) (and (not .cse2) .cse3 .cse4 .cse5 .cse1) (and .cse6 .cse0) (and .cse6 .cse3 .cse4) (and .cse7 .cse8 .cse4 .cse9) (and .cse10 .cse7 .cse0) (and .cse8 .cse4 .cse2) (and .cse10 .cse7 .cse3 .cse4 .cse9) (and .cse6 .cse4 .cse5 .cse1)))) [2019-11-23 20:54:11,652 INFO L444 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,652 INFO L444 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,652 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-23 20:54:11,652 INFO L444 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-23 20:54:11,652 INFO L444 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-23 20:54:11,653 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-23 20:54:11,653 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-23 20:54:11,653 INFO L444 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,653 INFO L444 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,653 INFO L444 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-23 20:54:11,653 INFO L444 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-23 20:54:11,653 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-23 20:54:11,653 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-23 20:54:11,654 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-23 20:54:11,654 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-23 20:54:11,654 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-23 20:54:11,654 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-23 20:54:11,654 INFO L444 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-23 20:54:11,654 INFO L444 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,654 INFO L444 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,654 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-23 20:54:11,655 INFO L444 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,655 INFO L444 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-23 20:54:11,655 INFO L444 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-23 20:54:11,655 INFO L444 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-23 20:54:11,655 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-23 20:54:11,655 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-23 20:54:11,655 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:54:11,655 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-23 20:54:11,656 INFO L444 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,656 INFO L444 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,656 INFO L444 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,656 INFO L444 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-23 20:54:11,656 INFO L444 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-23 20:54:11,656 INFO L444 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-23 20:54:11,656 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-23 20:54:11,656 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-23 20:54:11,657 INFO L444 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,657 INFO L444 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,657 INFO L444 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,657 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-23 20:54:11,657 INFO L444 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-23 20:54:11,657 INFO L444 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-23 20:54:11,657 INFO L444 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-23 20:54:11,657 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-23 20:54:11,658 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-23 20:54:11,658 INFO L444 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,658 INFO L444 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,658 INFO L444 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,658 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-23 20:54:11,658 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-23 20:54:11,658 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-23 20:54:11,659 INFO L444 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-23 20:54:11,659 INFO L444 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-23 20:54:11,659 INFO L444 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-23 20:54:11,659 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:54:11,659 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-23 20:54:11,659 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-23 20:54:11,659 INFO L444 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,659 INFO L444 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,660 INFO L444 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,660 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-23 20:54:11,660 INFO L444 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-23 20:54:11,660 INFO L444 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-23 20:54:11,660 INFO L444 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-23 20:54:11,660 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-23 20:54:11,660 INFO L444 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,660 INFO L444 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,661 INFO L444 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-23 20:54:11,661 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-23 20:54:11,661 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-23 20:54:11,661 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-23 20:54:11,661 INFO L444 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-23 20:54:11,661 INFO L444 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-23 20:54:11,661 INFO L444 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-23 20:54:11,661 INFO L444 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-23 20:54:11,662 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-23 20:54:11,662 INFO L444 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-23 20:54:11,662 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-23 20:54:11,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:54:11 BoogieIcfgContainer [2019-11-23 20:54:11,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:54:11,708 INFO L168 Benchmark]: Toolchain (without parser) took 14442.61 ms. Allocated memory was 139.5 MB in the beginning and 507.0 MB in the end (delta: 367.5 MB). Free memory was 103.1 MB in the beginning and 442.5 MB in the end (delta: -339.4 MB). Peak memory consumption was 318.5 MB. Max. memory is 7.1 GB. [2019-11-23 20:54:11,709 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 20:54:11,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 686.82 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.9 MB in the beginning and 168.1 MB in the end (delta: -65.2 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. [2019-11-23 20:54:11,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.51 ms. Allocated memory is still 204.5 MB. Free memory was 168.1 MB in the beginning and 162.6 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. [2019-11-23 20:54:11,711 INFO L168 Benchmark]: Boogie Preprocessor took 61.68 ms. Allocated memory is still 204.5 MB. Free memory was 162.6 MB in the beginning and 157.8 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:54:11,714 INFO L168 Benchmark]: RCFGBuilder took 1410.88 ms. Allocated memory was 204.5 MB in the beginning and 237.0 MB in the end (delta: 32.5 MB). Free memory was 157.8 MB in the beginning and 168.2 MB in the end (delta: -10.4 MB). Peak memory consumption was 74.4 MB. Max. memory is 7.1 GB. [2019-11-23 20:54:11,715 INFO L168 Benchmark]: TraceAbstraction took 12188.44 ms. Allocated memory was 237.0 MB in the beginning and 507.0 MB in the end (delta: 270.0 MB). Free memory was 168.2 MB in the beginning and 442.5 MB in the end (delta: -274.2 MB). Peak memory consumption was 286.1 MB. Max. memory is 7.1 GB. [2019-11-23 20:54:11,722 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.52 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 686.82 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.9 MB in the beginning and 168.1 MB in the end (delta: -65.2 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 89.51 ms. Allocated memory is still 204.5 MB. Free memory was 168.1 MB in the beginning and 162.6 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.68 ms. Allocated memory is still 204.5 MB. Free memory was 162.6 MB in the beginning and 157.8 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1410.88 ms. Allocated memory was 204.5 MB in the beginning and 237.0 MB in the end (delta: 32.5 MB). Free memory was 157.8 MB in the beginning and 168.2 MB in the end (delta: -10.4 MB). Peak memory consumption was 74.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12188.44 ms. Allocated memory was 237.0 MB in the beginning and 507.0 MB in the end (delta: 270.0 MB). Free memory was 168.2 MB in the beginning and 442.5 MB in the end (delta: -274.2 MB). Peak memory consumption was 286.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 448]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((a28 == 9 && a11 == 1) && a17 <= 8) || ((a28 == 7 && a11 == 1) && a17 <= 8)) || ((((!(a28 == 7) && a19 == 1) && a11 <= 0) && a25 == 1) && a17 <= 8)) || (a28 == 10 && a11 == 1)) || ((a28 == 10 && a19 == 1) && a11 <= 0)) || (((!(a25 == 1) && a17 == 8) && a11 <= 0) && !(a28 == 11))) || ((10 <= a28 && !(a25 == 1)) && a11 == 1)) || ((a17 == 8 && a11 <= 0) && a28 == 7)) || ((((10 <= a28 && !(a25 == 1)) && a19 == 1) && a11 <= 0) && !(a28 == 11))) || (((a28 == 10 && a11 <= 0) && a25 == 1) && a17 <= 8) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((a28 == 9 && a11 == 1) && a17 <= 8) || ((a28 == 7 && a11 == 1) && a17 <= 8)) || ((((!(a28 == 7) && a19 == 1) && a11 <= 0) && a25 == 1) && a17 <= 8)) || (a28 == 10 && a11 == 1)) || ((a28 == 10 && a19 == 1) && a11 <= 0)) || (((!(a25 == 1) && a17 == 8) && a11 <= 0) && !(a28 == 11))) || ((10 <= a28 && !(a25 == 1)) && a11 == 1)) || ((a17 == 8 && a11 <= 0) && a28 == 7)) || ((((10 <= a28 && !(a25 == 1)) && a19 == 1) && a11 <= 0) && !(a28 == 11))) || (((a28 == 10 && a11 <= 0) && a25 == 1) && a17 <= 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 12.0s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 1537 SDtfs, 2378 SDslu, 267 SDs, 0 SdLazy, 5978 SolverSat, 948 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 217 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2689occurred 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.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 1164 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 44 NumberOfFragments, 245 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1180 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 274 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2045 NumberOfCodeBlocks, 2045 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2032 ConstructedInterpolants, 0 QuantifiedInterpolants, 655619 SizeOfPredicates, 1 NumberOfNonLiveVariables, 390 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1294/1302 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...