./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_be7db3d8-5a67-45de-8ba3-1380c59b45d7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_be7db3d8-5a67-45de-8ba3-1380c59b45d7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_be7db3d8-5a67-45de-8ba3-1380c59b45d7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_be7db3d8-5a67-45de-8ba3-1380c59b45d7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label00.c -s /tmp/vcloud-vcloud-master/worker/run_dir_be7db3d8-5a67-45de-8ba3-1380c59b45d7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_be7db3d8-5a67-45de-8ba3-1380c59b45d7/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 e521cfa02db8c2eac8727300620f5ffec2ecc0c7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:46:13,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:46:13,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:46:13,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:46:13,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:46:13,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:46:13,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:46:13,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:46:13,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:46:13,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:46:13,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:46:13,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:46:13,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:46:13,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:46:13,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:46:13,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:46:13,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:46:13,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:46:13,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:46:13,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:46:13,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:46:13,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:46:13,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:46:13,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:46:13,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:46:13,502 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:46:13,502 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:46:13,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:46:13,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:46:13,503 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:46:13,503 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:46:13,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:46:13,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:46:13,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:46:13,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:46:13,505 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:46:13,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:46:13,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:46:13,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:46:13,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:46:13,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:46:13,507 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_be7db3d8-5a67-45de-8ba3-1380c59b45d7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:46:13,517 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:46:13,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:46:13,518 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:46:13,518 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:46:13,518 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:46:13,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:46:13,518 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:46:13,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:46:13,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:46:13,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:46:13,519 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:46:13,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:46:13,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:46:13,519 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:46:13,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:46:13,520 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:46:13,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:46:13,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:46:13,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:46:13,520 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:46:13,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:46:13,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:46:13,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:46:13,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:46:13,521 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:46:13,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:46:13,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:46:13,521 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:46:13,521 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:46:13,522 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_be7db3d8-5a67-45de-8ba3-1380c59b45d7/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 -> e521cfa02db8c2eac8727300620f5ffec2ecc0c7 [2019-12-07 11:46:13,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:46:13,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:46:13,628 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:46:13,629 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:46:13,629 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:46:13,630 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_be7db3d8-5a67-45de-8ba3-1380c59b45d7/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label00.c [2019-12-07 11:46:13,664 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_be7db3d8-5a67-45de-8ba3-1380c59b45d7/bin/uautomizer/data/120bb0c0f/fc4030bc82794bdd99e43030ee4d62dc/FLAGd24d8febd [2019-12-07 11:46:14,114 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:46:14,114 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_be7db3d8-5a67-45de-8ba3-1380c59b45d7/sv-benchmarks/c/eca-rers2012/Problem02_label00.c [2019-12-07 11:46:14,123 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_be7db3d8-5a67-45de-8ba3-1380c59b45d7/bin/uautomizer/data/120bb0c0f/fc4030bc82794bdd99e43030ee4d62dc/FLAGd24d8febd [2019-12-07 11:46:14,131 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_be7db3d8-5a67-45de-8ba3-1380c59b45d7/bin/uautomizer/data/120bb0c0f/fc4030bc82794bdd99e43030ee4d62dc [2019-12-07 11:46:14,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:46:14,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:46:14,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:46:14,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:46:14,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:46:14,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:46:14" (1/1) ... [2019-12-07 11:46:14,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6947e074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:14, skipping insertion in model container [2019-12-07 11:46:14,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:46:14" (1/1) ... [2019-12-07 11:46:14,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:46:14,176 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:46:14,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:46:14,426 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:46:14,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:46:14,491 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:46:14,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:14 WrapperNode [2019-12-07 11:46:14,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:46:14,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:46:14,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:46:14,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:46:14,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:14" (1/1) ... [2019-12-07 11:46:14,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:14" (1/1) ... [2019-12-07 11:46:14,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:46:14,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:46:14,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:46:14,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:46:14,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:14" (1/1) ... [2019-12-07 11:46:14,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:14" (1/1) ... [2019-12-07 11:46:14,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:14" (1/1) ... [2019-12-07 11:46:14,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:14" (1/1) ... [2019-12-07 11:46:14,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:14" (1/1) ... [2019-12-07 11:46:14,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:14" (1/1) ... [2019-12-07 11:46:14,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:14" (1/1) ... [2019-12-07 11:46:14,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:46:14,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:46:14,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:46:14,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:46:14,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be7db3d8-5a67-45de-8ba3-1380c59b45d7/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-12-07 11:46:14,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:46:14,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:46:15,221 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:46:15,222 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 11:46:15,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:46:15 BoogieIcfgContainer [2019-12-07 11:46:15,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:46:15,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:46:15,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:46:15,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:46:15,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:46:14" (1/3) ... [2019-12-07 11:46:15,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a6b170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:46:15, skipping insertion in model container [2019-12-07 11:46:15,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:46:14" (2/3) ... [2019-12-07 11:46:15,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a6b170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:46:15, skipping insertion in model container [2019-12-07 11:46:15,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:46:15" (3/3) ... [2019-12-07 11:46:15,230 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label00.c [2019-12-07 11:46:15,239 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:46:15,245 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:46:15,256 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:46:15,280 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:46:15,281 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:46:15,281 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:46:15,281 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:46:15,281 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:46:15,281 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:46:15,281 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:46:15,281 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:46:15,301 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-12-07 11:46:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 11:46:15,311 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:15,312 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:46:15,312 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:46:15,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:15,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1162953203, now seen corresponding path program 1 times [2019-12-07 11:46:15,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:46:15,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342982705] [2019-12-07 11:46:15,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:15,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:46:15,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342982705] [2019-12-07 11:46:15,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:15,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:46:15,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322716958] [2019-12-07 11:46:15,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:46:15,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:46:15,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:46:15,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:46:15,608 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-12-07 11:46:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:16,375 INFO L93 Difference]: Finished difference Result 775 states and 1353 transitions. [2019-12-07 11:46:16,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:46:16,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-12-07 11:46:16,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:16,392 INFO L225 Difference]: With dead ends: 775 [2019-12-07 11:46:16,392 INFO L226 Difference]: Without dead ends: 460 [2019-12-07 11:46:16,395 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-12-07 11:46:16,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-12-07 11:46:16,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 308. [2019-12-07 11:46:16,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-12-07 11:46:16,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 451 transitions. [2019-12-07 11:46:16,445 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 451 transitions. Word has length 115 [2019-12-07 11:46:16,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:16,446 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 451 transitions. [2019-12-07 11:46:16,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:46:16,446 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 451 transitions. [2019-12-07 11:46:16,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 11:46:16,449 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:16,449 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:46:16,449 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:46:16,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:16,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1399875752, now seen corresponding path program 1 times [2019-12-07 11:46:16,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:46:16,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024789222] [2019-12-07 11:46:16,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:46:16,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024789222] [2019-12-07 11:46:16,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:16,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:46:16,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662884449] [2019-12-07 11:46:16,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:46:16,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:46:16,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:46:16,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:46:16,548 INFO L87 Difference]: Start difference. First operand 308 states and 451 transitions. Second operand 3 states. [2019-12-07 11:46:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:16,855 INFO L93 Difference]: Finished difference Result 903 states and 1331 transitions. [2019-12-07 11:46:16,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:46:16,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-12-07 11:46:16,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:16,859 INFO L225 Difference]: With dead ends: 903 [2019-12-07 11:46:16,860 INFO L226 Difference]: Without dead ends: 597 [2019-12-07 11:46:16,861 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-12-07 11:46:16,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-12-07 11:46:16,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 592. [2019-12-07 11:46:16,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-12-07 11:46:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 825 transitions. [2019-12-07 11:46:16,885 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 825 transitions. Word has length 119 [2019-12-07 11:46:16,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:16,885 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 825 transitions. [2019-12-07 11:46:16,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:46:16,885 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 825 transitions. [2019-12-07 11:46:16,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-07 11:46:16,888 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:16,888 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:46:16,889 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:46:16,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:16,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1868435191, now seen corresponding path program 1 times [2019-12-07 11:46:16,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:46:16,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846661247] [2019-12-07 11:46:16,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:16,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:46:16,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846661247] [2019-12-07 11:46:16,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:16,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:46:16,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716819915] [2019-12-07 11:46:16,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:46:16,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:46:16,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:46:16,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:46:16,934 INFO L87 Difference]: Start difference. First operand 592 states and 825 transitions. Second operand 3 states. [2019-12-07 11:46:17,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:17,245 INFO L93 Difference]: Finished difference Result 1742 states and 2434 transitions. [2019-12-07 11:46:17,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:46:17,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-12-07 11:46:17,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:17,250 INFO L225 Difference]: With dead ends: 1742 [2019-12-07 11:46:17,250 INFO L226 Difference]: Without dead ends: 1152 [2019-12-07 11:46:17,251 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-12-07 11:46:17,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2019-12-07 11:46:17,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1152. [2019-12-07 11:46:17,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2019-12-07 11:46:17,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1520 transitions. [2019-12-07 11:46:17,270 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1520 transitions. Word has length 125 [2019-12-07 11:46:17,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:17,270 INFO L462 AbstractCegarLoop]: Abstraction has 1152 states and 1520 transitions. [2019-12-07 11:46:17,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:46:17,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1520 transitions. [2019-12-07 11:46:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 11:46:17,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:17,273 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 11:46:17,273 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:46:17,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:17,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1256805806, now seen corresponding path program 1 times [2019-12-07 11:46:17,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:46:17,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626286662] [2019-12-07 11:46:17,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:46:17,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626286662] [2019-12-07 11:46:17,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:17,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:46:17,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405696437] [2019-12-07 11:46:17,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:46:17,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:46:17,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:46:17,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:46:17,321 INFO L87 Difference]: Start difference. First operand 1152 states and 1520 transitions. Second operand 4 states. [2019-12-07 11:46:17,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:17,717 INFO L93 Difference]: Finished difference Result 2306 states and 3045 transitions. [2019-12-07 11:46:17,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:46:17,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-12-07 11:46:17,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:17,721 INFO L225 Difference]: With dead ends: 2306 [2019-12-07 11:46:17,721 INFO L226 Difference]: Without dead ends: 1156 [2019-12-07 11:46:17,722 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-12-07 11:46:17,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2019-12-07 11:46:17,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1151. [2019-12-07 11:46:17,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2019-12-07 11:46:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1466 transitions. [2019-12-07 11:46:17,739 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1466 transitions. Word has length 133 [2019-12-07 11:46:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:17,740 INFO L462 AbstractCegarLoop]: Abstraction has 1151 states and 1466 transitions. [2019-12-07 11:46:17,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:46:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1466 transitions. [2019-12-07 11:46:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-12-07 11:46:17,741 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:17,742 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:46:17,742 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:46:17,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:17,742 INFO L82 PathProgramCache]: Analyzing trace with hash -848335417, now seen corresponding path program 1 times [2019-12-07 11:46:17,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:46:17,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598930804] [2019-12-07 11:46:17,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:17,790 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:46:17,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598930804] [2019-12-07 11:46:17,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:17,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:46:17,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302343190] [2019-12-07 11:46:17,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:46:17,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:46:17,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:46:17,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:46:17,792 INFO L87 Difference]: Start difference. First operand 1151 states and 1466 transitions. Second operand 4 states. [2019-12-07 11:46:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:18,399 INFO L93 Difference]: Finished difference Result 3563 states and 4486 transitions. [2019-12-07 11:46:18,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:46:18,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-12-07 11:46:18,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:18,408 INFO L225 Difference]: With dead ends: 3563 [2019-12-07 11:46:18,408 INFO L226 Difference]: Without dead ends: 2414 [2019-12-07 11:46:18,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:46:18,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-12-07 11:46:18,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2411. [2019-12-07 11:46:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2019-12-07 11:46:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2847 transitions. [2019-12-07 11:46:18,444 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2847 transitions. Word has length 137 [2019-12-07 11:46:18,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:18,444 INFO L462 AbstractCegarLoop]: Abstraction has 2411 states and 2847 transitions. [2019-12-07 11:46:18,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:46:18,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2847 transitions. [2019-12-07 11:46:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-12-07 11:46:18,447 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:18,447 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 11:46:18,447 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:46:18,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:18,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1795097999, now seen corresponding path program 1 times [2019-12-07 11:46:18,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:46:18,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678765703] [2019-12-07 11:46:18,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 11:46:18,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678765703] [2019-12-07 11:46:18,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:18,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:46:18,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016089427] [2019-12-07 11:46:18,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:46:18,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:46:18,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:46:18,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:46:18,519 INFO L87 Difference]: Start difference. First operand 2411 states and 2847 transitions. Second operand 4 states. [2019-12-07 11:46:18,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:18,913 INFO L93 Difference]: Finished difference Result 4820 states and 5692 transitions. [2019-12-07 11:46:18,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:46:18,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-12-07 11:46:18,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:18,924 INFO L225 Difference]: With dead ends: 4820 [2019-12-07 11:46:18,924 INFO L226 Difference]: Without dead ends: 2411 [2019-12-07 11:46:18,927 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-12-07 11:46:18,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2019-12-07 11:46:18,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2131. [2019-12-07 11:46:18,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-12-07 11:46:18,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2410 transitions. [2019-12-07 11:46:18,969 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2410 transitions. Word has length 142 [2019-12-07 11:46:18,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:18,969 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 2410 transitions. [2019-12-07 11:46:18,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:46:18,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2410 transitions. [2019-12-07 11:46:18,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-12-07 11:46:18,973 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:18,974 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:46:18,974 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:46:18,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:18,974 INFO L82 PathProgramCache]: Analyzing trace with hash 487075866, now seen corresponding path program 1 times [2019-12-07 11:46:18,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:46:18,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875936255] [2019-12-07 11:46:18,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 11:46:19,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875936255] [2019-12-07 11:46:19,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:19,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:46:19,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033951326] [2019-12-07 11:46:19,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:46:19,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:46:19,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:46:19,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:46:19,063 INFO L87 Difference]: Start difference. First operand 2131 states and 2410 transitions. Second operand 3 states. [2019-12-07 11:46:19,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:19,362 INFO L93 Difference]: Finished difference Result 4257 states and 4810 transitions. [2019-12-07 11:46:19,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:46:19,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-12-07 11:46:19,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:19,369 INFO L225 Difference]: With dead ends: 4257 [2019-12-07 11:46:19,369 INFO L226 Difference]: Without dead ends: 1848 [2019-12-07 11:46:19,371 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-12-07 11:46:19,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2019-12-07 11:46:19,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1568. [2019-12-07 11:46:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2019-12-07 11:46:19,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 1706 transitions. [2019-12-07 11:46:19,389 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 1706 transitions. Word has length 208 [2019-12-07 11:46:19,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:19,389 INFO L462 AbstractCegarLoop]: Abstraction has 1568 states and 1706 transitions. [2019-12-07 11:46:19,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:46:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 1706 transitions. [2019-12-07 11:46:19,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-12-07 11:46:19,392 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:19,392 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 11:46:19,392 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:46:19,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:19,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1239133772, now seen corresponding path program 1 times [2019-12-07 11:46:19,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:46:19,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676907469] [2019-12-07 11:46:19,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-12-07 11:46:19,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676907469] [2019-12-07 11:46:19,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:19,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:46:19,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540288409] [2019-12-07 11:46:19,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:46:19,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:46:19,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:46:19,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:46:19,433 INFO L87 Difference]: Start difference. First operand 1568 states and 1706 transitions. Second operand 4 states. [2019-12-07 11:46:19,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:19,677 INFO L93 Difference]: Finished difference Result 3263 states and 3549 transitions. [2019-12-07 11:46:19,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:46:19,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-12-07 11:46:19,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:19,681 INFO L225 Difference]: With dead ends: 3263 [2019-12-07 11:46:19,682 INFO L226 Difference]: Without dead ends: 1275 [2019-12-07 11:46:19,683 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-12-07 11:46:19,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-12-07 11:46:19,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1275. [2019-12-07 11:46:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-12-07 11:46:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1362 transitions. [2019-12-07 11:46:19,696 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1362 transitions. Word has length 210 [2019-12-07 11:46:19,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:19,696 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 1362 transitions. [2019-12-07 11:46:19,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:46:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1362 transitions. [2019-12-07 11:46:19,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-12-07 11:46:19,699 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:19,699 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:46:19,699 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:46:19,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:19,699 INFO L82 PathProgramCache]: Analyzing trace with hash -192429443, now seen corresponding path program 1 times [2019-12-07 11:46:19,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:46:19,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672554679] [2019-12-07 11:46:19,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:19,830 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 11:46:19,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672554679] [2019-12-07 11:46:19,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780922100] [2019-12-07 11:46:19,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be7db3d8-5a67-45de-8ba3-1380c59b45d7/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-12-07 11:46:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:19,898 INFO L264 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 11:46:19,907 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:46:19,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:46:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 11:46:19,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:46:19,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2019-12-07 11:46:19,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032503587] [2019-12-07 11:46:19,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:46:19,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:46:19,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:46:19,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:46:19,981 INFO L87 Difference]: Start difference. First operand 1275 states and 1362 transitions. Second operand 5 states. [2019-12-07 11:46:20,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:20,544 INFO L93 Difference]: Finished difference Result 2712 states and 2899 transitions. [2019-12-07 11:46:20,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:46:20,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2019-12-07 11:46:20,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:20,549 INFO L225 Difference]: With dead ends: 2712 [2019-12-07 11:46:20,549 INFO L226 Difference]: Without dead ends: 1439 [2019-12-07 11:46:20,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:46:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2019-12-07 11:46:20,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1275. [2019-12-07 11:46:20,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-12-07 11:46:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1349 transitions. [2019-12-07 11:46:20,568 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1349 transitions. Word has length 222 [2019-12-07 11:46:20,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:20,568 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 1349 transitions. [2019-12-07 11:46:20,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:46:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1349 transitions. [2019-12-07 11:46:20,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-12-07 11:46:20,571 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:20,572 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, 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, 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] [2019-12-07 11:46:20,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:46:20,772 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:46:20,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:20,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1835643882, now seen corresponding path program 1 times [2019-12-07 11:46:20,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:46:20,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75555986] [2019-12-07 11:46:20,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:20,835 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-12-07 11:46:20,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75555986] [2019-12-07 11:46:20,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:46:20,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:46:20,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184938620] [2019-12-07 11:46:20,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:46:20,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:46:20,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:46:20,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:46:20,836 INFO L87 Difference]: Start difference. First operand 1275 states and 1349 transitions. Second operand 3 states. [2019-12-07 11:46:21,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:21,114 INFO L93 Difference]: Finished difference Result 3109 states and 3312 transitions. [2019-12-07 11:46:21,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:46:21,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-12-07 11:46:21,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:21,119 INFO L225 Difference]: With dead ends: 3109 [2019-12-07 11:46:21,120 INFO L226 Difference]: Without dead ends: 1696 [2019-12-07 11:46:21,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:46:21,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2019-12-07 11:46:21,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1556. [2019-12-07 11:46:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1556 states. [2019-12-07 11:46:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1631 transitions. [2019-12-07 11:46:21,141 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1631 transitions. Word has length 250 [2019-12-07 11:46:21,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:21,141 INFO L462 AbstractCegarLoop]: Abstraction has 1556 states and 1631 transitions. [2019-12-07 11:46:21,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:46:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1631 transitions. [2019-12-07 11:46:21,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-12-07 11:46:21,145 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:46:21,145 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 11:46:21,145 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:46:21,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:46:21,145 INFO L82 PathProgramCache]: Analyzing trace with hash -546420939, now seen corresponding path program 1 times [2019-12-07 11:46:21,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:46:21,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597921442] [2019-12-07 11:46:21,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:46:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 177 proven. 9 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 11:46:21,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597921442] [2019-12-07 11:46:21,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494670507] [2019-12-07 11:46:21,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_be7db3d8-5a67-45de-8ba3-1380c59b45d7/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-12-07 11:46:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:46:21,409 INFO L264 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:46:21,414 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:46:21,468 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 11:46:21,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:46:21,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-12-07 11:46:21,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117773659] [2019-12-07 11:46:21,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:46:21,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:46:21,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:46:21,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:46:21,470 INFO L87 Difference]: Start difference. First operand 1556 states and 1631 transitions. Second operand 3 states. [2019-12-07 11:46:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:46:21,768 INFO L93 Difference]: Finished difference Result 3108 states and 3267 transitions. [2019-12-07 11:46:21,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:46:21,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-12-07 11:46:21,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:46:21,769 INFO L225 Difference]: With dead ends: 3108 [2019-12-07 11:46:21,769 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:46:21,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:46:21,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:46:21,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:46:21,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:46:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:46:21,772 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 255 [2019-12-07 11:46:21,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:46:21,772 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:46:21,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:46:21,772 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:46:21,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:46:21,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:46:21,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 11:46:22,296 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-12-07 11:46:22,515 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-12-07 11:46:22,517 INFO L246 CegarLoopResult]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,517 INFO L246 CegarLoopResult]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,517 INFO L246 CegarLoopResult]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,517 INFO L246 CegarLoopResult]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-12-07 11:46:22,517 INFO L246 CegarLoopResult]: For program point L565(line 565) no Hoare annotation was computed. [2019-12-07 11:46:22,517 INFO L246 CegarLoopResult]: For program point L499(line 499) no Hoare annotation was computed. [2019-12-07 11:46:22,517 INFO L246 CegarLoopResult]: For program point L433(line 433) no Hoare annotation was computed. [2019-12-07 11:46:22,518 INFO L246 CegarLoopResult]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-12-07 11:46:22,518 INFO L246 CegarLoopResult]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-12-07 11:46:22,518 INFO L246 CegarLoopResult]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-12-07 11:46:22,518 INFO L246 CegarLoopResult]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,518 INFO L246 CegarLoopResult]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,518 INFO L246 CegarLoopResult]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,518 INFO L246 CegarLoopResult]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-12-07 11:46:22,518 INFO L246 CegarLoopResult]: For program point L568(line 568) no Hoare annotation was computed. [2019-12-07 11:46:22,518 INFO L246 CegarLoopResult]: For program point L502(line 502) no Hoare annotation was computed. [2019-12-07 11:46:22,518 INFO L246 CegarLoopResult]: For program point L436(line 436) no Hoare annotation was computed. [2019-12-07 11:46:22,518 INFO L246 CegarLoopResult]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-12-07 11:46:22,518 INFO L246 CegarLoopResult]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-12-07 11:46:22,518 INFO L246 CegarLoopResult]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-12-07 11:46:22,518 INFO L246 CegarLoopResult]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,518 INFO L246 CegarLoopResult]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,518 INFO L246 CegarLoopResult]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,518 INFO L246 CegarLoopResult]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-12-07 11:46:22,518 INFO L246 CegarLoopResult]: For program point L571(line 571) no Hoare annotation was computed. [2019-12-07 11:46:22,519 INFO L246 CegarLoopResult]: For program point L505(line 505) no Hoare annotation was computed. [2019-12-07 11:46:22,519 INFO L246 CegarLoopResult]: For program point L439(line 439) no Hoare annotation was computed. [2019-12-07 11:46:22,519 INFO L246 CegarLoopResult]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-12-07 11:46:22,519 INFO L246 CegarLoopResult]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,519 INFO L246 CegarLoopResult]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,519 INFO L246 CegarLoopResult]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,519 INFO L246 CegarLoopResult]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-12-07 11:46:22,519 INFO L246 CegarLoopResult]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-12-07 11:46:22,519 INFO L246 CegarLoopResult]: For program point L574(line 574) no Hoare annotation was computed. [2019-12-07 11:46:22,519 INFO L246 CegarLoopResult]: For program point L508(line 508) no Hoare annotation was computed. [2019-12-07 11:46:22,519 INFO L246 CegarLoopResult]: For program point L442(line 442) no Hoare annotation was computed. [2019-12-07 11:46:22,519 INFO L246 CegarLoopResult]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-12-07 11:46:22,519 INFO L246 CegarLoopResult]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-12-07 11:46:22,519 INFO L246 CegarLoopResult]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-12-07 11:46:22,519 INFO L246 CegarLoopResult]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,519 INFO L246 CegarLoopResult]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,519 INFO L246 CegarLoopResult]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,519 INFO L246 CegarLoopResult]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-12-07 11:46:22,519 INFO L246 CegarLoopResult]: For program point L577(line 577) no Hoare annotation was computed. [2019-12-07 11:46:22,519 INFO L246 CegarLoopResult]: For program point L511(line 511) no Hoare annotation was computed. [2019-12-07 11:46:22,520 INFO L246 CegarLoopResult]: For program point L445(line 445) no Hoare annotation was computed. [2019-12-07 11:46:22,520 INFO L246 CegarLoopResult]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-12-07 11:46:22,520 INFO L246 CegarLoopResult]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-12-07 11:46:22,520 INFO L246 CegarLoopResult]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-12-07 11:46:22,520 INFO L246 CegarLoopResult]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-12-07 11:46:22,520 INFO L246 CegarLoopResult]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,520 INFO L246 CegarLoopResult]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,520 INFO L246 CegarLoopResult]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,520 INFO L246 CegarLoopResult]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-12-07 11:46:22,520 INFO L246 CegarLoopResult]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-12-07 11:46:22,520 INFO L246 CegarLoopResult]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-12-07 11:46:22,520 INFO L246 CegarLoopResult]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-12-07 11:46:22,520 INFO L246 CegarLoopResult]: For program point L580(line 580) no Hoare annotation was computed. [2019-12-07 11:46:22,520 INFO L246 CegarLoopResult]: For program point L514(line 514) no Hoare annotation was computed. [2019-12-07 11:46:22,520 INFO L246 CegarLoopResult]: For program point L448(line 448) no Hoare annotation was computed. [2019-12-07 11:46:22,520 INFO L246 CegarLoopResult]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-12-07 11:46:22,520 INFO L246 CegarLoopResult]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-12-07 11:46:22,520 INFO L246 CegarLoopResult]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,520 INFO L246 CegarLoopResult]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,520 INFO L246 CegarLoopResult]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,521 INFO L246 CegarLoopResult]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-12-07 11:46:22,521 INFO L246 CegarLoopResult]: For program point L583(line 583) no Hoare annotation was computed. [2019-12-07 11:46:22,521 INFO L246 CegarLoopResult]: For program point L517(line 517) no Hoare annotation was computed. [2019-12-07 11:46:22,521 INFO L246 CegarLoopResult]: For program point L451(line 451) no Hoare annotation was computed. [2019-12-07 11:46:22,521 INFO L246 CegarLoopResult]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-12-07 11:46:22,521 INFO L246 CegarLoopResult]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-12-07 11:46:22,521 INFO L246 CegarLoopResult]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,521 INFO L246 CegarLoopResult]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,521 INFO L246 CegarLoopResult]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,521 INFO L246 CegarLoopResult]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-12-07 11:46:22,521 INFO L246 CegarLoopResult]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-12-07 11:46:22,521 INFO L246 CegarLoopResult]: For program point L586(line 586) no Hoare annotation was computed. [2019-12-07 11:46:22,521 INFO L246 CegarLoopResult]: For program point L520(line 520) no Hoare annotation was computed. [2019-12-07 11:46:22,521 INFO L246 CegarLoopResult]: For program point L454(line 454) no Hoare annotation was computed. [2019-12-07 11:46:22,521 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 11:46:22,521 INFO L246 CegarLoopResult]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-12-07 11:46:22,521 INFO L246 CegarLoopResult]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-12-07 11:46:22,521 INFO L246 CegarLoopResult]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-12-07 11:46:22,521 INFO L246 CegarLoopResult]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,521 INFO L246 CegarLoopResult]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,522 INFO L246 CegarLoopResult]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,522 INFO L246 CegarLoopResult]: For program point L589(line 589) no Hoare annotation was computed. [2019-12-07 11:46:22,522 INFO L246 CegarLoopResult]: For program point L523(line 523) no Hoare annotation was computed. [2019-12-07 11:46:22,522 INFO L246 CegarLoopResult]: For program point L457(line 457) no Hoare annotation was computed. [2019-12-07 11:46:22,522 INFO L246 CegarLoopResult]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-12-07 11:46:22,522 INFO L246 CegarLoopResult]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-12-07 11:46:22,522 INFO L246 CegarLoopResult]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,522 INFO L246 CegarLoopResult]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,522 INFO L246 CegarLoopResult]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,522 INFO L246 CegarLoopResult]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-12-07 11:46:22,522 INFO L246 CegarLoopResult]: For program point L592(line 592) no Hoare annotation was computed. [2019-12-07 11:46:22,522 INFO L246 CegarLoopResult]: For program point L526(line 526) no Hoare annotation was computed. [2019-12-07 11:46:22,522 INFO L246 CegarLoopResult]: For program point L460(line 460) no Hoare annotation was computed. [2019-12-07 11:46:22,522 INFO L246 CegarLoopResult]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-12-07 11:46:22,522 INFO L246 CegarLoopResult]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-12-07 11:46:22,522 INFO L246 CegarLoopResult]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-12-07 11:46:22,522 INFO L246 CegarLoopResult]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-12-07 11:46:22,522 INFO L246 CegarLoopResult]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-12-07 11:46:22,522 INFO L246 CegarLoopResult]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-12-07 11:46:22,523 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 11:46:22,523 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 517) no Hoare annotation was computed. [2019-12-07 11:46:22,523 INFO L246 CegarLoopResult]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-12-07 11:46:22,523 INFO L246 CegarLoopResult]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,523 INFO L246 CegarLoopResult]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,523 INFO L246 CegarLoopResult]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-12-07 11:46:22,523 INFO L246 CegarLoopResult]: For program point L595(line 595) no Hoare annotation was computed. [2019-12-07 11:46:22,523 INFO L246 CegarLoopResult]: For program point L529(line 529) no Hoare annotation was computed. [2019-12-07 11:46:22,523 INFO L246 CegarLoopResult]: For program point L463(line 463) no Hoare annotation was computed. [2019-12-07 11:46:22,523 INFO L246 CegarLoopResult]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-12-07 11:46:22,523 INFO L246 CegarLoopResult]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-12-07 11:46:22,523 INFO L246 CegarLoopResult]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-12-07 11:46:22,523 INFO L246 CegarLoopResult]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-12-07 11:46:22,523 INFO L246 CegarLoopResult]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-12-07 11:46:22,524 INFO L242 CegarLoopResult]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1))) (let ((.cse9 (not (= ~a28~0 11))) (.cse1 (<= ~a19~0 0)) (.cse11 (<= ~a25~0 0)) (.cse8 (not .cse3))) (let ((.cse4 (or (and .cse1 .cse11 .cse9) (and .cse1 .cse11 .cse8))) (.cse0 (= ~a28~0 9)) (.cse7 (= ~a21~0 1)) (.cse10 (<= 10 ~a28~0)) (.cse5 (= ~a17~0 8)) (.cse12 (= ~a28~0 7)) (.cse6 (= ~a19~0 1)) (.cse2 (= ~a25~0 1)) (.cse13 (<= ~a17~0 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse3) (and (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse5 .cse6 .cse7 .cse2 .cse8) (and .cse5 .cse6 .cse2 .cse9) (and .cse4 .cse5) (and .cse10 .cse5 .cse6 .cse7 .cse11 .cse9) (and .cse1 .cse10 .cse5 .cse2 .cse8 .cse9) (and .cse5 .cse6 .cse12 .cse7 .cse11 .cse8) (and .cse0 .cse6 .cse5 .cse11 .cse3) (and .cse0 .cse5 .cse6 .cse7 .cse11) (and .cse10 .cse6 .cse11 .cse3 .cse13) (and .cse1 .cse5 .cse12 .cse2 .cse8) (and .cse6 .cse2 .cse13 .cse3 .cse9))))) [2019-12-07 11:46:22,524 INFO L246 CegarLoopResult]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,524 INFO L246 CegarLoopResult]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,524 INFO L246 CegarLoopResult]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-12-07 11:46:22,524 INFO L246 CegarLoopResult]: For program point L532(line 532) no Hoare annotation was computed. [2019-12-07 11:46:22,524 INFO L246 CegarLoopResult]: For program point L466(line 466) no Hoare annotation was computed. [2019-12-07 11:46:22,524 INFO L246 CegarLoopResult]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-12-07 11:46:22,524 INFO L246 CegarLoopResult]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-12-07 11:46:22,524 INFO L246 CegarLoopResult]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-12-07 11:46:22,524 INFO L249 CegarLoopResult]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-12-07 11:46:22,524 INFO L246 CegarLoopResult]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,524 INFO L246 CegarLoopResult]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,524 INFO L246 CegarLoopResult]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-12-07 11:46:22,524 INFO L246 CegarLoopResult]: For program point L535(line 535) no Hoare annotation was computed. [2019-12-07 11:46:22,524 INFO L246 CegarLoopResult]: For program point L469(line 469) no Hoare annotation was computed. [2019-12-07 11:46:22,524 INFO L246 CegarLoopResult]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-12-07 11:46:22,524 INFO L246 CegarLoopResult]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-12-07 11:46:22,525 INFO L246 CegarLoopResult]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-12-07 11:46:22,525 INFO L246 CegarLoopResult]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-12-07 11:46:22,525 INFO L246 CegarLoopResult]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-12-07 11:46:22,525 INFO L246 CegarLoopResult]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-12-07 11:46:22,525 INFO L246 CegarLoopResult]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,525 INFO L246 CegarLoopResult]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,525 INFO L246 CegarLoopResult]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-12-07 11:46:22,525 INFO L246 CegarLoopResult]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-12-07 11:46:22,525 INFO L246 CegarLoopResult]: For program point L538(line 538) no Hoare annotation was computed. [2019-12-07 11:46:22,525 INFO L246 CegarLoopResult]: For program point L472(line 472) no Hoare annotation was computed. [2019-12-07 11:46:22,525 INFO L246 CegarLoopResult]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-12-07 11:46:22,525 INFO L246 CegarLoopResult]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-12-07 11:46:22,525 INFO L242 CegarLoopResult]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse3 (= ~a11~0 1))) (let ((.cse9 (not (= ~a28~0 11))) (.cse1 (<= ~a19~0 0)) (.cse11 (<= ~a25~0 0)) (.cse8 (not .cse3))) (let ((.cse4 (or (and .cse1 .cse11 .cse9) (and .cse1 .cse11 .cse8))) (.cse0 (= ~a28~0 9)) (.cse7 (= ~a21~0 1)) (.cse10 (<= 10 ~a28~0)) (.cse5 (= ~a17~0 8)) (.cse12 (= ~a28~0 7)) (.cse6 (= ~a19~0 1)) (.cse2 (= ~a25~0 1)) (.cse13 (<= ~a17~0 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse3) (and (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse5 .cse6 .cse7 .cse2 .cse8) (and .cse5 .cse6 .cse2 .cse9) (and .cse4 .cse5) (and .cse10 .cse5 .cse6 .cse7 .cse11 .cse9) (and .cse1 .cse10 .cse5 .cse2 .cse8 .cse9) (and .cse5 .cse6 .cse12 .cse7 .cse11 .cse8) (and .cse0 .cse6 .cse5 .cse11 .cse3) (and .cse0 .cse5 .cse6 .cse7 .cse11) (and .cse10 .cse6 .cse11 .cse3 .cse13) (and .cse1 .cse5 .cse12 .cse2 .cse8) (and .cse6 .cse2 .cse13 .cse3 .cse9))))) [2019-12-07 11:46:22,525 INFO L246 CegarLoopResult]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,525 INFO L246 CegarLoopResult]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,525 INFO L246 CegarLoopResult]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L541(line 541) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L475(line 475) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L544(line 544) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L478(line 478) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L611(line 611) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L547(line 547) no Hoare annotation was computed. [2019-12-07 11:46:22,526 INFO L246 CegarLoopResult]: For program point L481(line 481) no Hoare annotation was computed. [2019-12-07 11:46:22,527 INFO L246 CegarLoopResult]: For program point L415(line 415) no Hoare annotation was computed. [2019-12-07 11:46:22,527 INFO L246 CegarLoopResult]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-12-07 11:46:22,527 INFO L246 CegarLoopResult]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-12-07 11:46:22,527 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 11:46:22,527 INFO L246 CegarLoopResult]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-12-07 11:46:22,527 INFO L246 CegarLoopResult]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,527 INFO L246 CegarLoopResult]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,527 INFO L246 CegarLoopResult]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,527 INFO L246 CegarLoopResult]: For program point L550(line 550) no Hoare annotation was computed. [2019-12-07 11:46:22,527 INFO L246 CegarLoopResult]: For program point L484(line 484) no Hoare annotation was computed. [2019-12-07 11:46:22,527 INFO L246 CegarLoopResult]: For program point L418(line 418) no Hoare annotation was computed. [2019-12-07 11:46:22,527 INFO L246 CegarLoopResult]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-12-07 11:46:22,527 INFO L246 CegarLoopResult]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-12-07 11:46:22,527 INFO L246 CegarLoopResult]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,527 INFO L246 CegarLoopResult]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,527 INFO L246 CegarLoopResult]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,527 INFO L246 CegarLoopResult]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-12-07 11:46:22,527 INFO L246 CegarLoopResult]: For program point L553(line 553) no Hoare annotation was computed. [2019-12-07 11:46:22,527 INFO L246 CegarLoopResult]: For program point L487(line 487) no Hoare annotation was computed. [2019-12-07 11:46:22,527 INFO L246 CegarLoopResult]: For program point L421(line 421) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point L556(line 556) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point L490(line 490) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point L424(line 424) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point L559(line 559) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point L493(line 493) no Hoare annotation was computed. [2019-12-07 11:46:22,528 INFO L246 CegarLoopResult]: For program point L427(line 427) no Hoare annotation was computed. [2019-12-07 11:46:22,529 INFO L246 CegarLoopResult]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-12-07 11:46:22,529 INFO L246 CegarLoopResult]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,529 INFO L246 CegarLoopResult]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,529 INFO L246 CegarLoopResult]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 11:46:22,529 INFO L246 CegarLoopResult]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-12-07 11:46:22,529 INFO L246 CegarLoopResult]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-12-07 11:46:22,529 INFO L246 CegarLoopResult]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-12-07 11:46:22,529 INFO L246 CegarLoopResult]: For program point L562(line 562) no Hoare annotation was computed. [2019-12-07 11:46:22,529 INFO L246 CegarLoopResult]: For program point L496(line 496) no Hoare annotation was computed. [2019-12-07 11:46:22,529 INFO L246 CegarLoopResult]: For program point L430(line 430) no Hoare annotation was computed. [2019-12-07 11:46:22,529 INFO L246 CegarLoopResult]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-12-07 11:46:22,529 INFO L246 CegarLoopResult]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-12-07 11:46:22,529 INFO L246 CegarLoopResult]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-12-07 11:46:22,529 INFO L246 CegarLoopResult]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-12-07 11:46:22,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:46:22 BoogieIcfgContainer [2019-12-07 11:46:22,549 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:46:22,549 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:46:22,549 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:46:22,549 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:46:22,550 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:46:15" (3/4) ... [2019-12-07 11:46:22,552 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:46:22,567 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 11:46:22,568 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 11:46:22,652 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_be7db3d8-5a67-45de-8ba3-1380c59b45d7/bin/uautomizer/witness.graphml [2019-12-07 11:46:22,652 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:46:22,653 INFO L168 Benchmark]: Toolchain (without parser) took 8519.30 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 418.9 MB). Free memory was 940.7 MB in the beginning and 1.2 GB in the end (delta: -244.4 MB). Peak memory consumption was 174.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:46:22,654 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:46:22,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:46:22,654 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:46:22,654 INFO L168 Benchmark]: Boogie Preprocessor took 39.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:46:22,655 INFO L168 Benchmark]: RCFGBuilder took 639.52 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: 113.3 MB). Peak memory consumption was 113.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:46:22,655 INFO L168 Benchmark]: TraceAbstraction took 7324.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 260.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -209.9 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:46:22,655 INFO L168 Benchmark]: Witness Printer took 103.27 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:46:22,657 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 357.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 639.52 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: 113.3 MB). Peak memory consumption was 113.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7324.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 260.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -209.9 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. * Witness Printer took 103.27 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 517]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((((a28 == 9 && a19 <= 0) && a25 == 1) && a11 == 1) || ((((a19 <= 0 && a25 <= 0) && !(a28 == 11)) || ((a19 <= 0 && a25 <= 0) && !(a11 == 1))) && a11 == 1)) || (((((!(3 == input) && a17 == 8) && a19 == 1) && a21 == 1) && a25 == 1) && !(a11 == 1))) || (((a17 == 8 && a19 == 1) && a25 == 1) && !(a28 == 11))) || ((((a19 <= 0 && a25 <= 0) && !(a28 == 11)) || ((a19 <= 0 && a25 <= 0) && !(a11 == 1))) && a17 == 8)) || (((((10 <= a28 && a17 == 8) && a19 == 1) && a21 == 1) && a25 <= 0) && !(a28 == 11))) || (((((a19 <= 0 && 10 <= a28) && a17 == 8) && a25 == 1) && !(a11 == 1)) && !(a28 == 11))) || (((((a17 == 8 && a19 == 1) && a28 == 7) && a21 == 1) && a25 <= 0) && !(a11 == 1))) || ((((a28 == 9 && a19 == 1) && a17 == 8) && a25 <= 0) && a11 == 1)) || ((((a28 == 9 && a17 == 8) && a19 == 1) && a21 == 1) && a25 <= 0)) || ((((10 <= a28 && a19 == 1) && a25 <= 0) && a11 == 1) && a17 <= 8)) || ((((a19 <= 0 && a17 == 8) && a28 == 7) && a25 == 1) && !(a11 == 1))) || ((((a19 == 1 && a25 == 1) && a17 <= 8) && a11 == 1) && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((((a28 == 9 && a19 <= 0) && a25 == 1) && a11 == 1) || ((((a19 <= 0 && a25 <= 0) && !(a28 == 11)) || ((a19 <= 0 && a25 <= 0) && !(a11 == 1))) && a11 == 1)) || (((((!(3 == input) && a17 == 8) && a19 == 1) && a21 == 1) && a25 == 1) && !(a11 == 1))) || (((a17 == 8 && a19 == 1) && a25 == 1) && !(a28 == 11))) || ((((a19 <= 0 && a25 <= 0) && !(a28 == 11)) || ((a19 <= 0 && a25 <= 0) && !(a11 == 1))) && a17 == 8)) || (((((10 <= a28 && a17 == 8) && a19 == 1) && a21 == 1) && a25 <= 0) && !(a28 == 11))) || (((((a19 <= 0 && 10 <= a28) && a17 == 8) && a25 == 1) && !(a11 == 1)) && !(a28 == 11))) || (((((a17 == 8 && a19 == 1) && a28 == 7) && a21 == 1) && a25 <= 0) && !(a11 == 1))) || ((((a28 == 9 && a19 == 1) && a17 == 8) && a25 <= 0) && a11 == 1)) || ((((a28 == 9 && a17 == 8) && a19 == 1) && a21 == 1) && a25 <= 0)) || ((((10 <= a28 && a19 == 1) && a25 <= 0) && a11 == 1) && a17 <= 8)) || ((((a19 <= 0 && a17 == 8) && a28 == 7) && a25 == 1) && !(a11 == 1))) || ((((a19 == 1 && a25 == 1) && a17 <= 8) && a11 == 1) && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 6.6s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 1298 SDtfs, 2205 SDslu, 262 SDs, 0 SdLazy, 5499 SolverSat, 885 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 488 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2411occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1029 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 493 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1184 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 436 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 2393 NumberOfCodeBlocks, 2393 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2380 ConstructedInterpolants, 0 QuantifiedInterpolants, 1162816 SizeOfPredicates, 6 NumberOfNonLiveVariables, 773 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 1366/1378 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...