./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label19.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e94bad701dc31ef8837df5dc0d8bbaaa41b948fd ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:39:59,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:39:59,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:39:59,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:39:59,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:39:59,258 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:39:59,260 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:39:59,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:39:59,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:39:59,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:39:59,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:39:59,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:39:59,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:39:59,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:39:59,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:39:59,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:39:59,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:39:59,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:39:59,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:39:59,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:39:59,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:39:59,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:39:59,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:39:59,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:39:59,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:39:59,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:39:59,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:39:59,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:39:59,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:39:59,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:39:59,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:39:59,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:39:59,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:39:59,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:39:59,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:39:59,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:39:59,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:39:59,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:39:59,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:39:59,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:39:59,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:39:59,324 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:39:59,352 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:39:59,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:39:59,354 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:39:59,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:39:59,354 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:39:59,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:39:59,355 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:39:59,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:39:59,355 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:39:59,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:39:59,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:39:59,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:39:59,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:39:59,356 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:39:59,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:39:59,356 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:39:59,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:39:59,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:39:59,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:39:59,357 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:39:59,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:39:59,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:39:59,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:39:59,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:39:59,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:39:59,359 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:39:59,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:39:59,359 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:39:59,359 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e94bad701dc31ef8837df5dc0d8bbaaa41b948fd [2019-11-27 22:39:59,656 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:39:59,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:39:59,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:39:59,683 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:39:59,684 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:39:59,686 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label19.c [2019-11-27 22:39:59,760 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/048d2dccf/d5493c29e7144eefa9dc13189bd05f11/FLAGd85c7e515 [2019-11-27 22:40:00,296 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:40:00,297 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label19.c [2019-11-27 22:40:00,310 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/048d2dccf/d5493c29e7144eefa9dc13189bd05f11/FLAGd85c7e515 [2019-11-27 22:40:00,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/048d2dccf/d5493c29e7144eefa9dc13189bd05f11 [2019-11-27 22:40:00,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:40:00,587 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:40:00,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:40:00,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:40:00,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:40:00,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:40:00" (1/1) ... [2019-11-27 22:40:00,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1b3a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:00, skipping insertion in model container [2019-11-27 22:40:00,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:40:00" (1/1) ... [2019-11-27 22:40:00,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:40:00,674 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:40:01,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:40:01,159 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:40:01,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:40:01,282 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:40:01,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01 WrapperNode [2019-11-27 22:40:01,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:40:01,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:40:01,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:40:01,284 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:40:01,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (1/1) ... [2019-11-27 22:40:01,310 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (1/1) ... [2019-11-27 22:40:01,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:40:01,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:40:01,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:40:01,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:40:01,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (1/1) ... [2019-11-27 22:40:01,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (1/1) ... [2019-11-27 22:40:01,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (1/1) ... [2019-11-27 22:40:01,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (1/1) ... [2019-11-27 22:40:01,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (1/1) ... [2019-11-27 22:40:01,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (1/1) ... [2019-11-27 22:40:01,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (1/1) ... [2019-11-27 22:40:01,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:40:01,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:40:01,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:40:01,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:40:01,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (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-27 22:40:01,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:40:01,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:40:02,930 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:40:02,931 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 22:40:02,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:40:02 BoogieIcfgContainer [2019-11-27 22:40:02,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:40:02,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:40:02,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:40:02,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:40:02,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:40:00" (1/3) ... [2019-11-27 22:40:02,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ddcc0b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:40:02, skipping insertion in model container [2019-11-27 22:40:02,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:40:01" (2/3) ... [2019-11-27 22:40:02,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ddcc0b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:40:02, skipping insertion in model container [2019-11-27 22:40:02,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:40:02" (3/3) ... [2019-11-27 22:40:02,951 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label19.c [2019-11-27 22:40:02,965 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:40:02,977 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:40:02,992 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:40:03,034 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:40:03,035 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:40:03,035 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:40:03,035 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:40:03,036 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:40:03,036 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:40:03,036 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:40:03,036 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:40:03,065 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-27 22:40:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-27 22:40:03,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:03,083 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-27 22:40:03,084 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:03,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:03,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1607169461, now seen corresponding path program 1 times [2019-11-27 22:40:03,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:03,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514117278] [2019-11-27 22:40:03,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:03,573 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-27 22:40:03,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514117278] [2019-11-27 22:40:03,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:03,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:03,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134476571] [2019-11-27 22:40:03,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:40:03,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:03,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:40:03,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:03,606 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-11-27 22:40:05,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:05,121 INFO L93 Difference]: Finished difference Result 789 states and 1377 transitions. [2019-11-27 22:40:05,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:40:05,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-27 22:40:05,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:05,146 INFO L225 Difference]: With dead ends: 789 [2019-11-27 22:40:05,146 INFO L226 Difference]: Without dead ends: 465 [2019-11-27 22:40:05,157 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-27 22:40:05,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-11-27 22:40:05,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 309. [2019-11-27 22:40:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-27 22:40:05,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 453 transitions. [2019-11-27 22:40:05,240 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 453 transitions. Word has length 92 [2019-11-27 22:40:05,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:05,241 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 453 transitions. [2019-11-27 22:40:05,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:40:05,241 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 453 transitions. [2019-11-27 22:40:05,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-27 22:40:05,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:05,246 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-27 22:40:05,247 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:05,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:05,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1513780896, now seen corresponding path program 1 times [2019-11-27 22:40:05,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:05,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825488169] [2019-11-27 22:40:05,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:05,365 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-27 22:40:05,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825488169] [2019-11-27 22:40:05,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:05,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:05,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925456187] [2019-11-27 22:40:05,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:05,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:05,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:05,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:40:05,372 INFO L87 Difference]: Start difference. First operand 309 states and 453 transitions. Second operand 3 states. [2019-11-27 22:40:05,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:05,926 INFO L93 Difference]: Finished difference Result 899 states and 1323 transitions. [2019-11-27 22:40:05,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:05,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-27 22:40:05,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:05,931 INFO L225 Difference]: With dead ends: 899 [2019-11-27 22:40:05,931 INFO L226 Difference]: Without dead ends: 592 [2019-11-27 22:40:05,933 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-27 22:40:05,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-11-27 22:40:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-11-27 22:40:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-27 22:40:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 765 transitions. [2019-11-27 22:40:05,972 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 765 transitions. Word has length 96 [2019-11-27 22:40:05,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:05,972 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 765 transitions. [2019-11-27 22:40:05,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:05,975 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 765 transitions. [2019-11-27 22:40:05,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-27 22:40:05,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:05,990 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-27 22:40:05,991 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:05,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:05,991 INFO L82 PathProgramCache]: Analyzing trace with hash 308279990, now seen corresponding path program 1 times [2019-11-27 22:40:05,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:05,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483209711] [2019-11-27 22:40:05,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:06,147 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-27 22:40:06,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483209711] [2019-11-27 22:40:06,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:06,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:40:06,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993116222] [2019-11-27 22:40:06,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:40:06,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:06,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:40:06,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:06,154 INFO L87 Difference]: Start difference. First operand 592 states and 765 transitions. Second operand 4 states. [2019-11-27 22:40:07,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:07,335 INFO L93 Difference]: Finished difference Result 2169 states and 2837 transitions. [2019-11-27 22:40:07,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:40:07,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-27 22:40:07,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:07,343 INFO L225 Difference]: With dead ends: 2169 [2019-11-27 22:40:07,343 INFO L226 Difference]: Without dead ends: 1437 [2019-11-27 22:40:07,346 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-27 22:40:07,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2019-11-27 22:40:07,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1150. [2019-11-27 22:40:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-11-27 22:40:07,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1467 transitions. [2019-11-27 22:40:07,380 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1467 transitions. Word has length 101 [2019-11-27 22:40:07,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:07,380 INFO L462 AbstractCegarLoop]: Abstraction has 1150 states and 1467 transitions. [2019-11-27 22:40:07,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:40:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1467 transitions. [2019-11-27 22:40:07,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-27 22:40:07,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:07,385 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-27 22:40:07,385 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:07,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:07,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1263008387, now seen corresponding path program 1 times [2019-11-27 22:40:07,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:07,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656211481] [2019-11-27 22:40:07,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:07,488 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-27 22:40:07,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656211481] [2019-11-27 22:40:07,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:07,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:40:07,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299013547] [2019-11-27 22:40:07,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:07,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:07,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:07,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:40:07,495 INFO L87 Difference]: Start difference. First operand 1150 states and 1467 transitions. Second operand 3 states. [2019-11-27 22:40:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:08,148 INFO L93 Difference]: Finished difference Result 3278 states and 4207 transitions. [2019-11-27 22:40:08,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:08,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-11-27 22:40:08,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:08,160 INFO L225 Difference]: With dead ends: 3278 [2019-11-27 22:40:08,161 INFO L226 Difference]: Without dead ends: 2130 [2019-11-27 22:40:08,164 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-27 22:40:08,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2019-11-27 22:40:08,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 1850. [2019-11-27 22:40:08,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2019-11-27 22:40:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2333 transitions. [2019-11-27 22:40:08,216 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2333 transitions. Word has length 109 [2019-11-27 22:40:08,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:08,217 INFO L462 AbstractCegarLoop]: Abstraction has 1850 states and 2333 transitions. [2019-11-27 22:40:08,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:08,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2333 transitions. [2019-11-27 22:40:08,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-27 22:40:08,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:08,222 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-27 22:40:08,223 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:08,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:08,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1854205693, now seen corresponding path program 1 times [2019-11-27 22:40:08,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:08,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521363048] [2019-11-27 22:40:08,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:08,320 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-27 22:40:08,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521363048] [2019-11-27 22:40:08,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:08,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:08,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473871097] [2019-11-27 22:40:08,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:40:08,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:08,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:40:08,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:08,323 INFO L87 Difference]: Start difference. First operand 1850 states and 2333 transitions. Second operand 4 states. [2019-11-27 22:40:09,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:09,157 INFO L93 Difference]: Finished difference Result 3984 states and 4981 transitions. [2019-11-27 22:40:09,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:40:09,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-27 22:40:09,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:09,168 INFO L225 Difference]: With dead ends: 3984 [2019-11-27 22:40:09,168 INFO L226 Difference]: Without dead ends: 2136 [2019-11-27 22:40:09,171 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-27 22:40:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2019-11-27 22:40:09,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 2131. [2019-11-27 22:40:09,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-11-27 22:40:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2423 transitions. [2019-11-27 22:40:09,212 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2423 transitions. Word has length 150 [2019-11-27 22:40:09,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:09,213 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 2423 transitions. [2019-11-27 22:40:09,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:40:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2423 transitions. [2019-11-27 22:40:09,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-27 22:40:09,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:09,218 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-27 22:40:09,218 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:09,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:09,218 INFO L82 PathProgramCache]: Analyzing trace with hash -2077294402, now seen corresponding path program 1 times [2019-11-27 22:40:09,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:09,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59416431] [2019-11-27 22:40:09,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:09,327 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-27 22:40:09,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59416431] [2019-11-27 22:40:09,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:09,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:09,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209929964] [2019-11-27 22:40:09,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:09,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:09,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:09,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:40:09,331 INFO L87 Difference]: Start difference. First operand 2131 states and 2423 transitions. Second operand 3 states. [2019-11-27 22:40:09,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:09,914 INFO L93 Difference]: Finished difference Result 4266 states and 4853 transitions. [2019-11-27 22:40:09,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:09,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-11-27 22:40:09,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:09,925 INFO L225 Difference]: With dead ends: 4266 [2019-11-27 22:40:09,925 INFO L226 Difference]: Without dead ends: 2137 [2019-11-27 22:40:09,928 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-27 22:40:09,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2019-11-27 22:40:09,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2131. [2019-11-27 22:40:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-11-27 22:40:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2379 transitions. [2019-11-27 22:40:09,977 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2379 transitions. Word has length 159 [2019-11-27 22:40:09,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:09,978 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 2379 transitions. [2019-11-27 22:40:09,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2379 transitions. [2019-11-27 22:40:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-27 22:40:09,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:09,984 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-27 22:40:09,984 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:09,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:09,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1420578269, now seen corresponding path program 1 times [2019-11-27 22:40:09,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:09,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831370067] [2019-11-27 22:40:09,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:10,066 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-27 22:40:10,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831370067] [2019-11-27 22:40:10,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:10,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:10,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322282209] [2019-11-27 22:40:10,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:40:10,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:10,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:40:10,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:10,069 INFO L87 Difference]: Start difference. First operand 2131 states and 2379 transitions. Second operand 4 states. [2019-11-27 22:40:10,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:10,742 INFO L93 Difference]: Finished difference Result 4258 states and 4754 transitions. [2019-11-27 22:40:10,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:10,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-27 22:40:10,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:10,752 INFO L225 Difference]: With dead ends: 4258 [2019-11-27 22:40:10,753 INFO L226 Difference]: Without dead ends: 2129 [2019-11-27 22:40:10,756 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-27 22:40:10,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2019-11-27 22:40:10,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 2129. [2019-11-27 22:40:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2129 states. [2019-11-27 22:40:10,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 2307 transitions. [2019-11-27 22:40:10,797 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 2307 transitions. Word has length 161 [2019-11-27 22:40:10,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:10,797 INFO L462 AbstractCegarLoop]: Abstraction has 2129 states and 2307 transitions. [2019-11-27 22:40:10,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:40:10,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2307 transitions. [2019-11-27 22:40:10,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-27 22:40:10,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:10,804 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-27 22:40:10,804 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:10,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:10,805 INFO L82 PathProgramCache]: Analyzing trace with hash 72359917, now seen corresponding path program 1 times [2019-11-27 22:40:10,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:10,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63667266] [2019-11-27 22:40:10,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:10,864 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-27 22:40:10,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63667266] [2019-11-27 22:40:10,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:10,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:10,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864088261] [2019-11-27 22:40:10,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:10,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:10,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:10,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:40:10,866 INFO L87 Difference]: Start difference. First operand 2129 states and 2307 transitions. Second operand 3 states. [2019-11-27 22:40:11,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:11,384 INFO L93 Difference]: Finished difference Result 4538 states and 4924 transitions. [2019-11-27 22:40:11,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:11,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-11-27 22:40:11,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:11,394 INFO L225 Difference]: With dead ends: 4538 [2019-11-27 22:40:11,394 INFO L226 Difference]: Without dead ends: 2270 [2019-11-27 22:40:11,397 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-27 22:40:11,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2270 states. [2019-11-27 22:40:11,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2270 to 2268. [2019-11-27 22:40:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2268 states. [2019-11-27 22:40:11,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 2449 transitions. [2019-11-27 22:40:11,436 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 2449 transitions. Word has length 170 [2019-11-27 22:40:11,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:11,436 INFO L462 AbstractCegarLoop]: Abstraction has 2268 states and 2449 transitions. [2019-11-27 22:40:11,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:11,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 2449 transitions. [2019-11-27 22:40:11,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-27 22:40:11,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:11,442 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-27 22:40:11,442 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:11,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:11,443 INFO L82 PathProgramCache]: Analyzing trace with hash -648360830, now seen corresponding path program 1 times [2019-11-27 22:40:11,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:11,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599064723] [2019-11-27 22:40:11,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:11,530 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-27 22:40:11,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599064723] [2019-11-27 22:40:11,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:11,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:40:11,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432248184] [2019-11-27 22:40:11,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:40:11,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:11,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:40:11,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:11,539 INFO L87 Difference]: Start difference. First operand 2268 states and 2449 transitions. Second operand 4 states. [2019-11-27 22:40:12,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:12,354 INFO L93 Difference]: Finished difference Result 5239 states and 5687 transitions. [2019-11-27 22:40:12,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:40:12,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-11-27 22:40:12,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:12,374 INFO L225 Difference]: With dead ends: 5239 [2019-11-27 22:40:12,375 INFO L226 Difference]: Without dead ends: 2973 [2019-11-27 22:40:12,378 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-27 22:40:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2019-11-27 22:40:12,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2689. [2019-11-27 22:40:12,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2689 states. [2019-11-27 22:40:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 2886 transitions. [2019-11-27 22:40:12,424 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 2886 transitions. Word has length 171 [2019-11-27 22:40:12,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:12,425 INFO L462 AbstractCegarLoop]: Abstraction has 2689 states and 2886 transitions. [2019-11-27 22:40:12,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:40:12,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 2886 transitions. [2019-11-27 22:40:12,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-27 22:40:12,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:12,433 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-27 22:40:12,433 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:12,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:12,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1613967385, now seen corresponding path program 1 times [2019-11-27 22:40:12,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:12,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506115934] [2019-11-27 22:40:12,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:12,570 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-27 22:40:12,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506115934] [2019-11-27 22:40:12,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:12,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:40:12,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800068882] [2019-11-27 22:40:12,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:40:12,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:12,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:40:12,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:12,572 INFO L87 Difference]: Start difference. First operand 2689 states and 2886 transitions. Second operand 4 states. [2019-11-27 22:40:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:13,387 INFO L93 Difference]: Finished difference Result 5658 states and 6067 transitions. [2019-11-27 22:40:13,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:40:13,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-11-27 22:40:13,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:13,398 INFO L225 Difference]: With dead ends: 5658 [2019-11-27 22:40:13,398 INFO L226 Difference]: Without dead ends: 2550 [2019-11-27 22:40:13,401 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-27 22:40:13,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2019-11-27 22:40:13,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2406. [2019-11-27 22:40:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2406 states. [2019-11-27 22:40:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 2525 transitions. [2019-11-27 22:40:13,438 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 2525 transitions. Word has length 194 [2019-11-27 22:40:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:13,438 INFO L462 AbstractCegarLoop]: Abstraction has 2406 states and 2525 transitions. [2019-11-27 22:40:13,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:40:13,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 2525 transitions. [2019-11-27 22:40:13,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-27 22:40:13,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:13,444 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-27 22:40:13,445 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:13,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:13,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1509674929, now seen corresponding path program 1 times [2019-11-27 22:40:13,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:13,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196978874] [2019-11-27 22:40:13,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:13,527 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-27 22:40:13,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196978874] [2019-11-27 22:40:13,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014463558] [2019-11-27 22:40:13,528 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-27 22:40:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:13,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 22:40:13,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:40:13,720 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-27 22:40:13,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:40:13,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-11-27 22:40:13,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257177250] [2019-11-27 22:40:13,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:40:13,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:13,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:40:13,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:40:13,723 INFO L87 Difference]: Start difference. First operand 2406 states and 2525 transitions. Second operand 3 states. [2019-11-27 22:40:13,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:13,993 INFO L93 Difference]: Finished difference Result 4380 states and 4595 transitions. [2019-11-27 22:40:13,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:13,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 201 [2019-11-27 22:40:13,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:13,999 INFO L225 Difference]: With dead ends: 4380 [2019-11-27 22:40:13,999 INFO L226 Difference]: Without dead ends: 992 [2019-11-27 22:40:14,002 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-27 22:40:14,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-11-27 22:40:14,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2019-11-27 22:40:14,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2019-11-27 22:40:14,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1026 transitions. [2019-11-27 22:40:14,023 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1026 transitions. Word has length 201 [2019-11-27 22:40:14,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:14,023 INFO L462 AbstractCegarLoop]: Abstraction has 992 states and 1026 transitions. [2019-11-27 22:40:14,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:40:14,024 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1026 transitions. [2019-11-27 22:40:14,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-27 22:40:14,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:40:14,028 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-27 22:40:14,232 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:40:14,233 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:40:14,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:40:14,233 INFO L82 PathProgramCache]: Analyzing trace with hash 2063084960, now seen corresponding path program 1 times [2019-11-27 22:40:14,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:40:14,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218911678] [2019-11-27 22:40:14,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:40:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:40:14,455 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-27 22:40:14,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218911678] [2019-11-27 22:40:14,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:40:14,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:40:14,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686679361] [2019-11-27 22:40:14,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:40:14,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:40:14,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:40:14,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:40:14,457 INFO L87 Difference]: Start difference. First operand 992 states and 1026 transitions. Second operand 4 states. [2019-11-27 22:40:14,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:40:14,652 INFO L93 Difference]: Finished difference Result 1839 states and 1907 transitions. [2019-11-27 22:40:14,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:40:14,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-11-27 22:40:14,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:40:14,653 INFO L225 Difference]: With dead ends: 1839 [2019-11-27 22:40:14,653 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:40:14,656 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-27 22:40:14,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:40:14,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:40:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:40:14,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:40:14,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 240 [2019-11-27 22:40:14,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:40:14,657 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:40:14,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:40:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:40:14,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:40:14,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:40:15,138 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-11-27 22:40:15,445 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-11-27 22:40:15,448 INFO L246 CegarLoopResult]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,449 INFO L246 CegarLoopResult]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,449 INFO L246 CegarLoopResult]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,449 INFO L246 CegarLoopResult]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-27 22:40:15,449 INFO L246 CegarLoopResult]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-27 22:40:15,449 INFO L246 CegarLoopResult]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-27 22:40:15,449 INFO L246 CegarLoopResult]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-27 22:40:15,449 INFO L246 CegarLoopResult]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-27 22:40:15,450 INFO L246 CegarLoopResult]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-27 22:40:15,455 INFO L246 CegarLoopResult]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-27 22:40:15,455 INFO L246 CegarLoopResult]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,456 INFO L246 CegarLoopResult]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,456 INFO L246 CegarLoopResult]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,456 INFO L246 CegarLoopResult]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-27 22:40:15,456 INFO L246 CegarLoopResult]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-27 22:40:15,456 INFO L246 CegarLoopResult]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-27 22:40:15,456 INFO L246 CegarLoopResult]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-27 22:40:15,456 INFO L246 CegarLoopResult]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-27 22:40:15,456 INFO L246 CegarLoopResult]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-27 22:40:15,457 INFO L246 CegarLoopResult]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-27 22:40:15,457 INFO L246 CegarLoopResult]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,457 INFO L246 CegarLoopResult]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,457 INFO L246 CegarLoopResult]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,457 INFO L246 CegarLoopResult]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-27 22:40:15,457 INFO L246 CegarLoopResult]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-27 22:40:15,457 INFO L246 CegarLoopResult]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-27 22:40:15,457 INFO L246 CegarLoopResult]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-27 22:40:15,458 INFO L246 CegarLoopResult]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-27 22:40:15,458 INFO L246 CegarLoopResult]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,458 INFO L246 CegarLoopResult]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,458 INFO L246 CegarLoopResult]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,458 INFO L246 CegarLoopResult]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-27 22:40:15,458 INFO L246 CegarLoopResult]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-27 22:40:15,458 INFO L246 CegarLoopResult]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-27 22:40:15,458 INFO L246 CegarLoopResult]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-27 22:40:15,459 INFO L246 CegarLoopResult]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-27 22:40:15,459 INFO L246 CegarLoopResult]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-27 22:40:15,459 INFO L246 CegarLoopResult]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-27 22:40:15,459 INFO L246 CegarLoopResult]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-27 22:40:15,459 INFO L246 CegarLoopResult]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,459 INFO L246 CegarLoopResult]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,459 INFO L246 CegarLoopResult]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,459 INFO L246 CegarLoopResult]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-27 22:40:15,460 INFO L246 CegarLoopResult]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-27 22:40:15,460 INFO L246 CegarLoopResult]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-27 22:40:15,460 INFO L246 CegarLoopResult]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-27 22:40:15,460 INFO L246 CegarLoopResult]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-27 22:40:15,460 INFO L246 CegarLoopResult]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-27 22:40:15,460 INFO L246 CegarLoopResult]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-27 22:40:15,460 INFO L246 CegarLoopResult]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-27 22:40:15,460 INFO L246 CegarLoopResult]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,461 INFO L246 CegarLoopResult]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,465 INFO L246 CegarLoopResult]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,465 INFO L246 CegarLoopResult]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-27 22:40:15,465 INFO L246 CegarLoopResult]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-27 22:40:15,465 INFO L246 CegarLoopResult]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-27 22:40:15,466 INFO L246 CegarLoopResult]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-27 22:40:15,466 INFO L246 CegarLoopResult]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-27 22:40:15,466 INFO L246 CegarLoopResult]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-27 22:40:15,466 INFO L246 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-27 22:40:15,466 INFO L246 CegarLoopResult]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-27 22:40:15,466 INFO L246 CegarLoopResult]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-27 22:40:15,466 INFO L246 CegarLoopResult]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,466 INFO L246 CegarLoopResult]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,467 INFO L246 CegarLoopResult]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,467 INFO L246 CegarLoopResult]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-27 22:40:15,467 INFO L246 CegarLoopResult]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-27 22:40:15,467 INFO L246 CegarLoopResult]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-27 22:40:15,467 INFO L246 CegarLoopResult]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-27 22:40:15,467 INFO L246 CegarLoopResult]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-27 22:40:15,467 INFO L246 CegarLoopResult]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-27 22:40:15,467 INFO L246 CegarLoopResult]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,467 INFO L246 CegarLoopResult]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,468 INFO L246 CegarLoopResult]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,470 INFO L246 CegarLoopResult]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-27 22:40:15,470 INFO L246 CegarLoopResult]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-27 22:40:15,471 INFO L246 CegarLoopResult]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-27 22:40:15,471 INFO L246 CegarLoopResult]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-27 22:40:15,471 INFO L246 CegarLoopResult]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-27 22:40:15,471 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:40:15,471 INFO L246 CegarLoopResult]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-27 22:40:15,471 INFO L246 CegarLoopResult]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-27 22:40:15,471 INFO L246 CegarLoopResult]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-27 22:40:15,471 INFO L246 CegarLoopResult]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,472 INFO L246 CegarLoopResult]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,472 INFO L246 CegarLoopResult]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,472 INFO L246 CegarLoopResult]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-27 22:40:15,472 INFO L246 CegarLoopResult]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-27 22:40:15,472 INFO L246 CegarLoopResult]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-27 22:40:15,472 INFO L246 CegarLoopResult]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-27 22:40:15,472 INFO L246 CegarLoopResult]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-27 22:40:15,472 INFO L246 CegarLoopResult]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,472 INFO L246 CegarLoopResult]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,473 INFO L246 CegarLoopResult]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,473 INFO L246 CegarLoopResult]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-27 22:40:15,473 INFO L246 CegarLoopResult]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-27 22:40:15,473 INFO L246 CegarLoopResult]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-27 22:40:15,473 INFO L246 CegarLoopResult]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-27 22:40:15,473 INFO L246 CegarLoopResult]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-27 22:40:15,473 INFO L246 CegarLoopResult]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-27 22:40:15,473 INFO L246 CegarLoopResult]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-27 22:40:15,474 INFO L246 CegarLoopResult]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-27 22:40:15,474 INFO L246 CegarLoopResult]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-27 22:40:15,474 INFO L246 CegarLoopResult]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-27 22:40:15,474 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 22:40:15,474 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 448) no Hoare annotation was computed. [2019-11-27 22:40:15,474 INFO L246 CegarLoopResult]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-27 22:40:15,474 INFO L246 CegarLoopResult]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,474 INFO L246 CegarLoopResult]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,474 INFO L246 CegarLoopResult]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-27 22:40:15,475 INFO L246 CegarLoopResult]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-27 22:40:15,475 INFO L246 CegarLoopResult]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-27 22:40:15,475 INFO L246 CegarLoopResult]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-27 22:40:15,475 INFO L246 CegarLoopResult]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-27 22:40:15,475 INFO L246 CegarLoopResult]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-27 22:40:15,475 INFO L246 CegarLoopResult]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-27 22:40:15,475 INFO L246 CegarLoopResult]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-27 22:40:15,475 INFO L246 CegarLoopResult]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-27 22:40:15,478 INFO L242 CegarLoopResult]: 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-27 22:40:15,478 INFO L246 CegarLoopResult]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,478 INFO L246 CegarLoopResult]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,478 INFO L246 CegarLoopResult]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-27 22:40:15,478 INFO L246 CegarLoopResult]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-27 22:40:15,479 INFO L246 CegarLoopResult]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-27 22:40:15,479 INFO L246 CegarLoopResult]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-27 22:40:15,479 INFO L246 CegarLoopResult]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-27 22:40:15,479 INFO L246 CegarLoopResult]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-27 22:40:15,479 INFO L249 CegarLoopResult]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-27 22:40:15,479 INFO L246 CegarLoopResult]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,479 INFO L246 CegarLoopResult]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,479 INFO L246 CegarLoopResult]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-27 22:40:15,480 INFO L246 CegarLoopResult]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-27 22:40:15,480 INFO L246 CegarLoopResult]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-27 22:40:15,480 INFO L246 CegarLoopResult]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-27 22:40:15,480 INFO L246 CegarLoopResult]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-27 22:40:15,480 INFO L246 CegarLoopResult]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-27 22:40:15,480 INFO L246 CegarLoopResult]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-27 22:40:15,480 INFO L246 CegarLoopResult]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-27 22:40:15,480 INFO L246 CegarLoopResult]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-27 22:40:15,480 INFO L246 CegarLoopResult]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,481 INFO L246 CegarLoopResult]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,481 INFO L246 CegarLoopResult]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-27 22:40:15,481 INFO L246 CegarLoopResult]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-27 22:40:15,481 INFO L246 CegarLoopResult]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-27 22:40:15,481 INFO L246 CegarLoopResult]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-27 22:40:15,481 INFO L246 CegarLoopResult]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-27 22:40:15,481 INFO L246 CegarLoopResult]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-27 22:40:15,483 INFO L242 CegarLoopResult]: 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-27 22:40:15,483 INFO L246 CegarLoopResult]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,483 INFO L246 CegarLoopResult]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,483 INFO L246 CegarLoopResult]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-27 22:40:15,484 INFO L246 CegarLoopResult]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-27 22:40:15,484 INFO L246 CegarLoopResult]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-27 22:40:15,484 INFO L246 CegarLoopResult]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-27 22:40:15,484 INFO L246 CegarLoopResult]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-27 22:40:15,484 INFO L246 CegarLoopResult]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,484 INFO L246 CegarLoopResult]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,484 INFO L246 CegarLoopResult]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-27 22:40:15,484 INFO L246 CegarLoopResult]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-27 22:40:15,485 INFO L246 CegarLoopResult]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-27 22:40:15,485 INFO L246 CegarLoopResult]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-27 22:40:15,485 INFO L246 CegarLoopResult]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-27 22:40:15,485 INFO L246 CegarLoopResult]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-27 22:40:15,485 INFO L246 CegarLoopResult]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-27 22:40:15,485 INFO L246 CegarLoopResult]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-27 22:40:15,485 INFO L246 CegarLoopResult]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-27 22:40:15,485 INFO L246 CegarLoopResult]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,485 INFO L246 CegarLoopResult]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,486 INFO L246 CegarLoopResult]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-27 22:40:15,486 INFO L246 CegarLoopResult]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,486 INFO L246 CegarLoopResult]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-27 22:40:15,486 INFO L246 CegarLoopResult]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-27 22:40:15,486 INFO L246 CegarLoopResult]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-27 22:40:15,486 INFO L246 CegarLoopResult]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-27 22:40:15,486 INFO L246 CegarLoopResult]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-27 22:40:15,486 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:40:15,486 INFO L246 CegarLoopResult]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-27 22:40:15,487 INFO L246 CegarLoopResult]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,487 INFO L246 CegarLoopResult]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,487 INFO L246 CegarLoopResult]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,487 INFO L246 CegarLoopResult]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-27 22:40:15,487 INFO L246 CegarLoopResult]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-27 22:40:15,487 INFO L246 CegarLoopResult]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-27 22:40:15,487 INFO L246 CegarLoopResult]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-27 22:40:15,487 INFO L246 CegarLoopResult]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-27 22:40:15,488 INFO L246 CegarLoopResult]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,488 INFO L246 CegarLoopResult]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,488 INFO L246 CegarLoopResult]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,488 INFO L246 CegarLoopResult]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-27 22:40:15,488 INFO L246 CegarLoopResult]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-27 22:40:15,488 INFO L246 CegarLoopResult]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-27 22:40:15,488 INFO L246 CegarLoopResult]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-27 22:40:15,488 INFO L246 CegarLoopResult]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-27 22:40:15,489 INFO L246 CegarLoopResult]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-27 22:40:15,489 INFO L246 CegarLoopResult]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,489 INFO L246 CegarLoopResult]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,489 INFO L246 CegarLoopResult]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,489 INFO L246 CegarLoopResult]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-27 22:40:15,489 INFO L246 CegarLoopResult]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-27 22:40:15,489 INFO L246 CegarLoopResult]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-27 22:40:15,489 INFO L246 CegarLoopResult]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-27 22:40:15,489 INFO L246 CegarLoopResult]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-27 22:40:15,490 INFO L246 CegarLoopResult]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-27 22:40:15,490 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:40:15,490 INFO L246 CegarLoopResult]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-27 22:40:15,490 INFO L246 CegarLoopResult]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-27 22:40:15,490 INFO L246 CegarLoopResult]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,490 INFO L246 CegarLoopResult]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,490 INFO L246 CegarLoopResult]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,490 INFO L246 CegarLoopResult]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-27 22:40:15,491 INFO L246 CegarLoopResult]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-27 22:40:15,491 INFO L246 CegarLoopResult]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-27 22:40:15,491 INFO L246 CegarLoopResult]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-27 22:40:15,491 INFO L246 CegarLoopResult]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-27 22:40:15,491 INFO L246 CegarLoopResult]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,491 INFO L246 CegarLoopResult]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,491 INFO L246 CegarLoopResult]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-27 22:40:15,491 INFO L246 CegarLoopResult]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-27 22:40:15,491 INFO L246 CegarLoopResult]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-27 22:40:15,492 INFO L246 CegarLoopResult]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-27 22:40:15,492 INFO L246 CegarLoopResult]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-27 22:40:15,492 INFO L246 CegarLoopResult]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-27 22:40:15,492 INFO L246 CegarLoopResult]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-27 22:40:15,492 INFO L246 CegarLoopResult]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-27 22:40:15,492 INFO L246 CegarLoopResult]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-27 22:40:15,492 INFO L246 CegarLoopResult]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-27 22:40:15,492 INFO L246 CegarLoopResult]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-27 22:40:15,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:40:15 BoogieIcfgContainer [2019-11-27 22:40:15,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:40:15,540 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:40:15,540 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:40:15,540 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:40:15,543 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:40:02" (3/4) ... [2019-11-27 22:40:15,547 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:40:15,583 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 22:40:15,584 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 22:40:15,807 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:40:15,807 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:40:15,809 INFO L168 Benchmark]: Toolchain (without parser) took 15222.54 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 432.5 MB). Free memory was 945.6 MB in the beginning and 1.3 GB in the end (delta: -389.5 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:15,810 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:40:15,810 INFO L168 Benchmark]: CACSL2BoogieTranslator took 693.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -190.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:15,811 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:15,811 INFO L168 Benchmark]: Boogie Preprocessor took 84.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:15,812 INFO L168 Benchmark]: RCFGBuilder took 1470.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.3 MB). Peak memory consumption was 110.3 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:15,812 INFO L168 Benchmark]: TraceAbstraction took 12602.26 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 277.9 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -333.9 MB). Peak memory consumption was 464.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:15,813 INFO L168 Benchmark]: Witness Printer took 267.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:40:15,815 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.42 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 693.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -190.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1470.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.3 MB). Peak memory consumption was 110.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12602.26 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 277.9 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -333.9 MB). Peak memory consumption was 464.5 MB. Max. memory is 11.5 GB. * Witness Printer took 267.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 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: 11.6s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 1537 SDtfs, 2378 SDslu, 267 SDs, 0 SdLazy, 5978 SolverSat, 948 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s 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.4s 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...