./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label12.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/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 23cec877a36776c7adc8d7c2f2f1f13375e9850d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:39:35,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:39:35,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:39:35,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:39:35,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:39:35,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:39:35,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:39:36,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:39:36,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:39:36,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:39:36,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:39:36,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:39:36,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:39:36,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:39:36,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:39:36,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:39:36,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:39:36,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:39:36,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:39:36,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:39:36,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:39:36,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:39:36,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:39:36,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:39:36,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:39:36,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:39:36,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:39:36,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:39:36,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:39:36,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:39:36,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:39:36,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:39:36,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:39:36,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:39:36,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:39:36,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:39:36,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:39:36,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:39:36,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:39:36,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:39:36,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:39:36,047 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 22:39:36,070 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:39:36,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:39:36,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:39:36,072 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:39:36,072 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:39:36,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:39:36,072 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:39:36,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:39:36,073 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:39:36,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:39:36,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:39:36,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:39:36,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:39:36,074 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:39:36,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:39:36,074 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:39:36,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:39:36,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:39:36,074 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:39:36,075 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:39:36,075 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:39:36,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:39:36,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:39:36,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:39:36,076 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:39:36,076 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:39:36,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:39:36,076 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:39:36,076 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_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/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 -> 23cec877a36776c7adc8d7c2f2f1f13375e9850d [2019-11-19 22:39:36,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:39:36,264 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:39:36,268 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:39:36,270 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:39:36,270 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:39:36,271 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label12.c [2019-11-19 22:39:36,329 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/data/60225dd24/2d54a940704247f7b0cc5e222394f13d/FLAGa653d17f5 [2019-11-19 22:39:36,866 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:39:36,867 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/sv-benchmarks/c/eca-rers2012/Problem15_label12.c [2019-11-19 22:39:36,882 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/data/60225dd24/2d54a940704247f7b0cc5e222394f13d/FLAGa653d17f5 [2019-11-19 22:39:37,049 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/data/60225dd24/2d54a940704247f7b0cc5e222394f13d [2019-11-19 22:39:37,052 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:39:37,053 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:39:37,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:39:37,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:39:37,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:39:37,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:39:37" (1/1) ... [2019-11-19 22:39:37,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7d441b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:37, skipping insertion in model container [2019-11-19 22:39:37,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:39:37" (1/1) ... [2019-11-19 22:39:37,067 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:39:37,151 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:39:37,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:39:37,950 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:39:38,464 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:39:38,483 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:39:38,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:38 WrapperNode [2019-11-19 22:39:38,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:39:38,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:39:38,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:39:38,485 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:39:38,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:38" (1/1) ... [2019-11-19 22:39:38,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:38" (1/1) ... [2019-11-19 22:39:38,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:39:38,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:39:38,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:39:38,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:39:38,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:38" (1/1) ... [2019-11-19 22:39:38,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:38" (1/1) ... [2019-11-19 22:39:38,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:38" (1/1) ... [2019-11-19 22:39:38,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:38" (1/1) ... [2019-11-19 22:39:38,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:38" (1/1) ... [2019-11-19 22:39:38,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:38" (1/1) ... [2019-11-19 22:39:38,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:38" (1/1) ... [2019-11-19 22:39:38,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:39:38,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:39:38,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:39:38,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:39:38,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:39:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:39:38,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:39:41,700 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:39:41,700 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-19 22:39:41,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:39:41 BoogieIcfgContainer [2019-11-19 22:39:41,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:39:41,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:39:41,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:39:41,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:39:41,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:39:37" (1/3) ... [2019-11-19 22:39:41,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760f956b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:39:41, skipping insertion in model container [2019-11-19 22:39:41,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:39:38" (2/3) ... [2019-11-19 22:39:41,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@760f956b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:39:41, skipping insertion in model container [2019-11-19 22:39:41,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:39:41" (3/3) ... [2019-11-19 22:39:41,710 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label12.c [2019-11-19 22:39:41,719 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:39:41,725 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 22:39:41,735 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 22:39:41,764 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:39:41,764 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:39:41,764 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:39:41,764 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:39:41,764 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:39:41,765 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:39:41,765 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:39:41,765 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:39:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-19 22:39:41,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 22:39:41,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:39:41,806 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] [2019-11-19 22:39:41,806 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:39:41,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:39:41,811 INFO L82 PathProgramCache]: Analyzing trace with hash 118092897, now seen corresponding path program 1 times [2019-11-19 22:39:41,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:39:41,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235680980] [2019-11-19 22:39:41,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:39:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:39:42,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:39:42,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235680980] [2019-11-19 22:39:42,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:39:42,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:39:42,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124357914] [2019-11-19 22:39:42,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:39:42,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:39:42,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:39:42,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:39:42,168 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-19 22:39:46,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:39:46,170 INFO L93 Difference]: Finished difference Result 1470 states and 2719 transitions. [2019-11-19 22:39:46,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:39:46,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-19 22:39:46,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:39:46,196 INFO L225 Difference]: With dead ends: 1470 [2019-11-19 22:39:46,197 INFO L226 Difference]: Without dead ends: 978 [2019-11-19 22:39:46,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:39:46,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-11-19 22:39:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2019-11-19 22:39:46,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-11-19 22:39:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1472 transitions. [2019-11-19 22:39:46,292 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1472 transitions. Word has length 59 [2019-11-19 22:39:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:39:46,293 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 1472 transitions. [2019-11-19 22:39:46,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:39:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1472 transitions. [2019-11-19 22:39:46,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-19 22:39:46,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:39:46,299 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:39:46,299 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:39:46,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:39:46,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1794665063, now seen corresponding path program 1 times [2019-11-19 22:39:46,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:39:46,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144002730] [2019-11-19 22:39:46,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:39:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:39:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:39:46,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144002730] [2019-11-19 22:39:46,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:39:46,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:39:46,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253532951] [2019-11-19 22:39:46,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:39:46,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:39:46,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:39:46,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:39:46,524 INFO L87 Difference]: Start difference. First operand 976 states and 1472 transitions. Second operand 4 states. [2019-11-19 22:39:50,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:39:50,087 INFO L93 Difference]: Finished difference Result 3752 states and 5684 transitions. [2019-11-19 22:39:50,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:39:50,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-11-19 22:39:50,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:39:50,102 INFO L225 Difference]: With dead ends: 3752 [2019-11-19 22:39:50,103 INFO L226 Difference]: Without dead ends: 2778 [2019-11-19 22:39:50,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:39:50,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2019-11-19 22:39:50,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2776. [2019-11-19 22:39:50,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2776 states. [2019-11-19 22:39:50,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2776 states to 2776 states and 3767 transitions. [2019-11-19 22:39:50,170 INFO L78 Accepts]: Start accepts. Automaton has 2776 states and 3767 transitions. Word has length 124 [2019-11-19 22:39:50,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:39:50,171 INFO L462 AbstractCegarLoop]: Abstraction has 2776 states and 3767 transitions. [2019-11-19 22:39:50,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:39:50,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2776 states and 3767 transitions. [2019-11-19 22:39:50,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-11-19 22:39:50,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:39:50,182 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:39:50,182 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:39:50,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:39:50,182 INFO L82 PathProgramCache]: Analyzing trace with hash 97405590, now seen corresponding path program 1 times [2019-11-19 22:39:50,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:39:50,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925601291] [2019-11-19 22:39:50,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:39:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:39:50,515 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 263 proven. 3 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-19 22:39:50,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925601291] [2019-11-19 22:39:50,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552944129] [2019-11-19 22:39:50,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:39:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:39:50,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:39:50,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:39:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-19 22:39:50,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:39:50,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-19 22:39:50,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198117221] [2019-11-19 22:39:50,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:39:50,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:39:50,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:39:50,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:39:50,892 INFO L87 Difference]: Start difference. First operand 2776 states and 3767 transitions. Second operand 3 states. [2019-11-19 22:39:52,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:39:52,858 INFO L93 Difference]: Finished difference Result 7943 states and 10844 transitions. [2019-11-19 22:39:52,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:39:52,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-11-19 22:39:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:39:52,888 INFO L225 Difference]: With dead ends: 7943 [2019-11-19 22:39:52,888 INFO L226 Difference]: Without dead ends: 5169 [2019-11-19 22:39:52,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:39:52,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5169 states. [2019-11-19 22:39:52,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5169 to 3074. [2019-11-19 22:39:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3074 states. [2019-11-19 22:39:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 4119 transitions. [2019-11-19 22:39:52,983 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 4119 transitions. Word has length 301 [2019-11-19 22:39:52,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:39:52,985 INFO L462 AbstractCegarLoop]: Abstraction has 3074 states and 4119 transitions. [2019-11-19 22:39:52,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:39:52,985 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 4119 transitions. [2019-11-19 22:39:52,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-11-19 22:39:52,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:39:52,991 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:39:53,193 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:39:53,198 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:39:53,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:39:53,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1064012372, now seen corresponding path program 1 times [2019-11-19 22:39:53,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:39:53,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286493037] [2019-11-19 22:39:53,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:39:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:39:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-19 22:39:53,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286493037] [2019-11-19 22:39:53,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:39:53,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:39:53,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804091644] [2019-11-19 22:39:53,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:39:53,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:39:53,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:39:53,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:39:53,805 INFO L87 Difference]: Start difference. First operand 3074 states and 4119 transitions. Second operand 5 states. [2019-11-19 22:39:56,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:39:56,894 INFO L93 Difference]: Finished difference Result 7344 states and 9550 transitions. [2019-11-19 22:39:56,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:39:56,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 331 [2019-11-19 22:39:56,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:39:56,917 INFO L225 Difference]: With dead ends: 7344 [2019-11-19 22:39:56,917 INFO L226 Difference]: Without dead ends: 4272 [2019-11-19 22:39:56,921 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:39:56,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2019-11-19 22:39:56,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 3972. [2019-11-19 22:39:56,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3972 states. [2019-11-19 22:39:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 3972 states and 5083 transitions. [2019-11-19 22:39:56,998 INFO L78 Accepts]: Start accepts. Automaton has 3972 states and 5083 transitions. Word has length 331 [2019-11-19 22:39:56,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:39:56,999 INFO L462 AbstractCegarLoop]: Abstraction has 3972 states and 5083 transitions. [2019-11-19 22:39:56,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:39:56,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 5083 transitions. [2019-11-19 22:39:57,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-11-19 22:39:57,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:39:57,007 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:39:57,008 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:39:57,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:39:57,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1130119938, now seen corresponding path program 1 times [2019-11-19 22:39:57,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:39:57,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353628085] [2019-11-19 22:39:57,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:39:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:39:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 113 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:39:58,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353628085] [2019-11-19 22:39:58,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054033702] [2019-11-19 22:39:58,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:39:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:39:58,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:39:58,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:39:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:39:58,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:39:58,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-11-19 22:39:58,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768306354] [2019-11-19 22:39:58,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:39:58,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:39:58,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:39:58,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:39:58,379 INFO L87 Difference]: Start difference. First operand 3972 states and 5083 transitions. Second operand 3 states. [2019-11-19 22:40:00,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:00,454 INFO L93 Difference]: Finished difference Result 8842 states and 11462 transitions. [2019-11-19 22:40:00,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:00,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 405 [2019-11-19 22:40:00,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:00,478 INFO L225 Difference]: With dead ends: 8842 [2019-11-19 22:40:00,478 INFO L226 Difference]: Without dead ends: 4872 [2019-11-19 22:40:00,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 405 SyntacticMatches, 9 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:40:00,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4872 states. [2019-11-19 22:40:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4872 to 4870. [2019-11-19 22:40:00,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4870 states. [2019-11-19 22:40:00,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4870 states to 4870 states and 6178 transitions. [2019-11-19 22:40:00,577 INFO L78 Accepts]: Start accepts. Automaton has 4870 states and 6178 transitions. Word has length 405 [2019-11-19 22:40:00,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:00,578 INFO L462 AbstractCegarLoop]: Abstraction has 4870 states and 6178 transitions. [2019-11-19 22:40:00,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:00,578 INFO L276 IsEmpty]: Start isEmpty. Operand 4870 states and 6178 transitions. [2019-11-19 22:40:00,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-11-19 22:40:00,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:00,587 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:00,798 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:40:00,799 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:00,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:00,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1682645463, now seen corresponding path program 1 times [2019-11-19 22:40:00,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:00,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970743238] [2019-11-19 22:40:00,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 351 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-19 22:40:01,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970743238] [2019-11-19 22:40:01,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422499391] [2019-11-19 22:40:01,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:40:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:02,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:40:02,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:40:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-19 22:40:02,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:40:02,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-19 22:40:02,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108107119] [2019-11-19 22:40:02,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:02,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:02,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:02,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:40:02,177 INFO L87 Difference]: Start difference. First operand 4870 states and 6178 transitions. Second operand 3 states. [2019-11-19 22:40:03,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:03,756 INFO L93 Difference]: Finished difference Result 10635 states and 13647 transitions. [2019-11-19 22:40:03,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:03,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 422 [2019-11-19 22:40:03,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:03,783 INFO L225 Difference]: With dead ends: 10635 [2019-11-19 22:40:03,783 INFO L226 Difference]: Without dead ends: 5767 [2019-11-19 22:40:03,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 421 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:40:03,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2019-11-19 22:40:03,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5767. [2019-11-19 22:40:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5767 states. [2019-11-19 22:40:03,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 7357 transitions. [2019-11-19 22:40:03,876 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 7357 transitions. Word has length 422 [2019-11-19 22:40:03,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:03,877 INFO L462 AbstractCegarLoop]: Abstraction has 5767 states and 7357 transitions. [2019-11-19 22:40:03,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:03,877 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 7357 transitions. [2019-11-19 22:40:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2019-11-19 22:40:03,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:03,896 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-19 22:40:04,107 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:40:04,107 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:04,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:04,108 INFO L82 PathProgramCache]: Analyzing trace with hash 862817601, now seen corresponding path program 1 times [2019-11-19 22:40:04,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:04,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131312908] [2019-11-19 22:40:04,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:05,418 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 605 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-19 22:40:05,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131312908] [2019-11-19 22:40:05,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893835576] [2019-11-19 22:40:05,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:40:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:05,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:40:05,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:40:05,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:40:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 569 proven. 39 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-19 22:40:06,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:40:06,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-19 22:40:06,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807786353] [2019-11-19 22:40:06,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:40:06,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:06,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:40:06,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:40:06,183 INFO L87 Difference]: Start difference. First operand 5767 states and 7357 transitions. Second operand 9 states. [2019-11-19 22:40:11,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:11,489 INFO L93 Difference]: Finished difference Result 16470 states and 20299 transitions. [2019-11-19 22:40:11,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:40:11,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 586 [2019-11-19 22:40:11,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:11,521 INFO L225 Difference]: With dead ends: 16470 [2019-11-19 22:40:11,521 INFO L226 Difference]: Without dead ends: 7559 [2019-11-19 22:40:11,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 583 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:40:11,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7559 states. [2019-11-19 22:40:11,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7559 to 7260. [2019-11-19 22:40:11,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7260 states. [2019-11-19 22:40:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7260 states to 7260 states and 7970 transitions. [2019-11-19 22:40:11,636 INFO L78 Accepts]: Start accepts. Automaton has 7260 states and 7970 transitions. Word has length 586 [2019-11-19 22:40:11,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:11,636 INFO L462 AbstractCegarLoop]: Abstraction has 7260 states and 7970 transitions. [2019-11-19 22:40:11,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:40:11,637 INFO L276 IsEmpty]: Start isEmpty. Operand 7260 states and 7970 transitions. [2019-11-19 22:40:11,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2019-11-19 22:40:11,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:11,645 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:11,848 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:40:11,848 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:11,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:11,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1867245461, now seen corresponding path program 1 times [2019-11-19 22:40:11,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:11,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535280697] [2019-11-19 22:40:11,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 151 proven. 358 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:40:14,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535280697] [2019-11-19 22:40:14,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624197414] [2019-11-19 22:40:14,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:40:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:14,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:40:14,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:40:14,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:40:14,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:40:14,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:40:14,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:40:14,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:40:14,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:40:14,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:40:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 264 proven. 57 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-19 22:40:14,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:40:14,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 13 [2019-11-19 22:40:14,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533454143] [2019-11-19 22:40:14,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 22:40:14,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:14,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 22:40:14,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:40:14,889 INFO L87 Difference]: Start difference. First operand 7260 states and 7970 transitions. Second operand 13 states. [2019-11-19 22:40:28,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:28,423 INFO L93 Difference]: Finished difference Result 27732 states and 30487 transitions. [2019-11-19 22:40:28,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-19 22:40:28,428 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 594 [2019-11-19 22:40:28,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:28,462 INFO L225 Difference]: With dead ends: 27732 [2019-11-19 22:40:28,462 INFO L226 Difference]: Without dead ends: 20175 [2019-11-19 22:40:28,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 611 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=245, Invalid=945, Unknown=0, NotChecked=0, Total=1190 [2019-11-19 22:40:28,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20175 states. [2019-11-19 22:40:28,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20175 to 15650. [2019-11-19 22:40:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15650 states. [2019-11-19 22:40:28,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15650 states to 15650 states and 16759 transitions. [2019-11-19 22:40:28,675 INFO L78 Accepts]: Start accepts. Automaton has 15650 states and 16759 transitions. Word has length 594 [2019-11-19 22:40:28,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:28,676 INFO L462 AbstractCegarLoop]: Abstraction has 15650 states and 16759 transitions. [2019-11-19 22:40:28,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 22:40:28,676 INFO L276 IsEmpty]: Start isEmpty. Operand 15650 states and 16759 transitions. [2019-11-19 22:40:28,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2019-11-19 22:40:28,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:28,691 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:28,899 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:40:28,899 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:28,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:28,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1667893228, now seen corresponding path program 1 times [2019-11-19 22:40:28,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:28,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664316284] [2019-11-19 22:40:28,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-11-19 22:40:29,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664316284] [2019-11-19 22:40:29,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:29,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:40:29,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941350790] [2019-11-19 22:40:29,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:40:29,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:29,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:40:29,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:29,398 INFO L87 Difference]: Start difference. First operand 15650 states and 16759 transitions. Second operand 3 states. [2019-11-19 22:40:30,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:30,383 INFO L93 Difference]: Finished difference Result 28899 states and 31071 transitions. [2019-11-19 22:40:30,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:40:30,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 695 [2019-11-19 22:40:30,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:30,411 INFO L225 Difference]: With dead ends: 28899 [2019-11-19 22:40:30,411 INFO L226 Difference]: Without dead ends: 15946 [2019-11-19 22:40:30,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:40:30,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15946 states. [2019-11-19 22:40:30,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15946 to 15646. [2019-11-19 22:40:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15646 states. [2019-11-19 22:40:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15646 states to 15646 states and 16752 transitions. [2019-11-19 22:40:30,599 INFO L78 Accepts]: Start accepts. Automaton has 15646 states and 16752 transitions. Word has length 695 [2019-11-19 22:40:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:30,600 INFO L462 AbstractCegarLoop]: Abstraction has 15646 states and 16752 transitions. [2019-11-19 22:40:30,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:40:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand 15646 states and 16752 transitions. [2019-11-19 22:40:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2019-11-19 22:40:30,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:30,613 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:30,613 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:30,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:30,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1883826705, now seen corresponding path program 1 times [2019-11-19 22:40:30,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:30,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567267165] [2019-11-19 22:40:30,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 255 proven. 456 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-19 22:40:32,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567267165] [2019-11-19 22:40:32,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615653566] [2019-11-19 22:40:32,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:40:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:32,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:40:32,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:40:32,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:40:32,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:40:32,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:40:32,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:40:32,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:40:32,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:40:32,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:40:32,891 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 451 proven. 190 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-19 22:40:32,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:40:32,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 15 [2019-11-19 22:40:32,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111871602] [2019-11-19 22:40:32,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-19 22:40:32,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:32,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-19 22:40:32,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:40:32,894 INFO L87 Difference]: Start difference. First operand 15646 states and 16752 transitions. Second operand 15 states. [2019-11-19 22:40:55,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:55,954 INFO L93 Difference]: Finished difference Result 38937 states and 42003 transitions. [2019-11-19 22:40:55,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-19 22:40:55,955 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 700 [2019-11-19 22:40:55,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:55,982 INFO L225 Difference]: With dead ends: 38937 [2019-11-19 22:40:55,982 INFO L226 Difference]: Without dead ends: 23592 [2019-11-19 22:40:55,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 796 GetRequests, 736 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=575, Invalid=2395, Unknown=0, NotChecked=0, Total=2970 [2019-11-19 22:40:56,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23592 states. [2019-11-19 22:40:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23592 to 16809. [2019-11-19 22:40:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16809 states. [2019-11-19 22:40:56,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16809 states to 16809 states and 17407 transitions. [2019-11-19 22:40:56,219 INFO L78 Accepts]: Start accepts. Automaton has 16809 states and 17407 transitions. Word has length 700 [2019-11-19 22:40:56,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:56,219 INFO L462 AbstractCegarLoop]: Abstraction has 16809 states and 17407 transitions. [2019-11-19 22:40:56,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-19 22:40:56,220 INFO L276 IsEmpty]: Start isEmpty. Operand 16809 states and 17407 transitions. [2019-11-19 22:40:56,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2019-11-19 22:40:56,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:56,233 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-11-19 22:40:56,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:40:56,437 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:56,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:56,437 INFO L82 PathProgramCache]: Analyzing trace with hash -516004015, now seen corresponding path program 1 times [2019-11-19 22:40:56,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:56,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541988535] [2019-11-19 22:40:56,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:40:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-11-19 22:40:57,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541988535] [2019-11-19 22:40:57,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:40:57,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:40:57,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44830927] [2019-11-19 22:40:57,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:40:57,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:40:57,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:40:57,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:40:57,317 INFO L87 Difference]: Start difference. First operand 16809 states and 17407 transitions. Second operand 5 states. [2019-11-19 22:40:59,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:40:59,081 INFO L93 Difference]: Finished difference Result 23112 states and 23909 transitions. [2019-11-19 22:40:59,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:40:59,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 762 [2019-11-19 22:40:59,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:40:59,109 INFO L225 Difference]: With dead ends: 23112 [2019-11-19 22:40:59,110 INFO L226 Difference]: Without dead ends: 23110 [2019-11-19 22:40:59,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:40:59,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23110 states. [2019-11-19 22:40:59,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23110 to 19511. [2019-11-19 22:40:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19511 states. [2019-11-19 22:40:59,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19511 states to 19511 states and 20213 transitions. [2019-11-19 22:40:59,346 INFO L78 Accepts]: Start accepts. Automaton has 19511 states and 20213 transitions. Word has length 762 [2019-11-19 22:40:59,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:40:59,347 INFO L462 AbstractCegarLoop]: Abstraction has 19511 states and 20213 transitions. [2019-11-19 22:40:59,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:40:59,347 INFO L276 IsEmpty]: Start isEmpty. Operand 19511 states and 20213 transitions. [2019-11-19 22:40:59,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 804 [2019-11-19 22:40:59,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:40:59,363 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:40:59,364 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:40:59,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:40:59,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1187580303, now seen corresponding path program 1 times [2019-11-19 22:40:59,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:40:59,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57380915] [2019-11-19 22:40:59,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:40:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:41:00,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 507 proven. 311 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-11-19 22:41:00,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57380915] [2019-11-19 22:41:00,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427710484] [2019-11-19 22:41:00,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:41:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:41:00,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 22:41:00,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:41:01,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:01,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:01,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:41:01,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:41:01,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:41:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 629 proven. 57 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-11-19 22:41:02,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:41:02,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-11-19 22:41:02,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789149506] [2019-11-19 22:41:02,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 22:41:02,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:41:02,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 22:41:02,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:41:02,151 INFO L87 Difference]: Start difference. First operand 19511 states and 20213 transitions. Second operand 13 states. [2019-11-19 22:41:10,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:41:10,637 INFO L93 Difference]: Finished difference Result 43698 states and 45411 transitions. [2019-11-19 22:41:10,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-19 22:41:10,637 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 803 [2019-11-19 22:41:10,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:41:10,654 INFO L225 Difference]: With dead ends: 43698 [2019-11-19 22:41:10,654 INFO L226 Difference]: Without dead ends: 23890 [2019-11-19 22:41:10,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 847 GetRequests, 816 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2019-11-19 22:41:10,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23890 states. [2019-11-19 22:41:10,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23890 to 20393. [2019-11-19 22:41:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20393 states. [2019-11-19 22:41:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20393 states to 20393 states and 20930 transitions. [2019-11-19 22:41:10,872 INFO L78 Accepts]: Start accepts. Automaton has 20393 states and 20930 transitions. Word has length 803 [2019-11-19 22:41:10,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:41:10,873 INFO L462 AbstractCegarLoop]: Abstraction has 20393 states and 20930 transitions. [2019-11-19 22:41:10,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 22:41:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 20393 states and 20930 transitions. [2019-11-19 22:41:10,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2019-11-19 22:41:10,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:41:10,883 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:41:11,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:41:11,087 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:41:11,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:41:11,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1577381507, now seen corresponding path program 1 times [2019-11-19 22:41:11,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:41:11,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546512651] [2019-11-19 22:41:11,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:41:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:41:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2019-11-19 22:41:12,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546512651] [2019-11-19 22:41:12,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:41:12,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:41:12,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737212420] [2019-11-19 22:41:12,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:41:12,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:41:12,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:41:12,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:41:12,150 INFO L87 Difference]: Start difference. First operand 20393 states and 20930 transitions. Second operand 5 states. [2019-11-19 22:41:14,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:41:14,160 INFO L93 Difference]: Finished difference Result 42003 states and 43174 transitions. [2019-11-19 22:41:14,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:41:14,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 809 [2019-11-19 22:41:14,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:41:14,176 INFO L225 Difference]: With dead ends: 42003 [2019-11-19 22:41:14,176 INFO L226 Difference]: Without dead ends: 24307 [2019-11-19 22:41:14,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:41:14,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24307 states. [2019-11-19 22:41:14,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24307 to 21590. [2019-11-19 22:41:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21590 states. [2019-11-19 22:41:14,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21590 states to 21590 states and 22148 transitions. [2019-11-19 22:41:14,367 INFO L78 Accepts]: Start accepts. Automaton has 21590 states and 22148 transitions. Word has length 809 [2019-11-19 22:41:14,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:41:14,368 INFO L462 AbstractCegarLoop]: Abstraction has 21590 states and 22148 transitions. [2019-11-19 22:41:14,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:41:14,368 INFO L276 IsEmpty]: Start isEmpty. Operand 21590 states and 22148 transitions. [2019-11-19 22:41:14,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1138 [2019-11-19 22:41:14,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:41:14,391 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:41:14,391 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:41:14,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:41:14,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1697872981, now seen corresponding path program 1 times [2019-11-19 22:41:14,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:41:14,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171635717] [2019-11-19 22:41:14,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:41:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:41:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2454 backedges. 114 proven. 1161 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-11-19 22:41:17,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171635717] [2019-11-19 22:41:17,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200248911] [2019-11-19 22:41:17,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:41:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:41:17,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 1307 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:41:17,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:41:17,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:17,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:17,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:17,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:17,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:17,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:17,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:17,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:17,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:17,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2454 backedges. 740 proven. 619 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2019-11-19 22:41:19,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:41:19,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-19 22:41:19,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790887840] [2019-11-19 22:41:19,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:41:19,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:41:19,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:41:19,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:41:19,508 INFO L87 Difference]: Start difference. First operand 21590 states and 22148 transitions. Second operand 8 states. [2019-11-19 22:41:22,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:41:22,230 INFO L93 Difference]: Finished difference Result 52180 states and 53530 transitions. [2019-11-19 22:41:22,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:41:22,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1137 [2019-11-19 22:41:22,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:41:22,254 INFO L225 Difference]: With dead ends: 52180 [2019-11-19 22:41:22,254 INFO L226 Difference]: Without dead ends: 33586 [2019-11-19 22:41:22,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1142 GetRequests, 1133 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:41:22,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33586 states. [2019-11-19 22:41:22,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33586 to 22486. [2019-11-19 22:41:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22486 states. [2019-11-19 22:41:22,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22486 states to 22486 states and 23013 transitions. [2019-11-19 22:41:22,499 INFO L78 Accepts]: Start accepts. Automaton has 22486 states and 23013 transitions. Word has length 1137 [2019-11-19 22:41:22,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:41:22,500 INFO L462 AbstractCegarLoop]: Abstraction has 22486 states and 23013 transitions. [2019-11-19 22:41:22,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:41:22,501 INFO L276 IsEmpty]: Start isEmpty. Operand 22486 states and 23013 transitions. [2019-11-19 22:41:22,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1216 [2019-11-19 22:41:22,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:41:22,521 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 22:41:22,721 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:41:22,721 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:41:22,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:41:22,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1387578807, now seen corresponding path program 1 times [2019-11-19 22:41:22,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:41:22,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575890095] [2019-11-19 22:41:22,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:41:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:41:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2461 backedges. 1889 proven. 187 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-11-19 22:41:24,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575890095] [2019-11-19 22:41:24,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218120385] [2019-11-19 22:41:24,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:41:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:41:24,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:41:24,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:41:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2461 backedges. 1723 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2019-11-19 22:41:25,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:41:25,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-19 22:41:25,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068256437] [2019-11-19 22:41:25,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:41:25,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:41:25,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:41:25,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:41:25,370 INFO L87 Difference]: Start difference. First operand 22486 states and 23013 transitions. Second operand 3 states. [2019-11-19 22:41:26,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:41:26,214 INFO L93 Difference]: Finished difference Result 41982 states and 43003 transitions. [2019-11-19 22:41:26,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:41:26,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1215 [2019-11-19 22:41:26,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:41:26,236 INFO L225 Difference]: With dead ends: 41982 [2019-11-19 22:41:26,236 INFO L226 Difference]: Without dead ends: 24588 [2019-11-19 22:41:26,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1221 GetRequests, 1216 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:41:26,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24588 states. [2019-11-19 22:41:26,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24588 to 23985. [2019-11-19 22:41:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23985 states. [2019-11-19 22:41:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23985 states to 23985 states and 24533 transitions. [2019-11-19 22:41:26,417 INFO L78 Accepts]: Start accepts. Automaton has 23985 states and 24533 transitions. Word has length 1215 [2019-11-19 22:41:26,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:41:26,418 INFO L462 AbstractCegarLoop]: Abstraction has 23985 states and 24533 transitions. [2019-11-19 22:41:26,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:41:26,418 INFO L276 IsEmpty]: Start isEmpty. Operand 23985 states and 24533 transitions. [2019-11-19 22:41:26,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1218 [2019-11-19 22:41:26,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:41:26,435 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:41:26,638 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:41:26,638 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:41:26,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:41:26,639 INFO L82 PathProgramCache]: Analyzing trace with hash 741181811, now seen corresponding path program 1 times [2019-11-19 22:41:26,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:41:26,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180002554] [2019-11-19 22:41:26,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:41:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:41:28,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2903 backedges. 1243 proven. 0 refuted. 0 times theorem prover too weak. 1660 trivial. 0 not checked. [2019-11-19 22:41:28,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180002554] [2019-11-19 22:41:28,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:41:28,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:41:28,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645661075] [2019-11-19 22:41:28,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:41:28,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:41:28,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:41:28,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:41:28,227 INFO L87 Difference]: Start difference. First operand 23985 states and 24533 transitions. Second operand 5 states. [2019-11-19 22:41:30,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:41:30,268 INFO L93 Difference]: Finished difference Result 49782 states and 50942 transitions. [2019-11-19 22:41:30,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:41:30,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1217 [2019-11-19 22:41:30,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:41:30,288 INFO L225 Difference]: With dead ends: 49782 [2019-11-19 22:41:30,288 INFO L226 Difference]: Without dead ends: 28195 [2019-11-19 22:41:30,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:41:30,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28195 states. [2019-11-19 22:41:30,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28195 to 24286. [2019-11-19 22:41:30,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24286 states. [2019-11-19 22:41:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24286 states to 24286 states and 24850 transitions. [2019-11-19 22:41:30,503 INFO L78 Accepts]: Start accepts. Automaton has 24286 states and 24850 transitions. Word has length 1217 [2019-11-19 22:41:30,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:41:30,504 INFO L462 AbstractCegarLoop]: Abstraction has 24286 states and 24850 transitions. [2019-11-19 22:41:30,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:41:30,504 INFO L276 IsEmpty]: Start isEmpty. Operand 24286 states and 24850 transitions. [2019-11-19 22:41:30,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1406 [2019-11-19 22:41:30,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:41:30,534 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2019-11-19 22:41:30,534 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:41:30,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:41:30,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1039295211, now seen corresponding path program 1 times [2019-11-19 22:41:30,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:41:30,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701684142] [2019-11-19 22:41:30,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:41:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:41:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 2841 proven. 104 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2019-11-19 22:41:32,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701684142] [2019-11-19 22:41:32,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805634786] [2019-11-19 22:41:32,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:41:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:41:32,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 1603 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:41:32,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:41:33,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 2688 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-11-19 22:41:33,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:41:33,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-19 22:41:33,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323865372] [2019-11-19 22:41:33,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:41:33,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:41:33,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:41:33,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:41:33,986 INFO L87 Difference]: Start difference. First operand 24286 states and 24850 transitions. Second operand 3 states. [2019-11-19 22:41:34,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:41:34,812 INFO L93 Difference]: Finished difference Result 47972 states and 49097 transitions. [2019-11-19 22:41:34,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:41:34,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1405 [2019-11-19 22:41:34,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:41:34,832 INFO L225 Difference]: With dead ends: 47972 [2019-11-19 22:41:34,832 INFO L226 Difference]: Without dead ends: 23987 [2019-11-19 22:41:34,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1412 GetRequests, 1405 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:41:34,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23987 states. [2019-11-19 22:41:35,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23987 to 22786. [2019-11-19 22:41:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22786 states. [2019-11-19 22:41:35,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22786 states to 22786 states and 23191 transitions. [2019-11-19 22:41:35,025 INFO L78 Accepts]: Start accepts. Automaton has 22786 states and 23191 transitions. Word has length 1405 [2019-11-19 22:41:35,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:41:35,026 INFO L462 AbstractCegarLoop]: Abstraction has 22786 states and 23191 transitions. [2019-11-19 22:41:35,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:41:35,026 INFO L276 IsEmpty]: Start isEmpty. Operand 22786 states and 23191 transitions. [2019-11-19 22:41:35,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2019-11-19 22:41:35,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:41:35,059 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:41:35,263 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:41:35,263 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:41:35,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:41:35,264 INFO L82 PathProgramCache]: Analyzing trace with hash -424946053, now seen corresponding path program 1 times [2019-11-19 22:41:35,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:41:35,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848674654] [2019-11-19 22:41:35,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:41:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:41:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5606 backedges. 1619 proven. 0 refuted. 0 times theorem prover too weak. 3987 trivial. 0 not checked. [2019-11-19 22:41:37,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848674654] [2019-11-19 22:41:37,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:41:37,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:41:37,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258000157] [2019-11-19 22:41:37,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:41:37,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:41:37,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:41:37,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:41:37,174 INFO L87 Difference]: Start difference. First operand 22786 states and 23191 transitions. Second operand 3 states. [2019-11-19 22:41:38,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:41:38,078 INFO L93 Difference]: Finished difference Result 47072 states and 47905 transitions. [2019-11-19 22:41:38,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:41:38,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1621 [2019-11-19 22:41:38,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:41:38,102 INFO L225 Difference]: With dead ends: 47072 [2019-11-19 22:41:38,102 INFO L226 Difference]: Without dead ends: 24587 [2019-11-19 22:41:38,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:41:38,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24587 states. [2019-11-19 22:41:38,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24587 to 19792. [2019-11-19 22:41:38,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19792 states. [2019-11-19 22:41:38,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19792 states to 19792 states and 20136 transitions. [2019-11-19 22:41:38,294 INFO L78 Accepts]: Start accepts. Automaton has 19792 states and 20136 transitions. Word has length 1621 [2019-11-19 22:41:38,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:41:38,295 INFO L462 AbstractCegarLoop]: Abstraction has 19792 states and 20136 transitions. [2019-11-19 22:41:38,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:41:38,295 INFO L276 IsEmpty]: Start isEmpty. Operand 19792 states and 20136 transitions. [2019-11-19 22:41:38,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1706 [2019-11-19 22:41:38,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:41:38,319 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:41:38,319 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:41:38,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:41:38,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1975256122, now seen corresponding path program 1 times [2019-11-19 22:41:38,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:41:38,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4632660] [2019-11-19 22:41:38,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:41:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:41:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6410 backedges. 4062 proven. 269 refuted. 0 times theorem prover too weak. 2079 trivial. 0 not checked. [2019-11-19 22:41:40,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4632660] [2019-11-19 22:41:40,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862536655] [2019-11-19 22:41:40,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:41:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:41:41,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 1967 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:41:41,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:41:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6410 backedges. 4066 proven. 0 refuted. 0 times theorem prover too weak. 2344 trivial. 0 not checked. [2019-11-19 22:41:42,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:41:42,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-19 22:41:42,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073925308] [2019-11-19 22:41:42,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:41:42,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:41:42,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:41:42,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:41:42,654 INFO L87 Difference]: Start difference. First operand 19792 states and 20136 transitions. Second operand 3 states. [2019-11-19 22:41:43,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:41:43,478 INFO L93 Difference]: Finished difference Result 35986 states and 36613 transitions. [2019-11-19 22:41:43,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:41:43,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1705 [2019-11-19 22:41:43,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:41:43,492 INFO L225 Difference]: With dead ends: 35986 [2019-11-19 22:41:43,493 INFO L226 Difference]: Without dead ends: 19485 [2019-11-19 22:41:43,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1716 GetRequests, 1709 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:41:43,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19485 states. [2019-11-19 22:41:43,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19485 to 18289. [2019-11-19 22:41:43,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18289 states. [2019-11-19 22:41:43,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18289 states to 18289 states and 18550 transitions. [2019-11-19 22:41:43,647 INFO L78 Accepts]: Start accepts. Automaton has 18289 states and 18550 transitions. Word has length 1705 [2019-11-19 22:41:43,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:41:43,648 INFO L462 AbstractCegarLoop]: Abstraction has 18289 states and 18550 transitions. [2019-11-19 22:41:43,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:41:43,649 INFO L276 IsEmpty]: Start isEmpty. Operand 18289 states and 18550 transitions. [2019-11-19 22:41:43,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1743 [2019-11-19 22:41:43,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:41:43,672 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:41:43,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:41:43,872 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:41:43,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:41:43,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1751744778, now seen corresponding path program 1 times [2019-11-19 22:41:43,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:41:43,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289702177] [2019-11-19 22:41:43,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:41:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:41:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6951 backedges. 4503 proven. 0 refuted. 0 times theorem prover too weak. 2448 trivial. 0 not checked. [2019-11-19 22:41:46,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289702177] [2019-11-19 22:41:46,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:41:46,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:41:46,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501488744] [2019-11-19 22:41:46,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:41:46,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:41:46,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:41:46,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:41:46,779 INFO L87 Difference]: Start difference. First operand 18289 states and 18550 transitions. Second operand 5 states. [2019-11-19 22:41:48,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:41:48,175 INFO L93 Difference]: Finished difference Result 36296 states and 36818 transitions. [2019-11-19 22:41:48,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 22:41:48,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1742 [2019-11-19 22:41:48,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:41:48,189 INFO L225 Difference]: With dead ends: 36296 [2019-11-19 22:41:48,189 INFO L226 Difference]: Without dead ends: 18607 [2019-11-19 22:41:48,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:41:48,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18607 states. [2019-11-19 22:41:48,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18607 to 16192. [2019-11-19 22:41:48,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16192 states. [2019-11-19 22:41:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16192 states to 16192 states and 16401 transitions. [2019-11-19 22:41:48,338 INFO L78 Accepts]: Start accepts. Automaton has 16192 states and 16401 transitions. Word has length 1742 [2019-11-19 22:41:48,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:41:48,339 INFO L462 AbstractCegarLoop]: Abstraction has 16192 states and 16401 transitions. [2019-11-19 22:41:48,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:41:48,339 INFO L276 IsEmpty]: Start isEmpty. Operand 16192 states and 16401 transitions. [2019-11-19 22:41:48,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1800 [2019-11-19 22:41:48,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:41:48,363 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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, 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] [2019-11-19 22:41:48,363 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:41:48,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:41:48,363 INFO L82 PathProgramCache]: Analyzing trace with hash -429079952, now seen corresponding path program 1 times [2019-11-19 22:41:48,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:41:48,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179712145] [2019-11-19 22:41:48,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:41:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:41:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6264 backedges. 4081 proven. 0 refuted. 0 times theorem prover too weak. 2183 trivial. 0 not checked. [2019-11-19 22:41:50,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179712145] [2019-11-19 22:41:50,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:41:50,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:41:50,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173928233] [2019-11-19 22:41:50,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:41:50,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:41:50,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:41:50,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:41:50,846 INFO L87 Difference]: Start difference. First operand 16192 states and 16401 transitions. Second operand 3 states. [2019-11-19 22:41:51,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:41:51,711 INFO L93 Difference]: Finished difference Result 31190 states and 31589 transitions. [2019-11-19 22:41:51,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:41:51,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1799 [2019-11-19 22:41:51,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:41:51,725 INFO L225 Difference]: With dead ends: 31190 [2019-11-19 22:41:51,726 INFO L226 Difference]: Without dead ends: 17691 [2019-11-19 22:41:51,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:41:51,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17691 states. [2019-11-19 22:41:51,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17691 to 15292. [2019-11-19 22:41:51,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15292 states. [2019-11-19 22:41:51,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15292 states to 15292 states and 15485 transitions. [2019-11-19 22:41:51,863 INFO L78 Accepts]: Start accepts. Automaton has 15292 states and 15485 transitions. Word has length 1799 [2019-11-19 22:41:51,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:41:51,864 INFO L462 AbstractCegarLoop]: Abstraction has 15292 states and 15485 transitions. [2019-11-19 22:41:51,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:41:51,864 INFO L276 IsEmpty]: Start isEmpty. Operand 15292 states and 15485 transitions. [2019-11-19 22:41:51,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1896 [2019-11-19 22:41:51,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:41:51,888 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:41:51,888 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:41:51,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:41:51,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1762588739, now seen corresponding path program 1 times [2019-11-19 22:41:51,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:41:51,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705287802] [2019-11-19 22:41:51,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:41:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:41:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6537 backedges. 114 proven. 5084 refuted. 0 times theorem prover too weak. 1339 trivial. 0 not checked. [2019-11-19 22:41:58,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705287802] [2019-11-19 22:41:58,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793794330] [2019-11-19 22:41:58,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:41:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:41:59,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 2139 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:41:59,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:41:59,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:59,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:59,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:59,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:59,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:59,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:59,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:59,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:59,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:41:59,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:42:00,567 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-11-19 22:42:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6537 backedges. 4045 proven. 480 refuted. 0 times theorem prover too weak. 2012 trivial. 0 not checked. [2019-11-19 22:42:06,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:42:06,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2019-11-19 22:42:06,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070203217] [2019-11-19 22:42:06,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 22:42:06,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:42:06,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 22:42:06,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:42:06,078 INFO L87 Difference]: Start difference. First operand 15292 states and 15485 transitions. Second operand 12 states. [2019-11-19 22:42:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:42:13,520 INFO L93 Difference]: Finished difference Result 44373 states and 44916 transitions. [2019-11-19 22:42:13,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 22:42:13,522 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1895 [2019-11-19 22:42:13,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:42:13,524 INFO L225 Difference]: With dead ends: 44373 [2019-11-19 22:42:13,524 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 22:42:13,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1911 GetRequests, 1896 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:42:13,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 22:42:13,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 22:42:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 22:42:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 22:42:13,534 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1895 [2019-11-19 22:42:13,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:42:13,535 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:42:13,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 22:42:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:42:13,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 22:42:13,735 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:42:13,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 22:42:15,573 WARN L191 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 976 DAG size of output: 734 [2019-11-19 22:42:17,044 WARN L191 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 976 DAG size of output: 734 [2019-11-19 22:42:17,819 WARN L191 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 723 DAG size of output: 577 [2019-11-19 22:42:25,002 WARN L191 SmtUtils]: Spent 7.18 s on a formula simplification. DAG size of input: 671 DAG size of output: 206 [2019-11-19 22:42:31,783 WARN L191 SmtUtils]: Spent 6.78 s on a formula simplification. DAG size of input: 671 DAG size of output: 206 [2019-11-19 22:42:36,549 WARN L191 SmtUtils]: Spent 4.76 s on a formula simplification. DAG size of input: 545 DAG size of output: 203 [2019-11-19 22:42:36,552 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,552 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,553 INFO L444 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,553 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,553 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-19 22:42:36,553 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,553 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,553 INFO L444 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,553 INFO L444 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,553 INFO L444 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,553 INFO L444 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,553 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-19 22:42:36,553 INFO L444 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,553 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,553 INFO L444 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,553 INFO L444 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-19 22:42:36,553 INFO L444 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,554 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,554 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-19 22:42:36,554 INFO L444 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,554 INFO L444 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,554 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,554 INFO L444 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,554 INFO L444 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,554 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,554 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-19 22:42:36,554 INFO L444 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,554 INFO L444 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,554 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,554 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,554 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-19 22:42:36,554 INFO L444 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-19 22:42:36,554 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,555 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,555 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,555 INFO L444 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,555 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-19 22:42:36,555 INFO L444 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-19 22:42:36,555 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,555 INFO L444 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,555 INFO L444 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,555 INFO L444 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,555 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,555 INFO L444 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-19 22:42:36,555 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,555 INFO L444 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-19 22:42:36,555 INFO L444 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-19 22:42:36,556 INFO L444 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-19 22:42:36,556 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-19 22:42:36,556 INFO L444 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,556 INFO L444 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,556 INFO L444 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,556 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,556 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,556 INFO L444 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-19 22:42:36,556 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,556 INFO L444 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,556 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-19 22:42:36,556 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,556 INFO L444 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-19 22:42:36,556 INFO L444 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,556 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,556 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,556 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-19 22:42:36,556 INFO L444 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,556 INFO L444 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-19 22:42:36,557 INFO L444 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-19 22:42:36,557 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-19 22:42:36,557 INFO L444 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-19 22:42:36,557 INFO L444 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-19 22:42:36,557 INFO L444 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-19 22:42:36,557 INFO L444 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,557 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,557 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,557 INFO L444 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,557 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-19 22:42:36,557 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-19 22:42:36,557 INFO L444 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,557 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-19 22:42:36,557 INFO L444 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,557 INFO L444 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,557 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,557 INFO L444 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,558 INFO L444 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,558 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,558 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-19 22:42:36,558 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 22:42:36,558 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-11-19 22:42:36,558 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,558 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,558 INFO L444 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,558 INFO L444 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,559 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,559 INFO L444 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-19 22:42:36,559 INFO L444 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-19 22:42:36,559 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,559 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-19 22:42:36,559 INFO L444 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-19 22:42:36,559 INFO L444 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-19 22:42:36,560 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,560 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-19 22:42:36,560 INFO L444 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-19 22:42:36,560 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,560 INFO L444 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,560 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,560 INFO L444 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,560 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-19 22:42:36,561 INFO L444 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-19 22:42:36,561 INFO L444 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,561 INFO L444 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,561 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,561 INFO L444 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-19 22:42:36,561 INFO L444 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-19 22:42:36,561 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,562 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-19 22:42:36,562 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,562 INFO L444 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,562 INFO L444 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,562 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,562 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,562 INFO L444 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,562 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-19 22:42:36,563 INFO L444 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,563 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,563 INFO L444 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-19 22:42:36,563 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,563 INFO L444 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,563 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,563 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,564 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-19 22:42:36,564 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,564 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,564 INFO L444 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,564 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,564 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,564 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-19 22:42:36,565 INFO L444 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,565 INFO L444 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,565 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,565 INFO L444 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,565 INFO L444 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-19 22:42:36,565 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,565 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,565 INFO L444 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,566 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-19 22:42:36,566 INFO L444 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-19 22:42:36,566 INFO L444 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,566 INFO L444 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,566 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-19 22:42:36,566 INFO L444 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,566 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,567 INFO L444 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,567 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,567 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,567 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-19 22:42:36,567 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,567 INFO L444 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,567 INFO L444 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,567 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,568 INFO L444 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,568 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-19 22:42:36,568 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,568 INFO L444 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,568 INFO L444 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-19 22:42:36,568 INFO L444 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,568 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-19 22:42:36,569 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-19 22:42:36,569 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,569 INFO L444 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,569 INFO L444 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,569 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,569 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,569 INFO L444 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-19 22:42:36,569 INFO L444 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-19 22:42:36,570 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,570 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-19 22:42:36,570 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 22:42:36,570 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-19 22:42:36,570 INFO L444 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,570 INFO L444 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,570 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,571 INFO L444 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,571 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,571 INFO L444 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-19 22:42:36,571 INFO L444 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-19 22:42:36,571 INFO L444 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-19 22:42:36,571 INFO L444 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-19 22:42:36,571 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,571 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,572 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,572 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-19 22:42:36,572 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-19 22:42:36,572 INFO L444 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,572 INFO L444 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-19 22:42:36,572 INFO L444 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,572 INFO L444 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,573 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,573 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,573 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-19 22:42:36,573 INFO L444 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-19 22:42:36,573 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-19 22:42:36,573 INFO L444 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,573 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-19 22:42:36,574 INFO L444 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,574 INFO L444 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,574 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,574 INFO L444 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,574 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,574 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,574 INFO L444 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,574 INFO L444 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,574 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-19 22:42:36,574 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-19 22:42:36,574 INFO L444 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-19 22:42:36,575 INFO L444 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-19 22:42:36,575 INFO L444 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,575 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,575 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,575 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,576 INFO L440 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse39 (+ ~a29~0 16))) (let ((.cse40 (+ ~a4~0 42)) (.cse26 (< 0 .cse39)) (.cse19 (= 4 ~a2~0)) (.cse43 (+ ~a0~0 147)) (.cse42 (+ ~a4~0 86))) (let ((.cse1 (<= .cse42 0)) (.cse28 (< 0 .cse43)) (.cse24 (<= 340371 ~a29~0)) (.cse16 (not .cse19)) (.cse11 (<= 0 (+ ~a0~0 384412))) (.cse12 (<= .cse43 0)) (.cse4 (<= 0 (+ ~a0~0 599998))) (.cse18 (or .cse26 (< 0 .cse42))) (.cse6 (<= (+ ~a0~0 149) 0)) (.cse36 (<= ~a2~0 2)) (.cse23 (<= (+ ~a0~0 98) 0)) (.cse5 (<= .cse40 0)) (.cse2 (<= (+ ~a29~0 144) 0))) (let ((.cse10 (and .cse23 .cse5 .cse2)) (.cse15 (< 43 ~a29~0)) (.cse22 (exists ((v_~a0~0_828 Int)) (let ((.cse41 (div v_~a0~0_828 5))) (and (<= 0 (+ (* 10 .cse41) 3459790)) (<= 0 v_~a0~0_828) (<= v_~a0~0_828 599970) (<= (div (+ (* .cse41 10) 3459790) (- 9)) ~a0~0))))) (.cse32 (or (and .cse18 .cse11 .cse36 .cse12) (and .cse4 .cse18 .cse6 .cse36))) (.cse20 (= 1 ~a2~0)) (.cse30 (or (and .cse4 .cse23 .cse5 .cse24) (and .cse4 .cse23 .cse5 (<= 38461 (+ ~a4~0 ~a29~0)) .cse16))) (.cse33 (or (and .cse1 .cse28) (<= 0 (+ ~a0~0 44)))) (.cse17 (<= (+ ~a0~0 61) 0)) (.cse8 (or .cse1 .cse28 (< 0 .cse40) (not (= 4 ULTIMATE.start_calculate_output_~input)))) (.cse7 (= 3 ~a2~0)) (.cse35 (<= 0 (+ ~a0~0 385464))) (.cse29 (<= 220362 ~a29~0)) (.cse34 (<= ~a29~0 42)) (.cse13 (and .cse1 .cse16)) (.cse27 (<= ~a29~0 43)) (.cse0 (<= ~a0~0 599970)) (.cse3 (<= 0 (+ ~a29~0 599999))) (.cse21 (<= 0 (+ ~a29~0 142))) (.cse31 (<= ~a2~0 4)) (.cse14 (<= 4 ~a2~0)) (.cse9 (<= .cse39 0)) (.cse25 (= 2 ~a2~0))) (or (and .cse0 (and .cse1 .cse2 (<= ~a2~0 3)) .cse3) (or (and (and .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (or (and .cse10 .cse11 .cse12 .cse7 .cse8) (and .cse4 (and .cse5 .cse6 .cse2) .cse7))) (and .cse0 .cse13 .cse14 .cse15) (and .cse1 .cse16 .cse17) (and .cse18 .cse5 .cse11 .cse6 .cse3 .cse2 .cse19) (and .cse6 .cse5 .cse20 .cse21 .cse22) (and (and .cse4 .cse23 .cse24) .cse25) (and .cse4 .cse23 .cse26 .cse27 .cse25) (and (<= 5 ~a2~0) .cse23 .cse5 .cse27 .cse28 .cse21) (and .cse14 .cse29 .cse30) (or (and .cse4 .cse10 .cse3 .cse7 .cse8) (and .cse4 .cse23 .cse9 .cse8 .cse5 .cse7 .cse21)) (and .cse23 .cse5 .cse14 .cse28 .cse31) (and .cse4 .cse0 .cse5 .cse26 .cse20 .cse27) (and .cse5 .cse6 .cse7 .cse15 .cse22) (and (and .cse32 .cse15) .cse22) (and .cse4 .cse5 .cse6 .cse14 .cse16) (and (and (and .cse23 .cse5 .cse20) .cse3) .cse28) (and .cse23 .cse5 .cse26 .cse28 .cse7) (and (and .cse26 (and .cse5 .cse33 .cse34 .cse31)) .cse14) (and .cse29 (and .cse1 .cse17)) (and .cse35 .cse26 .cse32) (and .cse28 .cse9 .cse17 .cse5 .cse20 .cse21) (and .cse23 .cse28 .cse25 .cse5 (<= 43 ~a29~0)) (and .cse0 (and .cse1 .cse26 .cse7)) (and .cse30 .cse14 .cse12) (and (and .cse4 .cse23 .cse5 (exists ((v_~a29~0_896 Int)) (and (<= (+ (mod v_~a29~0_896 299978) 300022) ~a29~0) (< 43 v_~a29~0_896) (<= 0 v_~a29~0_896)))) .cse14) (and .cse33 .cse17) (and (and .cse5 .cse11 .cse12 .cse27 .cse16 .cse21) .cse14) (and .cse26 .cse12 .cse27 .cse8 .cse5 .cse11 .cse7) (and (and .cse1 .cse18) .cse25 (not (= 6 ULTIMATE.start_calculate_output_~input))) (and .cse0 (and .cse1 .cse36 .cse21) .cse9) (and .cse35 (or (and (<= 280404 ~a29~0) (and .cse5 .cse6)) (and .cse5 .cse11 .cse6 .cse29) (and .cse6 .cse34 .cse19 .cse18 .cse5 .cse11 .cse21))) (and (and .cse13 .cse26 .cse27) .cse14) (and .cse0 (let ((.cse37 (let ((.cse38 (<= 13 ~a0~0))) (or (and .cse5 .cse38 (<= (+ ~a29~0 196) 0) .cse31) (and .cse1 .cse38 .cse31))))) (or (and (<= 43131 ~a0~0) .cse3 .cse37) (and .cse37 .cse21))) .cse14 .cse9) (and (and .cse4 .cse26 .cse6) .cse25)))))) [2019-11-19 22:42:36,576 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-19 22:42:36,576 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-19 22:42:36,577 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,577 INFO L444 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,577 INFO L444 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,577 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,577 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,577 INFO L444 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,577 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,577 INFO L444 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-19 22:42:36,578 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,578 INFO L444 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-19 22:42:36,578 INFO L447 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-19 22:42:36,578 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,578 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-19 22:42:36,578 INFO L444 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-19 22:42:36,578 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-19 22:42:36,579 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-19 22:42:36,579 INFO L444 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,579 INFO L444 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,579 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,579 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,579 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,579 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-19 22:42:36,580 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-19 22:42:36,580 INFO L444 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,580 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-19 22:42:36,580 INFO L444 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-19 22:42:36,580 INFO L444 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,580 INFO L444 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,580 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,581 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,581 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,581 INFO L444 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,582 INFO L440 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse40 (+ ~a29~0 16))) (let ((.cse11 (= 4 ~a2~0)) (.cse42 (+ ~a4~0 42)) (.cse43 (+ ~a0~0 147)) (.cse22 (< 0 .cse40)) (.cse44 (+ ~a4~0 86))) (let ((.cse5 (or .cse22 (< 0 .cse44))) (.cse8 (<= 0 (+ ~a0~0 384412))) (.cse27 (<= .cse43 0)) (.cse37 (<= ~a2~0 2)) (.cse7 (<= (+ ~a0~0 149) 0)) (.cse10 (<= (+ ~a29~0 144) 0)) (.cse25 (= 3 ~a2~0)) (.cse13 (<= .cse44 0)) (.cse18 (< 0 .cse43)) (.cse23 (<= 0 (+ ~a0~0 599998))) (.cse16 (<= (+ ~a0~0 98) 0)) (.cse6 (<= .cse42 0)) (.cse14 (not .cse11))) (let ((.cse4 (and .cse23 .cse16 .cse6 (<= 38461 (+ ~a4~0 ~a29~0)) .cse14)) (.cse0 (<= 0 (+ ~a0~0 385464))) (.cse31 (<= ~a29~0 42)) (.cse3 (<= 220362 ~a29~0)) (.cse35 (or .cse13 .cse18 (< 0 .cse42) (not (= 4 ULTIMATE.start_calculate_output_~input)))) (.cse33 (and .cse23 (and .cse16 .cse6 .cse10) .cse25)) (.cse32 (and .cse6 .cse7)) (.cse30 (or (and .cse13 .cse18) (<= 0 (+ ~a0~0 44)))) (.cse15 (<= (+ ~a0~0 61) 0)) (.cse17 (= 1 ~a2~0)) (.cse1 (and .cse22 (or (and .cse8 .cse37 .cse27) (and .cse23 .cse7 .cse37)))) (.cse26 (< 43 ~a29~0)) (.cse20 (exists ((v_~a0~0_828 Int)) (let ((.cse41 (div v_~a0~0_828 5))) (and (<= 0 (+ (* 10 .cse41) 3459790)) (<= 0 v_~a0~0_828) (<= v_~a0~0_828 599970) (<= (div (+ (* .cse41 10) 3459790) (- 9)) ~a0~0))))) (.cse36 (and .cse13 .cse5 .cse14)) (.cse21 (= 2 ~a2~0)) (.cse29 (<= 5 ~a2~0)) (.cse28 (<= ~a29~0 43)) (.cse12 (<= ~a0~0 599970)) (.cse9 (<= 0 (+ ~a29~0 599999))) (.cse19 (<= 0 (+ ~a29~0 142))) (.cse24 (<= ~a2~0 4)) (.cse2 (<= 4 ~a2~0)) (.cse34 (<= .cse40 0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 (and .cse9 (and .cse13 .cse10 (<= ~a2~0 3)))) (and .cse13 .cse14 .cse15) (and (and .cse9 (and .cse16 .cse6 .cse17)) .cse18) (and .cse7 .cse6 .cse17 .cse19 .cse20) (and (and .cse16 .cse6 .cse18) (<= 43 ~a29~0) .cse21) (and (and .cse22 (and .cse23 .cse7)) .cse21) (and .cse16 .cse6 .cse2 .cse18 .cse24) (and .cse2 (and .cse23 .cse16 .cse6 (exists ((v_~a29~0_896 Int)) (and (<= (+ (mod v_~a29~0_896 299978) 300022) ~a29~0) (< 43 v_~a29~0_896) (<= 0 v_~a29~0_896))))) (and .cse6 .cse7 .cse25 .cse26 .cse20) (and .cse22 .cse27 .cse28 .cse6 .cse8 .cse25) (and .cse27 (and .cse29 .cse4)) (and (and (and .cse6 .cse30 .cse31 .cse24) .cse22) .cse2) (and .cse0 (or (and .cse6 .cse8 .cse7 .cse3) (and .cse32 (<= 280404 ~a29~0)) (and .cse7 .cse31 .cse11 .cse5 .cse6 .cse8 .cse19))) (or (and .cse33 .cse27) (and .cse34 (and .cse23 .cse6 .cse7 .cse25 .cse35))) (and .cse13 .cse17 .cse10) (and .cse16 .cse6 .cse22 .cse18 .cse25) (and .cse3 (and .cse13 .cse15)) (and .cse18 .cse34 .cse15 .cse6 .cse17 .cse19) (and (and .cse23 .cse16 (<= 340371 ~a29~0)) .cse21) (and .cse12 .cse36 .cse2) (or (and .cse23 .cse16 .cse34 .cse35 .cse6 .cse25 .cse19) (and .cse33 .cse9)) (and .cse23 .cse29 .cse32) (and .cse30 .cse15) (and .cse12 .cse23 .cse6 .cse22 .cse17 .cse28) (and .cse23 .cse16 .cse22 .cse28 .cse21) (and .cse12 (and .cse13 .cse37 .cse19) .cse34) (and .cse12 (and .cse22 (and .cse13 .cse25))) (and (and .cse1 .cse26) .cse20) (and .cse29 (and .cse28 .cse36)) (and (and .cse13 .cse22) .cse21 (not (= 6 ULTIMATE.start_calculate_output_~input))) (and .cse29 (and .cse8 .cse28 (and .cse16 .cse6) .cse19)) (and .cse12 (let ((.cse38 (let ((.cse39 (<= 13 ~a0~0))) (or (and .cse6 .cse39 (<= (+ ~a29~0 196) 0) .cse24) (and .cse13 .cse39 .cse24))))) (or (and (<= 43131 ~a0~0) .cse9 .cse38) (and .cse38 .cse19))) .cse2 .cse34)))))) [2019-11-19 22:42:36,582 INFO L444 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,582 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-19 22:42:36,582 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-19 22:42:36,582 INFO L444 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,582 INFO L444 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,582 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,583 INFO L444 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,583 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,583 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,583 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-19 22:42:36,583 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-19 22:42:36,583 INFO L444 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,583 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,584 INFO L444 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-19 22:42:36,584 INFO L444 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,584 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,584 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,584 INFO L444 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,584 INFO L444 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,584 INFO L444 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,585 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-19 22:42:36,585 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-19 22:42:36,585 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,585 INFO L444 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,585 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,585 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,585 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,585 INFO L444 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,586 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 22:42:36,586 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-19 22:42:36,586 INFO L444 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,586 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-19 22:42:36,586 INFO L444 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,586 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,586 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,587 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,587 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,587 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,587 INFO L444 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,587 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-19 22:42:36,587 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-19 22:42:36,587 INFO L444 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,587 INFO L444 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,588 INFO L444 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,588 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,588 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,588 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,588 INFO L444 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,588 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-19 22:42:36,588 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-19 22:42:36,588 INFO L444 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,589 INFO L444 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,589 INFO L444 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,589 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,589 INFO L444 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,589 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,589 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,589 INFO L444 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-19 22:42:36,590 INFO L444 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-19 22:42:36,590 INFO L444 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,590 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-19 22:42:36,590 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-19 22:42:36,590 INFO L444 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,590 INFO L444 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,590 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,590 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,591 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,591 INFO L444 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,591 INFO L440 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse40 (+ ~a29~0 16))) (let ((.cse11 (= 4 ~a2~0)) (.cse42 (+ ~a4~0 42)) (.cse43 (+ ~a0~0 147)) (.cse22 (< 0 .cse40)) (.cse44 (+ ~a4~0 86))) (let ((.cse5 (or .cse22 (< 0 .cse44))) (.cse8 (<= 0 (+ ~a0~0 384412))) (.cse27 (<= .cse43 0)) (.cse37 (<= ~a2~0 2)) (.cse7 (<= (+ ~a0~0 149) 0)) (.cse10 (<= (+ ~a29~0 144) 0)) (.cse25 (= 3 ~a2~0)) (.cse13 (<= .cse44 0)) (.cse18 (< 0 .cse43)) (.cse23 (<= 0 (+ ~a0~0 599998))) (.cse16 (<= (+ ~a0~0 98) 0)) (.cse6 (<= .cse42 0)) (.cse14 (not .cse11))) (let ((.cse4 (and .cse23 .cse16 .cse6 (<= 38461 (+ ~a4~0 ~a29~0)) .cse14)) (.cse0 (<= 0 (+ ~a0~0 385464))) (.cse31 (<= ~a29~0 42)) (.cse3 (<= 220362 ~a29~0)) (.cse35 (or .cse13 .cse18 (< 0 .cse42) (not (= 4 ULTIMATE.start_calculate_output_~input)))) (.cse33 (and .cse23 (and .cse16 .cse6 .cse10) .cse25)) (.cse32 (and .cse6 .cse7)) (.cse30 (or (and .cse13 .cse18) (<= 0 (+ ~a0~0 44)))) (.cse15 (<= (+ ~a0~0 61) 0)) (.cse17 (= 1 ~a2~0)) (.cse1 (and .cse22 (or (and .cse8 .cse37 .cse27) (and .cse23 .cse7 .cse37)))) (.cse26 (< 43 ~a29~0)) (.cse20 (exists ((v_~a0~0_828 Int)) (let ((.cse41 (div v_~a0~0_828 5))) (and (<= 0 (+ (* 10 .cse41) 3459790)) (<= 0 v_~a0~0_828) (<= v_~a0~0_828 599970) (<= (div (+ (* .cse41 10) 3459790) (- 9)) ~a0~0))))) (.cse36 (and .cse13 .cse5 .cse14)) (.cse21 (= 2 ~a2~0)) (.cse29 (<= 5 ~a2~0)) (.cse28 (<= ~a29~0 43)) (.cse12 (<= ~a0~0 599970)) (.cse9 (<= 0 (+ ~a29~0 599999))) (.cse19 (<= 0 (+ ~a29~0 142))) (.cse24 (<= ~a2~0 4)) (.cse2 (<= 4 ~a2~0)) (.cse34 (<= .cse40 0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 (and .cse9 (and .cse13 .cse10 (<= ~a2~0 3)))) (and .cse13 .cse14 .cse15) (and (and .cse9 (and .cse16 .cse6 .cse17)) .cse18) (and .cse7 .cse6 .cse17 .cse19 .cse20) (and (and .cse16 .cse6 .cse18) (<= 43 ~a29~0) .cse21) (and (and .cse22 (and .cse23 .cse7)) .cse21) (and .cse16 .cse6 .cse2 .cse18 .cse24) (and .cse2 (and .cse23 .cse16 .cse6 (exists ((v_~a29~0_896 Int)) (and (<= (+ (mod v_~a29~0_896 299978) 300022) ~a29~0) (< 43 v_~a29~0_896) (<= 0 v_~a29~0_896))))) (and .cse6 .cse7 .cse25 .cse26 .cse20) (and .cse22 .cse27 .cse28 .cse6 .cse8 .cse25) (and .cse27 (and .cse29 .cse4)) (and (and (and .cse6 .cse30 .cse31 .cse24) .cse22) .cse2) (and .cse0 (or (and .cse6 .cse8 .cse7 .cse3) (and .cse32 (<= 280404 ~a29~0)) (and .cse7 .cse31 .cse11 .cse5 .cse6 .cse8 .cse19))) (or (and .cse33 .cse27) (and .cse34 (and .cse23 .cse6 .cse7 .cse25 .cse35))) (and .cse13 .cse17 .cse10) (and .cse16 .cse6 .cse22 .cse18 .cse25) (and .cse3 (and .cse13 .cse15)) (and .cse18 .cse34 .cse15 .cse6 .cse17 .cse19) (and (and .cse23 .cse16 (<= 340371 ~a29~0)) .cse21) (and .cse12 .cse36 .cse2) (or (and .cse23 .cse16 .cse34 .cse35 .cse6 .cse25 .cse19) (and .cse33 .cse9)) (and .cse23 .cse29 .cse32) (and .cse30 .cse15) (and .cse12 .cse23 .cse6 .cse22 .cse17 .cse28) (and .cse23 .cse16 .cse22 .cse28 .cse21) (and .cse12 (and .cse13 .cse37 .cse19) .cse34) (and .cse12 (and .cse22 (and .cse13 .cse25))) (and (and .cse1 .cse26) .cse20) (and .cse29 (and .cse28 .cse36)) (and (and .cse13 .cse22) .cse21 (not (= 6 ULTIMATE.start_calculate_output_~input))) (and .cse29 (and .cse8 .cse28 (and .cse16 .cse6) .cse19)) (and .cse12 (let ((.cse38 (let ((.cse39 (<= 13 ~a0~0))) (or (and .cse6 .cse39 (<= (+ ~a29~0 196) 0) .cse24) (and .cse13 .cse39 .cse24))))) (or (and (<= 43131 ~a0~0) .cse9 .cse38) (and .cse38 .cse19))) .cse2 .cse34)))))) [2019-11-19 22:42:36,592 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-19 22:42:36,592 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-19 22:42:36,592 INFO L444 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,592 INFO L444 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,592 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,592 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,592 INFO L444 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,593 INFO L444 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,593 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,593 INFO L444 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,593 INFO L444 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-19 22:42:36,593 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-19 22:42:36,593 INFO L444 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,593 INFO L444 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-19 22:42:36,594 INFO L444 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-19 22:42:36,594 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,594 INFO L444 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,594 INFO L444 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,594 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,594 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,594 INFO L444 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-19 22:42:36,594 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-19 22:42:36,595 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,595 INFO L444 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,595 INFO L444 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,595 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,595 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-19 22:42:36,595 INFO L444 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-19 22:42:36,595 INFO L444 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-19 22:42:36,595 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,596 INFO L444 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-19 22:42:36,596 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-19 22:42:36,596 INFO L444 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,596 INFO L444 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,596 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,596 INFO L444 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,596 INFO L444 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,597 INFO L444 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,597 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,597 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-19 22:42:36,597 INFO L444 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-19 22:42:36,597 INFO L444 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,597 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,597 INFO L444 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,597 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-19 22:42:36,598 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,598 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 22:42:36,598 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,598 INFO L444 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-19 22:42:36,598 INFO L444 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,598 INFO L444 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,598 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,598 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,599 INFO L444 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,599 INFO L444 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,599 INFO L444 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,599 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-19 22:42:36,599 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-19 22:42:36,599 INFO L444 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,599 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-19 22:42:36,599 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,600 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,600 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,600 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-19 22:42:36,600 INFO L444 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,600 INFO L444 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,600 INFO L444 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,600 INFO L444 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,601 INFO L444 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-19 22:42:36,601 INFO L444 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,601 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,601 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-19 22:42:36,601 INFO L444 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-19 22:42:36,601 INFO L444 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,601 INFO L444 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,601 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,602 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-19 22:42:36,602 INFO L444 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,602 INFO L444 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,602 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,602 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,602 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,602 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-19 22:42:36,602 INFO L444 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,603 INFO L444 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,603 INFO L444 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-19 22:42:36,603 INFO L444 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-19 22:42:36,603 INFO L444 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,603 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 22:42:36,603 INFO L444 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-19 22:42:36,603 INFO L444 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,604 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-19 22:42:36,604 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,604 INFO L444 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-19 22:42:36,604 INFO L444 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-19 22:42:36,604 INFO L444 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,604 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,604 INFO L444 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-19 22:42:36,604 INFO L444 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-19 22:42:36,605 INFO L444 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-19 22:42:36,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:36,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:36,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:36,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,639 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,639 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,639 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,640 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:36,640 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:36,641 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:36,641 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,641 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,642 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,642 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:36,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:36,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:36,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:36,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:36,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:36,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:36,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:36,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:36,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:36,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:36,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:36,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:36,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:42:36 BoogieIcfgContainer [2019-11-19 22:42:36,684 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:42:36,684 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:42:36,684 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:42:36,685 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:42:36,685 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:39:41" (3/4) ... [2019-11-19 22:42:36,688 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 22:42:36,715 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-19 22:42:36,718 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 22:42:36,746 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((0 <= a0 + 385464 && 0 < a29 + 16 && (((0 <= a0 + 384412 && a2 <= 2) && a0 + 147 <= 0) || ((0 <= a0 + 599998 && a0 + 149 <= 0) && a2 <= 2))) || ((4 <= a2 && 220362 <= a29) && (((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && !(4 == a2))) || (((((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && a0 + 149 <= 0) && 0 <= a0 + 384412) && 0 <= a29 + 599999) && a29 + 144 <= 0) && 4 == a2)) || (a0 <= 599970 && 0 <= a29 + 599999 && (a4 + 86 <= 0 && a29 + 144 <= 0) && a2 <= 3)) || ((a4 + 86 <= 0 && !(4 == a2)) && a0 + 61 <= 0)) || ((0 <= a29 + 599999 && (a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || ((((a0 + 149 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 142) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && 43 <= a29) && 2 == a2)) || ((0 < a29 + 16 && 0 <= a0 + 599998 && a0 + 149 <= 0) && 2 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147) && a2 <= 4)) || (4 <= a2 && ((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && (\exists v_~a29~0_896 : int :: (v_~a29~0_896 % 299978 + 300022 <= a29 && 43 < v_~a29~0_896) && 0 <= v_~a29~0_896))) || ((((a4 + 42 <= 0 && a0 + 149 <= 0) && 3 == a2) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || (((((0 < a29 + 16 && a0 + 147 <= 0) && a29 <= 43) && a4 + 42 <= 0) && 0 <= a0 + 384412) && 3 == a2)) || (a0 + 147 <= 0 && 5 <= a2 && (((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && !(4 == a2))) || (((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44)) && a29 <= 42) && a2 <= 4) && 0 < a29 + 16) && 4 <= a2)) || (0 <= a0 + 385464 && (((((a4 + 42 <= 0 && 0 <= a0 + 384412) && a0 + 149 <= 0) && 220362 <= a29) || ((a4 + 42 <= 0 && a0 + 149 <= 0) && 280404 <= a29)) || ((((((a0 + 149 <= 0 && a29 <= 42) && 4 == a2) && (0 < a29 + 16 || 0 < a4 + 86)) && a4 + 42 <= 0) && 0 <= a0 + 384412) && 0 <= a29 + 142)))) || (((0 <= a0 + 599998 && (a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 144 <= 0) && 3 == a2) && a0 + 147 <= 0) || (a29 + 16 <= 0 && (((0 <= a0 + 599998 && a4 + 42 <= 0) && a0 + 149 <= 0) && 3 == a2) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input)))) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 0 < a0 + 147) && 3 == a2)) || (220362 <= a29 && a4 + 86 <= 0 && a0 + 61 <= 0)) || (((((0 < a0 + 147 && a29 + 16 <= 0) && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 142)) || (((0 <= a0 + 599998 && a0 + 98 <= 0) && 340371 <= a29) && 2 == a2)) || ((a0 <= 599970 && (a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && !(4 == a2)) && 4 <= a2)) || ((((((0 <= a0 + 599998 && a0 + 98 <= 0) && a29 + 16 <= 0) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) && a4 + 42 <= 0) && 3 == a2) && 0 <= a29 + 142) || (((0 <= a0 + 599998 && (a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 144 <= 0) && 3 == a2) && 0 <= a29 + 599999)) || ((0 <= a0 + 599998 && 5 <= a2) && a4 + 42 <= 0 && a0 + 149 <= 0)) || (((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44) && a0 + 61 <= 0)) || (((((a0 <= 599970 && 0 <= a0 + 599998) && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && a29 <= 43)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && 0 < a29 + 16) && a29 <= 43) && 2 == a2)) || ((a0 <= 599970 && (a4 + 86 <= 0 && a2 <= 2) && 0 <= a29 + 142) && a29 + 16 <= 0)) || (a0 <= 599970 && 0 < a29 + 16 && a4 + 86 <= 0 && 3 == a2)) || (((0 < a29 + 16 && (((0 <= a0 + 384412 && a2 <= 2) && a0 + 147 <= 0) || ((0 <= a0 + 599998 && a0 + 149 <= 0) && a2 <= 2))) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || (5 <= a2 && a29 <= 43 && (a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && !(4 == a2))) || (((a4 + 86 <= 0 && 0 < a29 + 16) && 2 == a2) && !(6 == input))) || (5 <= a2 && ((0 <= a0 + 384412 && a29 <= 43) && a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a29 + 142)) || (((a0 <= 599970 && (((43131 <= a0 && 0 <= a29 + 599999) && ((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4))) || (((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4)) && 0 <= a29 + 142))) && 4 <= a2) && a29 + 16 <= 0) [2019-11-19 22:42:36,751 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((0 <= a0 + 385464 && 0 < a29 + 16 && (((0 <= a0 + 384412 && a2 <= 2) && a0 + 147 <= 0) || ((0 <= a0 + 599998 && a0 + 149 <= 0) && a2 <= 2))) || ((4 <= a2 && 220362 <= a29) && (((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && !(4 == a2))) || (((((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && a0 + 149 <= 0) && 0 <= a0 + 384412) && 0 <= a29 + 599999) && a29 + 144 <= 0) && 4 == a2)) || (a0 <= 599970 && 0 <= a29 + 599999 && (a4 + 86 <= 0 && a29 + 144 <= 0) && a2 <= 3)) || ((a4 + 86 <= 0 && !(4 == a2)) && a0 + 61 <= 0)) || ((0 <= a29 + 599999 && (a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || ((((a0 + 149 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 142) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && 43 <= a29) && 2 == a2)) || ((0 < a29 + 16 && 0 <= a0 + 599998 && a0 + 149 <= 0) && 2 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147) && a2 <= 4)) || (4 <= a2 && ((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && (\exists v_~a29~0_896 : int :: (v_~a29~0_896 % 299978 + 300022 <= a29 && 43 < v_~a29~0_896) && 0 <= v_~a29~0_896))) || ((((a4 + 42 <= 0 && a0 + 149 <= 0) && 3 == a2) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || (((((0 < a29 + 16 && a0 + 147 <= 0) && a29 <= 43) && a4 + 42 <= 0) && 0 <= a0 + 384412) && 3 == a2)) || (a0 + 147 <= 0 && 5 <= a2 && (((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && !(4 == a2))) || (((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44)) && a29 <= 42) && a2 <= 4) && 0 < a29 + 16) && 4 <= a2)) || (0 <= a0 + 385464 && (((((a4 + 42 <= 0 && 0 <= a0 + 384412) && a0 + 149 <= 0) && 220362 <= a29) || ((a4 + 42 <= 0 && a0 + 149 <= 0) && 280404 <= a29)) || ((((((a0 + 149 <= 0 && a29 <= 42) && 4 == a2) && (0 < a29 + 16 || 0 < a4 + 86)) && a4 + 42 <= 0) && 0 <= a0 + 384412) && 0 <= a29 + 142)))) || (((0 <= a0 + 599998 && (a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 144 <= 0) && 3 == a2) && a0 + 147 <= 0) || (a29 + 16 <= 0 && (((0 <= a0 + 599998 && a4 + 42 <= 0) && a0 + 149 <= 0) && 3 == a2) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input)))) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 0 < a0 + 147) && 3 == a2)) || (220362 <= a29 && a4 + 86 <= 0 && a0 + 61 <= 0)) || (((((0 < a0 + 147 && a29 + 16 <= 0) && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 142)) || (((0 <= a0 + 599998 && a0 + 98 <= 0) && 340371 <= a29) && 2 == a2)) || ((a0 <= 599970 && (a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && !(4 == a2)) && 4 <= a2)) || ((((((0 <= a0 + 599998 && a0 + 98 <= 0) && a29 + 16 <= 0) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) && a4 + 42 <= 0) && 3 == a2) && 0 <= a29 + 142) || (((0 <= a0 + 599998 && (a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 144 <= 0) && 3 == a2) && 0 <= a29 + 599999)) || ((0 <= a0 + 599998 && 5 <= a2) && a4 + 42 <= 0 && a0 + 149 <= 0)) || (((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44) && a0 + 61 <= 0)) || (((((a0 <= 599970 && 0 <= a0 + 599998) && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && a29 <= 43)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && 0 < a29 + 16) && a29 <= 43) && 2 == a2)) || ((a0 <= 599970 && (a4 + 86 <= 0 && a2 <= 2) && 0 <= a29 + 142) && a29 + 16 <= 0)) || (a0 <= 599970 && 0 < a29 + 16 && a4 + 86 <= 0 && 3 == a2)) || (((0 < a29 + 16 && (((0 <= a0 + 384412 && a2 <= 2) && a0 + 147 <= 0) || ((0 <= a0 + 599998 && a0 + 149 <= 0) && a2 <= 2))) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || (5 <= a2 && a29 <= 43 && (a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && !(4 == a2))) || (((a4 + 86 <= 0 && 0 < a29 + 16) && 2 == a2) && !(6 == input))) || (5 <= a2 && ((0 <= a0 + 384412 && a29 <= 43) && a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a29 + 142)) || (((a0 <= 599970 && (((43131 <= a0 && 0 <= a29 + 599999) && ((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4))) || (((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4)) && 0 <= a29 + 142))) && 4 <= a2) && a29 + 16 <= 0) [2019-11-19 22:42:36,765 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((a0 <= 599970 && (a4 + 86 <= 0 && a29 + 144 <= 0) && a2 <= 3) && 0 <= a29 + 599999) || (((((0 <= a0 + 599998 && a4 + 42 <= 0) && a0 + 149 <= 0) && 3 == a2) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) && a29 + 16 <= 0) || ((((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 144 <= 0) && 0 <= a0 + 384412) && a0 + 147 <= 0) && 3 == a2) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) || ((0 <= a0 + 599998 && (a4 + 42 <= 0 && a0 + 149 <= 0) && a29 + 144 <= 0) && 3 == a2)) || (((a0 <= 599970 && a4 + 86 <= 0 && !(4 == a2)) && 4 <= a2) && 43 < a29)) || ((a4 + 86 <= 0 && !(4 == a2)) && a0 + 61 <= 0)) || (((((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && 0 <= a0 + 384412) && a0 + 149 <= 0) && 0 <= a29 + 599999) && a29 + 144 <= 0) && 4 == a2)) || ((((a0 + 149 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 142) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || (((0 <= a0 + 599998 && a0 + 98 <= 0) && 340371 <= a29) && 2 == a2)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && 0 < a29 + 16) && a29 <= 43) && 2 == a2)) || (((((5 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a29 <= 43) && 0 < a0 + 147) && 0 <= a29 + 142)) || ((4 <= a2 && 220362 <= a29) && ((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 340371 <= a29) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && !(4 == a2))))) || ((((0 <= a0 + 599998 && (a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 144 <= 0) && 0 <= a29 + 599999) && 3 == a2) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) || ((((((0 <= a0 + 599998 && a0 + 98 <= 0) && a29 + 16 <= 0) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) && a4 + 42 <= 0) && 3 == a2) && 0 <= a29 + 142)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147) && a2 <= 4)) || (((((0 <= a0 + 599998 && a0 <= 599970) && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && a29 <= 43)) || ((((a4 + 42 <= 0 && a0 + 149 <= 0) && 3 == a2) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || (((((((0 < a29 + 16 || 0 < a4 + 86) && 0 <= a0 + 384412) && a2 <= 2) && a0 + 147 <= 0) || (((0 <= a0 + 599998 && (0 < a29 + 16 || 0 < a4 + 86)) && a0 + 149 <= 0) && a2 <= 2)) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || ((((0 <= a0 + 599998 && a4 + 42 <= 0) && a0 + 149 <= 0) && 4 <= a2) && !(4 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 599999) && 0 < a0 + 147)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 0 < a0 + 147) && 3 == a2)) || ((0 < a29 + 16 && ((a4 + 42 <= 0 && ((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44)) && a29 <= 42) && a2 <= 4) && 4 <= a2)) || (220362 <= a29 && a4 + 86 <= 0 && a0 + 61 <= 0)) || ((0 <= a0 + 385464 && 0 < a29 + 16) && (((((0 < a29 + 16 || 0 < a4 + 86) && 0 <= a0 + 384412) && a2 <= 2) && a0 + 147 <= 0) || (((0 <= a0 + 599998 && (0 < a29 + 16 || 0 < a4 + 86)) && a0 + 149 <= 0) && a2 <= 2)))) || (((((0 < a0 + 147 && a29 + 16 <= 0) && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 142)) || ((((a0 + 98 <= 0 && 0 < a0 + 147) && 2 == a2) && a4 + 42 <= 0) && 43 <= a29)) || (a0 <= 599970 && (a4 + 86 <= 0 && 0 < a29 + 16) && 3 == a2)) || ((((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 340371 <= a29) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && !(4 == a2))) && 4 <= a2) && a0 + 147 <= 0)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && (\exists v_~a29~0_896 : int :: (v_~a29~0_896 % 299978 + 300022 <= a29 && 43 < v_~a29~0_896) && 0 <= v_~a29~0_896)) && 4 <= a2)) || (((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44) && a0 + 61 <= 0)) || ((((((a4 + 42 <= 0 && 0 <= a0 + 384412) && a0 + 147 <= 0) && a29 <= 43) && !(4 == a2)) && 0 <= a29 + 142) && 4 <= a2)) || ((((((0 < a29 + 16 && a0 + 147 <= 0) && a29 <= 43) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) && a4 + 42 <= 0) && 0 <= a0 + 384412) && 3 == a2)) || (((a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && 2 == a2) && !(6 == input))) || ((a0 <= 599970 && (a4 + 86 <= 0 && a2 <= 2) && 0 <= a29 + 142) && a29 + 16 <= 0)) || (0 <= a0 + 385464 && (((280404 <= a29 && a4 + 42 <= 0 && a0 + 149 <= 0) || (((a4 + 42 <= 0 && 0 <= a0 + 384412) && a0 + 149 <= 0) && 220362 <= a29)) || ((((((a0 + 149 <= 0 && a29 <= 42) && 4 == a2) && (0 < a29 + 16 || 0 < a4 + 86)) && a4 + 42 <= 0) && 0 <= a0 + 384412) && 0 <= a29 + 142)))) || ((((a4 + 86 <= 0 && !(4 == a2)) && 0 < a29 + 16) && a29 <= 43) && 4 <= a2)) || (((a0 <= 599970 && (((43131 <= a0 && 0 <= a29 + 599999) && ((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4))) || (((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4)) && 0 <= a29 + 142))) && 4 <= a2) && a29 + 16 <= 0)) || (((0 <= a0 + 599998 && 0 < a29 + 16) && a0 + 149 <= 0) && 2 == a2) [2019-11-19 22:42:37,012 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9bdf8ddf-fa6c-4fe1-a479-cc64ddd85210/bin/uautomizer/witness.graphml [2019-11-19 22:42:37,012 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:42:37,014 INFO L168 Benchmark]: Toolchain (without parser) took 179961.11 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 944.7 MB in the beginning and 4.1 GB in the end (delta: -3.2 GB). Peak memory consumption was 874.2 MB. Max. memory is 11.5 GB. [2019-11-19 22:42:37,014 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:42:37,014 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1430.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -141.9 MB). Peak memory consumption was 49.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:42:37,015 INFO L168 Benchmark]: Boogie Procedure Inliner took 193.88 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: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:42:37,015 INFO L168 Benchmark]: Boogie Preprocessor took 193.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:42:37,015 INFO L168 Benchmark]: RCFGBuilder took 2830.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 119.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -96.3 MB). Peak memory consumption was 214.6 MB. Max. memory is 11.5 GB. [2019-11-19 22:42:37,016 INFO L168 Benchmark]: TraceAbstraction took 174981.24 ms. Allocated memory was 1.3 GB in the beginning and 5.1 GB in the end (delta: 3.7 GB). Free memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: -3.1 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-11-19 22:42:37,016 INFO L168 Benchmark]: Witness Printer took 328.31 ms. Allocated memory is still 5.1 GB. Free memory was 4.2 GB in the beginning and 4.1 GB in the end (delta: 108.8 MB). Peak memory consumption was 108.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:42:37,018 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.54 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1430.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -141.9 MB). Peak memory consumption was 49.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 193.88 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: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 193.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2830.07 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 119.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -96.3 MB). Peak memory consumption was 214.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 174981.24 ms. Allocated memory was 1.3 GB in the beginning and 5.1 GB in the end (delta: 3.7 GB). Free memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: -3.1 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 328.31 ms. Allocated memory is still 5.1 GB. Free memory was 4.2 GB in the beginning and 4.1 GB in the end (delta: 108.8 MB). Peak memory consumption was 108.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 184]: 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: 1766]: Loop Invariant [2019-11-19 22:42:37,032 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,033 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,033 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,033 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,034 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:37,034 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:37,034 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:37,035 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,035 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,035 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,036 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,036 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,036 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,037 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,037 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,039 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,039 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,040 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:37,041 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:37,041 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:37,041 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,042 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,042 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,042 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,043 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,043 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,043 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,043 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((0 <= a0 + 385464 && 0 < a29 + 16 && (((0 <= a0 + 384412 && a2 <= 2) && a0 + 147 <= 0) || ((0 <= a0 + 599998 && a0 + 149 <= 0) && a2 <= 2))) || ((4 <= a2 && 220362 <= a29) && (((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && !(4 == a2))) || (((((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && a0 + 149 <= 0) && 0 <= a0 + 384412) && 0 <= a29 + 599999) && a29 + 144 <= 0) && 4 == a2)) || (a0 <= 599970 && 0 <= a29 + 599999 && (a4 + 86 <= 0 && a29 + 144 <= 0) && a2 <= 3)) || ((a4 + 86 <= 0 && !(4 == a2)) && a0 + 61 <= 0)) || ((0 <= a29 + 599999 && (a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || ((((a0 + 149 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 142) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && 43 <= a29) && 2 == a2)) || ((0 < a29 + 16 && 0 <= a0 + 599998 && a0 + 149 <= 0) && 2 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147) && a2 <= 4)) || (4 <= a2 && ((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && (\exists v_~a29~0_896 : int :: (v_~a29~0_896 % 299978 + 300022 <= a29 && 43 < v_~a29~0_896) && 0 <= v_~a29~0_896))) || ((((a4 + 42 <= 0 && a0 + 149 <= 0) && 3 == a2) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || (((((0 < a29 + 16 && a0 + 147 <= 0) && a29 <= 43) && a4 + 42 <= 0) && 0 <= a0 + 384412) && 3 == a2)) || (a0 + 147 <= 0 && 5 <= a2 && (((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && !(4 == a2))) || (((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44)) && a29 <= 42) && a2 <= 4) && 0 < a29 + 16) && 4 <= a2)) || (0 <= a0 + 385464 && (((((a4 + 42 <= 0 && 0 <= a0 + 384412) && a0 + 149 <= 0) && 220362 <= a29) || ((a4 + 42 <= 0 && a0 + 149 <= 0) && 280404 <= a29)) || ((((((a0 + 149 <= 0 && a29 <= 42) && 4 == a2) && (0 < a29 + 16 || 0 < a4 + 86)) && a4 + 42 <= 0) && 0 <= a0 + 384412) && 0 <= a29 + 142)))) || (((0 <= a0 + 599998 && (a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 144 <= 0) && 3 == a2) && a0 + 147 <= 0) || (a29 + 16 <= 0 && (((0 <= a0 + 599998 && a4 + 42 <= 0) && a0 + 149 <= 0) && 3 == a2) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input)))) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 0 < a0 + 147) && 3 == a2)) || (220362 <= a29 && a4 + 86 <= 0 && a0 + 61 <= 0)) || (((((0 < a0 + 147 && a29 + 16 <= 0) && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 142)) || (((0 <= a0 + 599998 && a0 + 98 <= 0) && 340371 <= a29) && 2 == a2)) || ((a0 <= 599970 && (a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && !(4 == a2)) && 4 <= a2)) || ((((((0 <= a0 + 599998 && a0 + 98 <= 0) && a29 + 16 <= 0) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) && a4 + 42 <= 0) && 3 == a2) && 0 <= a29 + 142) || (((0 <= a0 + 599998 && (a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 144 <= 0) && 3 == a2) && 0 <= a29 + 599999)) || ((0 <= a0 + 599998 && 5 <= a2) && a4 + 42 <= 0 && a0 + 149 <= 0)) || (((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44) && a0 + 61 <= 0)) || (((((a0 <= 599970 && 0 <= a0 + 599998) && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && a29 <= 43)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && 0 < a29 + 16) && a29 <= 43) && 2 == a2)) || ((a0 <= 599970 && (a4 + 86 <= 0 && a2 <= 2) && 0 <= a29 + 142) && a29 + 16 <= 0)) || (a0 <= 599970 && 0 < a29 + 16 && a4 + 86 <= 0 && 3 == a2)) || (((0 < a29 + 16 && (((0 <= a0 + 384412 && a2 <= 2) && a0 + 147 <= 0) || ((0 <= a0 + 599998 && a0 + 149 <= 0) && a2 <= 2))) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || (5 <= a2 && a29 <= 43 && (a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && !(4 == a2))) || (((a4 + 86 <= 0 && 0 < a29 + 16) && 2 == a2) && !(6 == input))) || (5 <= a2 && ((0 <= a0 + 384412 && a29 <= 43) && a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a29 + 142)) || (((a0 <= 599970 && (((43131 <= a0 && 0 <= a29 + 599999) && ((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4))) || (((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4)) && 0 <= a29 + 142))) && 4 <= a2) && a29 + 16 <= 0) - InvariantResult [Line: 23]: Loop Invariant [2019-11-19 22:42:37,046 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,046 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,046 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,047 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,047 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:37,047 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:37,048 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:37,048 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,053 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,053 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,054 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,054 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,054 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:37,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:37,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:37,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,056 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((0 <= a0 + 385464 && 0 < a29 + 16 && (((0 <= a0 + 384412 && a2 <= 2) && a0 + 147 <= 0) || ((0 <= a0 + 599998 && a0 + 149 <= 0) && a2 <= 2))) || ((4 <= a2 && 220362 <= a29) && (((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && !(4 == a2))) || (((((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && a0 + 149 <= 0) && 0 <= a0 + 384412) && 0 <= a29 + 599999) && a29 + 144 <= 0) && 4 == a2)) || (a0 <= 599970 && 0 <= a29 + 599999 && (a4 + 86 <= 0 && a29 + 144 <= 0) && a2 <= 3)) || ((a4 + 86 <= 0 && !(4 == a2)) && a0 + 61 <= 0)) || ((0 <= a29 + 599999 && (a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147)) || ((((a0 + 149 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 142) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && 43 <= a29) && 2 == a2)) || ((0 < a29 + 16 && 0 <= a0 + 599998 && a0 + 149 <= 0) && 2 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147) && a2 <= 4)) || (4 <= a2 && ((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && (\exists v_~a29~0_896 : int :: (v_~a29~0_896 % 299978 + 300022 <= a29 && 43 < v_~a29~0_896) && 0 <= v_~a29~0_896))) || ((((a4 + 42 <= 0 && a0 + 149 <= 0) && 3 == a2) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || (((((0 < a29 + 16 && a0 + 147 <= 0) && a29 <= 43) && a4 + 42 <= 0) && 0 <= a0 + 384412) && 3 == a2)) || (a0 + 147 <= 0 && 5 <= a2 && (((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && !(4 == a2))) || (((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44)) && a29 <= 42) && a2 <= 4) && 0 < a29 + 16) && 4 <= a2)) || (0 <= a0 + 385464 && (((((a4 + 42 <= 0 && 0 <= a0 + 384412) && a0 + 149 <= 0) && 220362 <= a29) || ((a4 + 42 <= 0 && a0 + 149 <= 0) && 280404 <= a29)) || ((((((a0 + 149 <= 0 && a29 <= 42) && 4 == a2) && (0 < a29 + 16 || 0 < a4 + 86)) && a4 + 42 <= 0) && 0 <= a0 + 384412) && 0 <= a29 + 142)))) || (((0 <= a0 + 599998 && (a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 144 <= 0) && 3 == a2) && a0 + 147 <= 0) || (a29 + 16 <= 0 && (((0 <= a0 + 599998 && a4 + 42 <= 0) && a0 + 149 <= 0) && 3 == a2) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input)))) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 0 < a0 + 147) && 3 == a2)) || (220362 <= a29 && a4 + 86 <= 0 && a0 + 61 <= 0)) || (((((0 < a0 + 147 && a29 + 16 <= 0) && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 142)) || (((0 <= a0 + 599998 && a0 + 98 <= 0) && 340371 <= a29) && 2 == a2)) || ((a0 <= 599970 && (a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && !(4 == a2)) && 4 <= a2)) || ((((((0 <= a0 + 599998 && a0 + 98 <= 0) && a29 + 16 <= 0) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) && a4 + 42 <= 0) && 3 == a2) && 0 <= a29 + 142) || (((0 <= a0 + 599998 && (a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 144 <= 0) && 3 == a2) && 0 <= a29 + 599999)) || ((0 <= a0 + 599998 && 5 <= a2) && a4 + 42 <= 0 && a0 + 149 <= 0)) || (((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44) && a0 + 61 <= 0)) || (((((a0 <= 599970 && 0 <= a0 + 599998) && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && a29 <= 43)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && 0 < a29 + 16) && a29 <= 43) && 2 == a2)) || ((a0 <= 599970 && (a4 + 86 <= 0 && a2 <= 2) && 0 <= a29 + 142) && a29 + 16 <= 0)) || (a0 <= 599970 && 0 < a29 + 16 && a4 + 86 <= 0 && 3 == a2)) || (((0 < a29 + 16 && (((0 <= a0 + 384412 && a2 <= 2) && a0 + 147 <= 0) || ((0 <= a0 + 599998 && a0 + 149 <= 0) && a2 <= 2))) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || (5 <= a2 && a29 <= 43 && (a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && !(4 == a2))) || (((a4 + 86 <= 0 && 0 < a29 + 16) && 2 == a2) && !(6 == input))) || (5 <= a2 && ((0 <= a0 + 384412 && a29 <= 43) && a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a29 + 142)) || (((a0 <= 599970 && (((43131 <= a0 && 0 <= a29 + 599999) && ((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4))) || (((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4)) && 0 <= a29 + 142))) && 4 <= a2) && a29 + 16 <= 0) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-19 22:42:37,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,060 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:37,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:37,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:37,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-11-19 22:42:37,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:37,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-11-19 22:42:37,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((a0 <= 599970 && (a4 + 86 <= 0 && a29 + 144 <= 0) && a2 <= 3) && 0 <= a29 + 599999) || (((((0 <= a0 + 599998 && a4 + 42 <= 0) && a0 + 149 <= 0) && 3 == a2) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) && a29 + 16 <= 0) || ((((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 144 <= 0) && 0 <= a0 + 384412) && a0 + 147 <= 0) && 3 == a2) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) || ((0 <= a0 + 599998 && (a4 + 42 <= 0 && a0 + 149 <= 0) && a29 + 144 <= 0) && 3 == a2)) || (((a0 <= 599970 && a4 + 86 <= 0 && !(4 == a2)) && 4 <= a2) && 43 < a29)) || ((a4 + 86 <= 0 && !(4 == a2)) && a0 + 61 <= 0)) || (((((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && 0 <= a0 + 384412) && a0 + 149 <= 0) && 0 <= a29 + 599999) && a29 + 144 <= 0) && 4 == a2)) || ((((a0 + 149 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 142) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || (((0 <= a0 + 599998 && a0 + 98 <= 0) && 340371 <= a29) && 2 == a2)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && 0 < a29 + 16) && a29 <= 43) && 2 == a2)) || (((((5 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a29 <= 43) && 0 < a0 + 147) && 0 <= a29 + 142)) || ((4 <= a2 && 220362 <= a29) && ((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 340371 <= a29) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && !(4 == a2))))) || ((((0 <= a0 + 599998 && (a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 144 <= 0) && 0 <= a29 + 599999) && 3 == a2) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) || ((((((0 <= a0 + 599998 && a0 + 98 <= 0) && a29 + 16 <= 0) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) && a4 + 42 <= 0) && 3 == a2) && 0 <= a29 + 142)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147) && a2 <= 4)) || (((((0 <= a0 + 599998 && a0 <= 599970) && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && a29 <= 43)) || ((((a4 + 42 <= 0 && a0 + 149 <= 0) && 3 == a2) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || (((((((0 < a29 + 16 || 0 < a4 + 86) && 0 <= a0 + 384412) && a2 <= 2) && a0 + 147 <= 0) || (((0 <= a0 + 599998 && (0 < a29 + 16 || 0 < a4 + 86)) && a0 + 149 <= 0) && a2 <= 2)) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || ((((0 <= a0 + 599998 && a4 + 42 <= 0) && a0 + 149 <= 0) && 4 <= a2) && !(4 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 599999) && 0 < a0 + 147)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 0 < a0 + 147) && 3 == a2)) || ((0 < a29 + 16 && ((a4 + 42 <= 0 && ((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44)) && a29 <= 42) && a2 <= 4) && 4 <= a2)) || (220362 <= a29 && a4 + 86 <= 0 && a0 + 61 <= 0)) || ((0 <= a0 + 385464 && 0 < a29 + 16) && (((((0 < a29 + 16 || 0 < a4 + 86) && 0 <= a0 + 384412) && a2 <= 2) && a0 + 147 <= 0) || (((0 <= a0 + 599998 && (0 < a29 + 16 || 0 < a4 + 86)) && a0 + 149 <= 0) && a2 <= 2)))) || (((((0 < a0 + 147 && a29 + 16 <= 0) && a0 + 61 <= 0) && a4 + 42 <= 0) && 1 == a2) && 0 <= a29 + 142)) || ((((a0 + 98 <= 0 && 0 < a0 + 147) && 2 == a2) && a4 + 42 <= 0) && 43 <= a29)) || (a0 <= 599970 && (a4 + 86 <= 0 && 0 < a29 + 16) && 3 == a2)) || ((((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 340371 <= a29) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && !(4 == a2))) && 4 <= a2) && a0 + 147 <= 0)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && (\exists v_~a29~0_896 : int :: (v_~a29~0_896 % 299978 + 300022 <= a29 && 43 < v_~a29~0_896) && 0 <= v_~a29~0_896)) && 4 <= a2)) || (((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44) && a0 + 61 <= 0)) || ((((((a4 + 42 <= 0 && 0 <= a0 + 384412) && a0 + 147 <= 0) && a29 <= 43) && !(4 == a2)) && 0 <= a29 + 142) && 4 <= a2)) || ((((((0 < a29 + 16 && a0 + 147 <= 0) && a29 <= 43) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) && a4 + 42 <= 0) && 0 <= a0 + 384412) && 3 == a2)) || (((a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && 2 == a2) && !(6 == input))) || ((a0 <= 599970 && (a4 + 86 <= 0 && a2 <= 2) && 0 <= a29 + 142) && a29 + 16 <= 0)) || (0 <= a0 + 385464 && (((280404 <= a29 && a4 + 42 <= 0 && a0 + 149 <= 0) || (((a4 + 42 <= 0 && 0 <= a0 + 384412) && a0 + 149 <= 0) && 220362 <= a29)) || ((((((a0 + 149 <= 0 && a29 <= 42) && 4 == a2) && (0 < a29 + 16 || 0 < a4 + 86)) && a4 + 42 <= 0) && 0 <= a0 + 384412) && 0 <= a29 + 142)))) || ((((a4 + 86 <= 0 && !(4 == a2)) && 0 < a29 + 16) && a29 <= 43) && 4 <= a2)) || (((a0 <= 599970 && (((43131 <= a0 && 0 <= a29 + 599999) && ((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4))) || (((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4)) && 0 <= a29 + 142))) && 4 <= a2) && a29 + 16 <= 0)) || (((0 <= a0 + 599998 && 0 < a29 + 16) && a0 + 149 <= 0) && 2 == a2) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 174.8s, OverallIterations: 22, TraceHistogramMax: 12, AutomataDifference: 89.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 22.8s, HoareTripleCheckerStatistics: 4116 SDtfs, 27499 SDslu, 2443 SDs, 0 SdLazy, 105280 SolverSat, 6156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 70.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11492 GetRequests, 11253 SyntacticMatches, 37 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24286occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 51739 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 361 NumberOfFragments, 3777 HoareAnnotationTreeSize, 4 FomulaSimplifications, 1584268 FormulaSimplificationTreeSizeReduction, 4.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 420480 FormulaSimplificationTreeSizeReductionInter, 18.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 24.8s InterpolantComputationTime, 31495 NumberOfCodeBlocks, 31495 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 31461 ConstructedInterpolants, 499 QuantifiedInterpolants, 144611329 SizeOfPredicates, 12 NumberOfNonLiveVariables, 12971 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 34 InterpolantComputations, 16 PerfectInterpolantSequences, 66642/76098 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...