./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label18.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d1c52d14-d177-4f57-9bea-996748031d2f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d1c52d14-d177-4f57-9bea-996748031d2f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d1c52d14-d177-4f57-9bea-996748031d2f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d1c52d14-d177-4f57-9bea-996748031d2f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label18.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d1c52d14-d177-4f57-9bea-996748031d2f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d1c52d14-d177-4f57-9bea-996748031d2f/bin/uautomizer --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 eb8eeb6e67f290f9d56e698aa8c9c7a779115813 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:56:21,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:56:21,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:56:21,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:56:21,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:56:21,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:56:21,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:56:21,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:56:21,395 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:56:21,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:56:21,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:56:21,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:56:21,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:56:21,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:56:21,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:56:21,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:56:21,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:56:21,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:56:21,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:56:21,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:56:21,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:56:21,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:56:21,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:56:21,429 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:56:21,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:56:21,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:56:21,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:56:21,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:56:21,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:56:21,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:56:21,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:56:21,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:56:21,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:56:21,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:56:21,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:56:21,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:56:21,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:56:21,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:56:21,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:56:21,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:56:21,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:56:21,444 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d1c52d14-d177-4f57-9bea-996748031d2f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:56:21,475 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:56:21,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:56:21,477 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:56:21,477 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:56:21,477 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:56:21,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:56:21,478 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:56:21,478 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:56:21,478 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:56:21,478 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:56:21,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:56:21,479 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:56:21,479 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:56:21,479 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:56:21,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:56:21,480 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:56:21,480 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:56:21,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:56:21,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:56:21,480 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:56:21,481 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:56:21,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:56:21,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:56:21,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:56:21,482 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:56:21,482 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:56:21,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:56:21,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:56:21,482 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_d1c52d14-d177-4f57-9bea-996748031d2f/bin/uautomizer 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 -> eb8eeb6e67f290f9d56e698aa8c9c7a779115813 [2019-11-25 08:56:21,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:56:21,687 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:56:21,692 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:56:21,694 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:56:21,694 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:56:21,696 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d1c52d14-d177-4f57-9bea-996748031d2f/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label18.c [2019-11-25 08:56:21,770 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d1c52d14-d177-4f57-9bea-996748031d2f/bin/uautomizer/data/69088bb81/1d9fb7bb9371437b8ab9da93a2b8a054/FLAG03dd755a0 [2019-11-25 08:56:22,335 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:56:22,335 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d1c52d14-d177-4f57-9bea-996748031d2f/sv-benchmarks/c/eca-rers2012/Problem01_label18.c [2019-11-25 08:56:22,350 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d1c52d14-d177-4f57-9bea-996748031d2f/bin/uautomizer/data/69088bb81/1d9fb7bb9371437b8ab9da93a2b8a054/FLAG03dd755a0 [2019-11-25 08:56:22,580 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d1c52d14-d177-4f57-9bea-996748031d2f/bin/uautomizer/data/69088bb81/1d9fb7bb9371437b8ab9da93a2b8a054 [2019-11-25 08:56:22,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:56:22,584 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:56:22,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:56:22,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:56:22,589 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:56:22,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:56:22" (1/1) ... [2019-11-25 08:56:22,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f99f27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:22, skipping insertion in model container [2019-11-25 08:56:22,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:56:22" (1/1) ... [2019-11-25 08:56:22,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:56:22,669 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:56:23,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:56:23,235 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:56:23,346 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:56:23,362 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:56:23,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:23 WrapperNode [2019-11-25 08:56:23,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:56:23,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:56:23,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:56:23,370 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:56:23,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:23" (1/1) ... [2019-11-25 08:56:23,406 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:23" (1/1) ... [2019-11-25 08:56:23,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:56:23,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:56:23,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:56:23,506 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:56:23,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:23" (1/1) ... [2019-11-25 08:56:23,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:23" (1/1) ... [2019-11-25 08:56:23,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:23" (1/1) ... [2019-11-25 08:56:23,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:23" (1/1) ... [2019-11-25 08:56:23,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:23" (1/1) ... [2019-11-25 08:56:23,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:23" (1/1) ... [2019-11-25 08:56:23,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:23" (1/1) ... [2019-11-25 08:56:23,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:56:23,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:56:23,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:56:23,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:56:23,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d1c52d14-d177-4f57-9bea-996748031d2f/bin/uautomizer/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-25 08:56:23,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:56:23,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:56:25,108 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:56:25,109 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:56:25,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:25 BoogieIcfgContainer [2019-11-25 08:56:25,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:56:25,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:56:25,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:56:25,115 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:56:25,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:56:22" (1/3) ... [2019-11-25 08:56:25,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@305c6ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:56:25, skipping insertion in model container [2019-11-25 08:56:25,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:56:23" (2/3) ... [2019-11-25 08:56:25,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@305c6ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:56:25, skipping insertion in model container [2019-11-25 08:56:25,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:25" (3/3) ... [2019-11-25 08:56:25,122 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label18.c [2019-11-25 08:56:25,133 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:56:25,141 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:56:25,154 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:56:25,201 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:56:25,202 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:56:25,202 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:56:25,202 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:56:25,202 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:56:25,203 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:56:25,203 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:56:25,204 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:56:25,231 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-25 08:56:25,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:56:25,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:25,248 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:25,249 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:25,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:25,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1128398527, now seen corresponding path program 1 times [2019-11-25 08:56:25,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:25,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661273124] [2019-11-25 08:56:25,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:25,849 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-25 08:56:25,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661273124] [2019-11-25 08:56:25,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:25,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:25,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848138490] [2019-11-25 08:56:25,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:56:25,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:25,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:56:25,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:25,878 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-25 08:56:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:27,700 INFO L93 Difference]: Finished difference Result 687 states and 1203 transitions. [2019-11-25 08:56:27,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:56:27,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-25 08:56:27,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:27,720 INFO L225 Difference]: With dead ends: 687 [2019-11-25 08:56:27,721 INFO L226 Difference]: Without dead ends: 397 [2019-11-25 08:56:27,726 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-25 08:56:27,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-25 08:56:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-11-25 08:56:27,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-25 08:56:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-25 08:56:27,803 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 100 [2019-11-25 08:56:27,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:27,804 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-25 08:56:27,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:56:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-25 08:56:27,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 08:56:27,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:27,810 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:27,810 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:27,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:27,811 INFO L82 PathProgramCache]: Analyzing trace with hash -365392174, now seen corresponding path program 1 times [2019-11-25 08:56:27,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:27,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797989901] [2019-11-25 08:56:27,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:56:27,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797989901] [2019-11-25 08:56:27,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:27,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:27,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94944960] [2019-11-25 08:56:27,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:56:27,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:27,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:56:27,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:27,903 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-25 08:56:28,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:28,855 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-11-25 08:56:28,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:56:28,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-25 08:56:28,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:28,862 INFO L225 Difference]: With dead ends: 1054 [2019-11-25 08:56:28,862 INFO L226 Difference]: Without dead ends: 790 [2019-11-25 08:56:28,870 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-25 08:56:28,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-25 08:56:28,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-25 08:56:28,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-25 08:56:28,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1068 transitions. [2019-11-25 08:56:28,924 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1068 transitions. Word has length 106 [2019-11-25 08:56:28,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:28,925 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1068 transitions. [2019-11-25 08:56:28,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:56:28,925 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1068 transitions. [2019-11-25 08:56:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-25 08:56:28,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:28,932 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:28,932 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:28,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:28,932 INFO L82 PathProgramCache]: Analyzing trace with hash -877508142, now seen corresponding path program 1 times [2019-11-25 08:56:28,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:28,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230000038] [2019-11-25 08:56:28,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-25 08:56:29,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230000038] [2019-11-25 08:56:29,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:29,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:29,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261111098] [2019-11-25 08:56:29,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:29,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:29,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:29,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:29,139 INFO L87 Difference]: Start difference. First operand 790 states and 1068 transitions. Second operand 3 states. [2019-11-25 08:56:29,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:29,773 INFO L93 Difference]: Finished difference Result 2233 states and 3001 transitions. [2019-11-25 08:56:29,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:29,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-11-25 08:56:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:29,783 INFO L225 Difference]: With dead ends: 2233 [2019-11-25 08:56:29,783 INFO L226 Difference]: Without dead ends: 1445 [2019-11-25 08:56:29,785 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-25 08:56:29,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-25 08:56:29,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2019-11-25 08:56:29,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-25 08:56:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1496 transitions. [2019-11-25 08:56:29,825 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1496 transitions. Word has length 107 [2019-11-25 08:56:29,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:29,825 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1496 transitions. [2019-11-25 08:56:29,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:29,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1496 transitions. [2019-11-25 08:56:29,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-25 08:56:29,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:29,831 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 08:56:29,831 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:29,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:29,832 INFO L82 PathProgramCache]: Analyzing trace with hash 873346348, now seen corresponding path program 1 times [2019-11-25 08:56:29,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:29,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601551433] [2019-11-25 08:56:29,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:29,925 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-25 08:56:29,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601551433] [2019-11-25 08:56:29,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:29,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:29,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872374628] [2019-11-25 08:56:29,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:29,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:29,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:29,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:29,929 INFO L87 Difference]: Start difference. First operand 1183 states and 1496 transitions. Second operand 3 states. [2019-11-25 08:56:30,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:30,596 INFO L93 Difference]: Finished difference Result 2757 states and 3510 transitions. [2019-11-25 08:56:30,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:30,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-25 08:56:30,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:30,608 INFO L225 Difference]: With dead ends: 2757 [2019-11-25 08:56:30,608 INFO L226 Difference]: Without dead ends: 1576 [2019-11-25 08:56:30,611 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-25 08:56:30,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-25 08:56:30,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1314. [2019-11-25 08:56:30,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-25 08:56:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1658 transitions. [2019-11-25 08:56:30,659 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1658 transitions. Word has length 123 [2019-11-25 08:56:30,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:30,659 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1658 transitions. [2019-11-25 08:56:30,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1658 transitions. [2019-11-25 08:56:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-25 08:56:30,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:30,663 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:30,663 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:30,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:30,664 INFO L82 PathProgramCache]: Analyzing trace with hash 5388463, now seen corresponding path program 1 times [2019-11-25 08:56:30,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:30,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984537877] [2019-11-25 08:56:30,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-25 08:56:30,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984537877] [2019-11-25 08:56:30,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:30,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:30,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820876004] [2019-11-25 08:56:30,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:30,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:30,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:30,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:30,805 INFO L87 Difference]: Start difference. First operand 1314 states and 1658 transitions. Second operand 3 states. [2019-11-25 08:56:31,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:31,428 INFO L93 Difference]: Finished difference Result 3281 states and 4119 transitions. [2019-11-25 08:56:31,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:31,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-25 08:56:31,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:31,443 INFO L225 Difference]: With dead ends: 3281 [2019-11-25 08:56:31,443 INFO L226 Difference]: Without dead ends: 1969 [2019-11-25 08:56:31,445 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-25 08:56:31,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-25 08:56:31,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1576. [2019-11-25 08:56:31,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-25 08:56:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1962 transitions. [2019-11-25 08:56:31,497 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1962 transitions. Word has length 134 [2019-11-25 08:56:31,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:31,498 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1962 transitions. [2019-11-25 08:56:31,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:31,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1962 transitions. [2019-11-25 08:56:31,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-25 08:56:31,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:31,502 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-25 08:56:31,503 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:31,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:31,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1459525699, now seen corresponding path program 1 times [2019-11-25 08:56:31,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:31,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815596490] [2019-11-25 08:56:31,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-25 08:56:31,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815596490] [2019-11-25 08:56:31,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:31,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:31,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567993526] [2019-11-25 08:56:31,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:56:31,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:31,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:56:31,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:31,629 INFO L87 Difference]: Start difference. First operand 1576 states and 1962 transitions. Second operand 4 states. [2019-11-25 08:56:32,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:32,432 INFO L93 Difference]: Finished difference Result 3286 states and 4070 transitions. [2019-11-25 08:56:32,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:56:32,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-25 08:56:32,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:32,444 INFO L225 Difference]: With dead ends: 3286 [2019-11-25 08:56:32,444 INFO L226 Difference]: Without dead ends: 1712 [2019-11-25 08:56:32,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:56:32,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2019-11-25 08:56:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1707. [2019-11-25 08:56:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-25 08:56:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2099 transitions. [2019-11-25 08:56:32,493 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2099 transitions. Word has length 142 [2019-11-25 08:56:32,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:32,495 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2099 transitions. [2019-11-25 08:56:32,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:56:32,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2099 transitions. [2019-11-25 08:56:32,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-25 08:56:32,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:32,500 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-25 08:56:32,500 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:32,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:32,505 INFO L82 PathProgramCache]: Analyzing trace with hash -822596485, now seen corresponding path program 1 times [2019-11-25 08:56:32,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:32,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292179389] [2019-11-25 08:56:32,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:32,621 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-25 08:56:32,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292179389] [2019-11-25 08:56:32,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:32,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:56:32,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257137155] [2019-11-25 08:56:32,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:56:32,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:32,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:56:32,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:56:32,633 INFO L87 Difference]: Start difference. First operand 1707 states and 2099 transitions. Second operand 5 states. [2019-11-25 08:56:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:33,772 INFO L93 Difference]: Finished difference Result 3805 states and 4667 transitions. [2019-11-25 08:56:33,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:56:33,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-11-25 08:56:33,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:33,785 INFO L225 Difference]: With dead ends: 3805 [2019-11-25 08:56:33,785 INFO L226 Difference]: Without dead ends: 2231 [2019-11-25 08:56:33,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:56:33,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-11-25 08:56:33,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1969. [2019-11-25 08:56:33,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-25 08:56:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2373 transitions. [2019-11-25 08:56:33,841 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2373 transitions. Word has length 146 [2019-11-25 08:56:33,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:33,841 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2373 transitions. [2019-11-25 08:56:33,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:56:33,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2373 transitions. [2019-11-25 08:56:33,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-25 08:56:33,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:33,846 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-25 08:56:33,847 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:33,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:33,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2101585002, now seen corresponding path program 1 times [2019-11-25 08:56:33,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:33,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571798312] [2019-11-25 08:56:33,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:33,919 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-25 08:56:33,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571798312] [2019-11-25 08:56:33,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:33,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:56:33,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877894041] [2019-11-25 08:56:33,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:33,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:33,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:33,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:33,921 INFO L87 Difference]: Start difference. First operand 1969 states and 2373 transitions. Second operand 3 states. [2019-11-25 08:56:34,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:34,377 INFO L93 Difference]: Finished difference Result 4067 states and 4887 transitions. [2019-11-25 08:56:34,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:34,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-25 08:56:34,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:34,386 INFO L225 Difference]: With dead ends: 4067 [2019-11-25 08:56:34,386 INFO L226 Difference]: Without dead ends: 1969 [2019-11-25 08:56:34,389 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-25 08:56:34,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-25 08:56:34,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-11-25 08:56:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-25 08:56:34,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2015 transitions. [2019-11-25 08:56:34,434 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2015 transitions. Word has length 149 [2019-11-25 08:56:34,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:34,434 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2015 transitions. [2019-11-25 08:56:34,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:34,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2015 transitions. [2019-11-25 08:56:34,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-25 08:56:34,439 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:34,439 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:34,439 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:34,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:34,440 INFO L82 PathProgramCache]: Analyzing trace with hash -385356518, now seen corresponding path program 1 times [2019-11-25 08:56:34,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:34,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492368046] [2019-11-25 08:56:34,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-25 08:56:34,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492368046] [2019-11-25 08:56:34,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:34,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:56:34,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978851549] [2019-11-25 08:56:34,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:34,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:34,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:34,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:56:34,549 INFO L87 Difference]: Start difference. First operand 1838 states and 2015 transitions. Second operand 3 states. [2019-11-25 08:56:35,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:35,009 INFO L93 Difference]: Finished difference Result 3674 states and 4028 transitions. [2019-11-25 08:56:35,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:35,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-25 08:56:35,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:35,020 INFO L225 Difference]: With dead ends: 3674 [2019-11-25 08:56:35,020 INFO L226 Difference]: Without dead ends: 1838 [2019-11-25 08:56:35,022 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-25 08:56:35,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-25 08:56:35,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-11-25 08:56:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-25 08:56:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2010 transitions. [2019-11-25 08:56:35,065 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2010 transitions. Word has length 164 [2019-11-25 08:56:35,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:35,066 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2010 transitions. [2019-11-25 08:56:35,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:35,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2010 transitions. [2019-11-25 08:56:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-25 08:56:35,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:35,071 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:35,071 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:35,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:35,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1871280910, now seen corresponding path program 1 times [2019-11-25 08:56:35,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:35,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627343474] [2019-11-25 08:56:35,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:56:35,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627343474] [2019-11-25 08:56:35,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811418193] [2019-11-25 08:56:35,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d1c52d14-d177-4f57-9bea-996748031d2f/bin/uautomizer/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-25 08:56:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:35,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:56:35,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:35,548 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-25 08:56:35,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:56:35,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-25 08:56:35,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639115174] [2019-11-25 08:56:35,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:35,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:35,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:35,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:56:35,550 INFO L87 Difference]: Start difference. First operand 1838 states and 2010 transitions. Second operand 3 states. [2019-11-25 08:56:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:36,099 INFO L93 Difference]: Finished difference Result 2757 states and 2995 transitions. [2019-11-25 08:56:36,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:36,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-25 08:56:36,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:36,116 INFO L225 Difference]: With dead ends: 2757 [2019-11-25 08:56:36,116 INFO L226 Difference]: Without dead ends: 2624 [2019-11-25 08:56:36,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:56:36,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2019-11-25 08:56:36,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1969. [2019-11-25 08:56:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-25 08:56:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2143 transitions. [2019-11-25 08:56:36,179 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2143 transitions. Word has length 193 [2019-11-25 08:56:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:36,180 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2143 transitions. [2019-11-25 08:56:36,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:36,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2143 transitions. [2019-11-25 08:56:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-11-25 08:56:36,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:36,188 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:36,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:36,393 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:36,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:36,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1923073630, now seen corresponding path program 1 times [2019-11-25 08:56:36,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:36,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710408516] [2019-11-25 08:56:36,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 141 proven. 70 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-25 08:56:36,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710408516] [2019-11-25 08:56:36,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945714755] [2019-11-25 08:56:36,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d1c52d14-d177-4f57-9bea-996748031d2f/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:36,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:56:36,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:36,946 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-25 08:56:36,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:56:36,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-25 08:56:36,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591502230] [2019-11-25 08:56:36,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:56:36,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:36,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:56:36,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:56:36,949 INFO L87 Difference]: Start difference. First operand 1969 states and 2143 transitions. Second operand 3 states. [2019-11-25 08:56:37,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:37,478 INFO L93 Difference]: Finished difference Result 1971 states and 2144 transitions. [2019-11-25 08:56:37,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:37,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-11-25 08:56:37,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:37,489 INFO L225 Difference]: With dead ends: 1971 [2019-11-25 08:56:37,489 INFO L226 Difference]: Without dead ends: 1969 [2019-11-25 08:56:37,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:56:37,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-25 08:56:37,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-11-25 08:56:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-25 08:56:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1989 transitions. [2019-11-25 08:56:37,551 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1989 transitions. Word has length 222 [2019-11-25 08:56:37,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:37,552 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 1989 transitions. [2019-11-25 08:56:37,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:56:37,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1989 transitions. [2019-11-25 08:56:37,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-25 08:56:37,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:37,558 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, 4, 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, 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] [2019-11-25 08:56:37,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:37,763 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:37,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:37,763 INFO L82 PathProgramCache]: Analyzing trace with hash -451722141, now seen corresponding path program 1 times [2019-11-25 08:56:37,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:37,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34539286] [2019-11-25 08:56:37,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-25 08:56:38,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34539286] [2019-11-25 08:56:38,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:38,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-25 08:56:38,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564773427] [2019-11-25 08:56:38,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-25 08:56:38,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:38,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 08:56:38,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:56:38,947 INFO L87 Difference]: Start difference. First operand 1838 states and 1989 transitions. Second operand 13 states. [2019-11-25 08:56:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:40,457 INFO L93 Difference]: Finished difference Result 4256 states and 4613 transitions. [2019-11-25 08:56:40,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:56:40,457 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 235 [2019-11-25 08:56:40,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:40,470 INFO L225 Difference]: With dead ends: 4256 [2019-11-25 08:56:40,470 INFO L226 Difference]: Without dead ends: 2420 [2019-11-25 08:56:40,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-11-25 08:56:40,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2019-11-25 08:56:40,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1896. [2019-11-25 08:56:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-11-25 08:56:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2050 transitions. [2019-11-25 08:56:40,524 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2050 transitions. Word has length 235 [2019-11-25 08:56:40,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:40,524 INFO L462 AbstractCegarLoop]: Abstraction has 1896 states and 2050 transitions. [2019-11-25 08:56:40,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-25 08:56:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2050 transitions. [2019-11-25 08:56:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-11-25 08:56:40,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:40,531 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 08:56:40,531 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:40,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:40,532 INFO L82 PathProgramCache]: Analyzing trace with hash 580910416, now seen corresponding path program 1 times [2019-11-25 08:56:40,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:40,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363363313] [2019-11-25 08:56:40,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:40,826 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-25 08:56:40,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363363313] [2019-11-25 08:56:40,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:40,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:56:40,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109796924] [2019-11-25 08:56:40,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:56:40,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:40,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:56:40,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:56:40,833 INFO L87 Difference]: Start difference. First operand 1896 states and 2050 transitions. Second operand 6 states. [2019-11-25 08:56:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:41,674 INFO L93 Difference]: Finished difference Result 4221 states and 4562 transitions. [2019-11-25 08:56:41,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:56:41,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 262 [2019-11-25 08:56:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:41,687 INFO L225 Difference]: With dead ends: 4221 [2019-11-25 08:56:41,687 INFO L226 Difference]: Without dead ends: 2327 [2019-11-25 08:56:41,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:56:41,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2019-11-25 08:56:41,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 2027. [2019-11-25 08:56:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2027 states. [2019-11-25 08:56:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2180 transitions. [2019-11-25 08:56:41,740 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2180 transitions. Word has length 262 [2019-11-25 08:56:41,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:41,740 INFO L462 AbstractCegarLoop]: Abstraction has 2027 states and 2180 transitions. [2019-11-25 08:56:41,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:56:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2180 transitions. [2019-11-25 08:56:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-11-25 08:56:41,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:41,748 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 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, 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, 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] [2019-11-25 08:56:41,749 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:41,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:41,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1379127925, now seen corresponding path program 1 times [2019-11-25 08:56:41,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:41,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981070035] [2019-11-25 08:56:41,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:42,029 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-25 08:56:42,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981070035] [2019-11-25 08:56:42,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:42,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:56:42,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084675518] [2019-11-25 08:56:42,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:56:42,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:42,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:56:42,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:56:42,034 INFO L87 Difference]: Start difference. First operand 2027 states and 2180 transitions. Second operand 5 states. [2019-11-25 08:56:43,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:43,146 INFO L93 Difference]: Finished difference Result 4969 states and 5350 transitions. [2019-11-25 08:56:43,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:56:43,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 273 [2019-11-25 08:56:43,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:43,156 INFO L225 Difference]: With dead ends: 4969 [2019-11-25 08:56:43,156 INFO L226 Difference]: Without dead ends: 1896 [2019-11-25 08:56:43,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:56:43,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-11-25 08:56:43,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1896. [2019-11-25 08:56:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-11-25 08:56:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 1999 transitions. [2019-11-25 08:56:43,208 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 1999 transitions. Word has length 273 [2019-11-25 08:56:43,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:43,208 INFO L462 AbstractCegarLoop]: Abstraction has 1896 states and 1999 transitions. [2019-11-25 08:56:43,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:56:43,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 1999 transitions. [2019-11-25 08:56:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-11-25 08:56:43,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:43,218 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2019-11-25 08:56:43,218 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:43,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:43,219 INFO L82 PathProgramCache]: Analyzing trace with hash 990654567, now seen corresponding path program 1 times [2019-11-25 08:56:43,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:43,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238938615] [2019-11-25 08:56:43,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-25 08:56:43,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238938615] [2019-11-25 08:56:43,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:56:43,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:56:43,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528296689] [2019-11-25 08:56:43,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:56:43,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:43,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:56:43,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:56:43,530 INFO L87 Difference]: Start difference. First operand 1896 states and 1999 transitions. Second operand 4 states. [2019-11-25 08:56:43,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:43,981 INFO L93 Difference]: Finished difference Result 3788 states and 4007 transitions. [2019-11-25 08:56:43,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:56:43,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2019-11-25 08:56:43,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:43,982 INFO L225 Difference]: With dead ends: 3788 [2019-11-25 08:56:43,983 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:56:43,988 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-25 08:56:43,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:56:43,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:56:43,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:56:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:56:43,989 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 284 [2019-11-25 08:56:43,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:43,990 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:56:43,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:56:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:56:43,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:56:43,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:56:44,136 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 104 [2019-11-25 08:56:44,276 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 110 [2019-11-25 08:56:44,961 WARN L192 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 60 [2019-11-25 08:56:45,716 WARN L192 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 60 [2019-11-25 08:56:45,719 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-25 08:56:45,719 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-25 08:56:45,719 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,719 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,719 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,719 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,720 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,720 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,720 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-25 08:56:45,720 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-25 08:56:45,720 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-25 08:56:45,720 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-25 08:56:45,720 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-25 08:56:45,720 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-25 08:56:45,720 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-25 08:56:45,720 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-25 08:56:45,720 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-25 08:56:45,720 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-25 08:56:45,721 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,721 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,721 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,721 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,721 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,721 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,723 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-25 08:56:45,723 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-25 08:56:45,724 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-25 08:56:45,724 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-25 08:56:45,724 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-25 08:56:45,724 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-25 08:56:45,724 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-25 08:56:45,724 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-25 08:56:45,725 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-25 08:56:45,725 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-25 08:56:45,725 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-25 08:56:45,725 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-25 08:56:45,725 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-25 08:56:45,725 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-25 08:56:45,725 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-25 08:56:45,726 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,726 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,726 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,726 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,726 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,726 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-25 08:56:45,726 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-25 08:56:45,727 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-25 08:56:45,727 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-25 08:56:45,727 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-25 08:56:45,727 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-25 08:56:45,727 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-25 08:56:45,727 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-25 08:56:45,727 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-25 08:56:45,729 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse7 (= 1 ~a7~0)) (.cse13 (= ~a16~0 6)) (.cse11 (= 15 ~a8~0))) (let ((.cse8 (<= ~a21~0 0)) (.cse0 (= ~a16~0 4)) (.cse4 (not .cse11)) (.cse9 (not .cse13)) (.cse10 (= ~a17~0 1)) (.cse12 (= ~a16~0 5)) (.cse1 (= ~a12~0 8)) (.cse5 (not .cse7)) (.cse2 (<= ~a17~0 0)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1))) (or (and (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse0 .cse1 .cse2 .cse3 (<= ~a20~0 0)) (and .cse4 .cse5 .cse3 .cse6) (and .cse7 .cse8 .cse9 .cse10) (and .cse7 .cse8 .cse6) (and .cse5 .cse10 .cse1 .cse3 .cse11) (and .cse7 (<= 15 ~a8~0) .cse3 .cse12) (and .cse2 .cse3 .cse12) (and .cse10 .cse3 .cse6 (not .cse0)) (and .cse4 .cse9 .cse5 .cse3) (and .cse7 .cse9 .cse2 .cse3) (and .cse7 (or (and .cse10 .cse6 .cse3) (and .cse3 .cse6 .cse12))) (and .cse5 .cse1 .cse2 .cse3 .cse11 .cse13) (and .cse5 .cse2 .cse3 .cse6)))) [2019-11-25 08:56:45,730 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,730 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,730 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,730 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,730 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,730 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-25 08:56:45,730 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-25 08:56:45,731 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-25 08:56:45,731 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-25 08:56:45,731 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-25 08:56:45,731 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-25 08:56:45,731 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-25 08:56:45,731 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-25 08:56:45,732 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-25 08:56:45,732 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-25 08:56:45,732 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-25 08:56:45,732 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-25 08:56:45,732 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-25 08:56:45,732 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-25 08:56:45,732 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,733 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,733 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,733 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,733 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,733 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-25 08:56:45,733 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-25 08:56:45,733 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-25 08:56:45,734 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-25 08:56:45,734 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-25 08:56:45,734 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-25 08:56:45,734 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-25 08:56:45,734 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-25 08:56:45,734 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-25 08:56:45,735 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,735 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,735 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,735 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,735 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-25 08:56:45,735 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,735 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-25 08:56:45,736 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-25 08:56:45,736 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-25 08:56:45,736 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-25 08:56:45,736 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-25 08:56:45,736 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-25 08:56:45,736 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-25 08:56:45,736 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:56:45,737 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-25 08:56:45,737 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-25 08:56:45,737 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-25 08:56:45,737 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-25 08:56:45,737 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-25 08:56:45,737 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-25 08:56:45,737 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,738 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse7 (= 1 ~a7~0)) (.cse13 (= ~a16~0 6)) (.cse11 (= 15 ~a8~0))) (let ((.cse8 (<= ~a21~0 0)) (.cse0 (= ~a16~0 4)) (.cse4 (not .cse11)) (.cse9 (not .cse13)) (.cse10 (= ~a17~0 1)) (.cse12 (= ~a16~0 5)) (.cse1 (= ~a12~0 8)) (.cse5 (not .cse7)) (.cse2 (<= ~a17~0 0)) (.cse3 (= ~a21~0 1)) (.cse6 (= ~a20~0 1))) (or (and (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse0 .cse1 .cse2 .cse3 (<= ~a20~0 0)) (and .cse4 .cse5 .cse3 .cse6) (and .cse7 .cse8 .cse9 .cse10) (and .cse7 .cse8 .cse6) (and .cse5 .cse10 .cse1 .cse3 .cse11) (and .cse7 (<= 15 ~a8~0) .cse3 .cse12) (and .cse2 .cse3 .cse12) (and .cse10 .cse3 .cse6 (not .cse0)) (and .cse4 .cse9 .cse5 .cse3) (and .cse7 .cse9 .cse2 .cse3) (and .cse7 (or (and .cse10 .cse6 .cse3) (and .cse3 .cse6 .cse12))) (and .cse5 .cse1 .cse2 .cse3 .cse11 .cse13) (and .cse5 .cse2 .cse3 .cse6)))) [2019-11-25 08:56:45,738 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,738 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,738 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,739 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,739 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-25 08:56:45,739 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-25 08:56:45,739 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-25 08:56:45,739 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-25 08:56:45,740 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-25 08:56:45,740 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-25 08:56:45,740 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-25 08:56:45,740 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-25 08:56:45,740 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,740 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,740 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,741 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,741 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,741 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-25 08:56:45,741 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:56:45,741 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-25 08:56:45,741 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-25 08:56:45,741 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-25 08:56:45,742 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-25 08:56:45,742 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-25 08:56:45,742 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-25 08:56:45,742 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-25 08:56:45,742 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-25 08:56:45,742 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-25 08:56:45,743 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-25 08:56:45,743 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-25 08:56:45,743 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,743 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,743 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,743 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,743 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-25 08:56:45,744 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,744 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,744 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-25 08:56:45,744 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-25 08:56:45,744 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:56:45,744 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-25 08:56:45,744 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-25 08:56:45,745 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-25 08:56:45,745 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-25 08:56:45,745 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-25 08:56:45,745 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-25 08:56:45,745 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-25 08:56:45,745 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-25 08:56:45,745 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-25 08:56:45,746 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-25 08:56:45,746 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,746 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,746 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,746 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,746 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,746 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-25 08:56:45,747 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,747 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-25 08:56:45,747 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-25 08:56:45,747 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-25 08:56:45,747 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-25 08:56:45,747 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-25 08:56:45,747 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-25 08:56:45,748 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-25 08:56:45,748 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-25 08:56:45,748 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-25 08:56:45,748 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-25 08:56:45,748 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-25 08:56:45,748 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:56:45,749 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 476) no Hoare annotation was computed. [2019-11-25 08:56:45,749 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-25 08:56:45,749 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-25 08:56:45,749 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-25 08:56:45,749 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,749 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,749 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,750 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,750 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,750 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:56:45,750 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-25 08:56:45,750 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-25 08:56:45,750 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-25 08:56:45,750 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-25 08:56:45,751 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-25 08:56:45,751 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-25 08:56:45,751 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-25 08:56:45,751 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-25 08:56:45,751 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-25 08:56:45,751 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-25 08:56:45,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:56:45 BoogieIcfgContainer [2019-11-25 08:56:45,797 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:56:45,797 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:56:45,798 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:56:45,798 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:56:45,798 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:56:25" (3/4) ... [2019-11-25 08:56:45,804 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:56:45,838 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:56:45,840 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:56:46,031 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d1c52d14-d177-4f57-9bea-996748031d2f/bin/uautomizer/witness.graphml [2019-11-25 08:56:46,031 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:56:46,033 INFO L168 Benchmark]: Toolchain (without parser) took 23448.68 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 520.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -136.7 MB). Peak memory consumption was 383.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:46,033 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:56:46,033 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -211.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:46,034 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:46,034 INFO L168 Benchmark]: Boogie Preprocessor took 115.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:56:46,035 INFO L168 Benchmark]: RCFGBuilder took 1488.77 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: 112.0 MB). Peak memory consumption was 112.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:46,035 INFO L168 Benchmark]: TraceAbstraction took 20685.36 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 340.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -61.1 MB). Peak memory consumption was 279.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:46,035 INFO L168 Benchmark]: Witness Printer took 233.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:46,037 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.34 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 783.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -211.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 135.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 115.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1488.77 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: 112.0 MB). Peak memory consumption was 112.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20685.36 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 340.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -61.1 MB). Peak memory consumption was 279.2 MB. Max. memory is 11.5 GB. * Witness Printer took 233.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 476]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input) && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0) || (((!(15 == a8) && !(1 == a7)) && a21 == 1) && a20 == 1)) || (((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1)) || ((1 == a7 && a21 <= 0) && a20 == 1)) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8)) || (((1 == a7 && 15 <= a8) && a21 == 1) && a16 == 5)) || ((a17 <= 0 && a21 == 1) && a16 == 5)) || (((a17 == 1 && a21 == 1) && a20 == 1) && !(a16 == 4))) || (((!(15 == a8) && !(a16 == 6)) && !(1 == a7)) && a21 == 1)) || (((1 == a7 && !(a16 == 6)) && a17 <= 0) && a21 == 1)) || (1 == a7 && (((a17 == 1 && a20 == 1) && a21 == 1) || ((a21 == 1 && a20 == 1) && a16 == 5)))) || (((((!(1 == a7) && a12 == 8) && a17 <= 0) && a21 == 1) && 15 == a8) && a16 == 6)) || (((!(1 == a7) && a17 <= 0) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input) && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0) || (((!(15 == a8) && !(1 == a7)) && a21 == 1) && a20 == 1)) || (((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1)) || ((1 == a7 && a21 <= 0) && a20 == 1)) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8)) || (((1 == a7 && 15 <= a8) && a21 == 1) && a16 == 5)) || ((a17 <= 0 && a21 == 1) && a16 == 5)) || (((a17 == 1 && a21 == 1) && a20 == 1) && !(a16 == 4))) || (((!(15 == a8) && !(a16 == 6)) && !(1 == a7)) && a21 == 1)) || (((1 == a7 && !(a16 == 6)) && a17 <= 0) && a21 == 1)) || (1 == a7 && (((a17 == 1 && a20 == 1) && a21 == 1) || ((a21 == 1 && a20 == 1) && a16 == 5)))) || (((((!(1 == a7) && a12 == 8) && a17 <= 0) && a21 == 1) && 15 == a8) && a16 == 6)) || (((!(1 == a7) && a17 <= 0) && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 20.5s, OverallIterations: 15, TraceHistogramMax: 5, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, HoareTripleCheckerStatistics: 1123 SDtfs, 3017 SDslu, 162 SDs, 0 SdLazy, 7807 SolverSat, 1027 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 494 GetRequests, 440 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2027occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 3056 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 58 NumberOfFragments, 437 HoareAnnotationTreeSize, 3 FomulaSimplifications, 52946 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2776 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 3055 NumberOfCodeBlocks, 3055 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3038 ConstructedInterpolants, 0 QuantifiedInterpolants, 2147869 SizeOfPredicates, 2 NumberOfNonLiveVariables, 765 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 2445/2542 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...