./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem17_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem17_label19.c -s /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/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 ae44815abe4c47f139211779a869862d37e7c620 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:28:22,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:28:22,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:28:22,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:28:22,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:28:22,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:28:22,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:28:22,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:28:22,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:28:22,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:28:22,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:28:22,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:28:22,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:28:22,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:28:22,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:28:22,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:28:22,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:28:22,268 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:28:22,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:28:22,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:28:22,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:28:22,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:28:22,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:28:22,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:28:22,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:28:22,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:28:22,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:28:22,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:28:22,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:28:22,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:28:22,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:28:22,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:28:22,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:28:22,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:28:22,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:28:22,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:28:22,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:28:22,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:28:22,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:28:22,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:28:22,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:28:22,301 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:28:22,326 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:28:22,326 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:28:22,327 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:28:22,327 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:28:22,327 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:28:22,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:28:22,328 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:28:22,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:28:22,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:28:22,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:28:22,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:28:22,329 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:28:22,329 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:28:22,329 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:28:22,329 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:28:22,329 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:28:22,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:28:22,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:28:22,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:28:22,330 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:28:22,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:28:22,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:28:22,331 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:28:22,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:28:22,331 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:28:22,331 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:28:22,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:28:22,332 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:28:22,332 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_41f7494b-0991-4529-909a-e0a8a7fa42e4/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 -> ae44815abe4c47f139211779a869862d37e7c620 [2019-11-15 21:28:22,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:28:22,383 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:28:22,386 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:28:22,387 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:28:22,388 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:28:22,388 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem17_label19.c [2019-11-15 21:28:22,470 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/bin/uautomizer/data/892a7ef58/8b90166ef13d49eabddee575ef8449b4/FLAG3975e14d1 [2019-11-15 21:28:23,079 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:28:23,080 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/sv-benchmarks/c/eca-rers2012/Problem17_label19.c [2019-11-15 21:28:23,121 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/bin/uautomizer/data/892a7ef58/8b90166ef13d49eabddee575ef8449b4/FLAG3975e14d1 [2019-11-15 21:28:23,280 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/bin/uautomizer/data/892a7ef58/8b90166ef13d49eabddee575ef8449b4 [2019-11-15 21:28:23,282 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:28:23,284 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:28:23,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:28:23,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:28:23,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:28:23,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:28:23" (1/1) ... [2019-11-15 21:28:23,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d80e170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:23, skipping insertion in model container [2019-11-15 21:28:23,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:28:23" (1/1) ... [2019-11-15 21:28:23,303 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:28:23,403 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:28:24,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:28:24,573 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:28:24,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:28:24,998 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:28:24,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:24 WrapperNode [2019-11-15 21:28:24,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:28:25,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:28:25,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:28:25,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:28:25,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:24" (1/1) ... [2019-11-15 21:28:25,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:24" (1/1) ... [2019-11-15 21:28:25,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:28:25,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:28:25,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:28:25,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:28:25,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:24" (1/1) ... [2019-11-15 21:28:25,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:24" (1/1) ... [2019-11-15 21:28:25,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:24" (1/1) ... [2019-11-15 21:28:25,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:24" (1/1) ... [2019-11-15 21:28:25,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:24" (1/1) ... [2019-11-15 21:28:25,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:24" (1/1) ... [2019-11-15 21:28:25,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:24" (1/1) ... [2019-11-15 21:28:25,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:28:25,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:28:25,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:28:25,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:28:25,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/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-15 21:28:25,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:28:25,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:28:29,959 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:28:29,960 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 21:28:29,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:28:29 BoogieIcfgContainer [2019-11-15 21:28:29,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:28:29,962 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:28:29,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:28:29,965 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:28:29,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:28:23" (1/3) ... [2019-11-15 21:28:29,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3439c94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:28:29, skipping insertion in model container [2019-11-15 21:28:29,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:28:24" (2/3) ... [2019-11-15 21:28:29,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3439c94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:28:29, skipping insertion in model container [2019-11-15 21:28:29,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:28:29" (3/3) ... [2019-11-15 21:28:29,968 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label19.c [2019-11-15 21:28:29,977 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:28:29,985 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:28:29,993 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:28:30,021 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:28:30,021 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:28:30,021 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:28:30,022 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:28:30,022 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:28:30,022 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:28:30,022 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:28:30,022 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:28:30,048 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states. [2019-11-15 21:28:30,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 21:28:30,055 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:30,056 INFO L380 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] [2019-11-15 21:28:30,057 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:30,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:30,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1824112922, now seen corresponding path program 1 times [2019-11-15 21:28:30,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:30,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508792252] [2019-11-15 21:28:30,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:30,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:30,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:30,289 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-15 21:28:30,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508792252] [2019-11-15 21:28:30,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:30,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:30,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421689924] [2019-11-15 21:28:30,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:28:30,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:30,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:28:30,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:28:30,310 INFO L87 Difference]: Start difference. First operand 590 states. Second operand 4 states. [2019-11-15 21:28:35,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:35,827 INFO L93 Difference]: Finished difference Result 2089 states and 3897 transitions. [2019-11-15 21:28:35,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:28:35,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-15 21:28:35,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:35,858 INFO L225 Difference]: With dead ends: 2089 [2019-11-15 21:28:35,859 INFO L226 Difference]: Without dead ends: 1419 [2019-11-15 21:28:35,865 INFO L600 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-15 21:28:35,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2019-11-15 21:28:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1412. [2019-11-15 21:28:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-11-15 21:28:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2069 transitions. [2019-11-15 21:28:35,970 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2069 transitions. Word has length 42 [2019-11-15 21:28:35,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:35,970 INFO L462 AbstractCegarLoop]: Abstraction has 1412 states and 2069 transitions. [2019-11-15 21:28:35,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:28:35,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2069 transitions. [2019-11-15 21:28:35,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-15 21:28:35,975 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:35,975 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:28:35,976 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:35,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:35,976 INFO L82 PathProgramCache]: Analyzing trace with hash 214146598, now seen corresponding path program 1 times [2019-11-15 21:28:35,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:35,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059579748] [2019-11-15 21:28:35,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:35,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:35,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:36,265 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:36,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059579748] [2019-11-15 21:28:36,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139781683] [2019-11-15 21:28:36,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/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-15 21:28:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:36,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:28:36,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:28:36,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:28:36,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:28:36,970 WARN L191 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2019-11-15 21:28:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:37,094 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:28:37,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-11-15 21:28:37,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377179113] [2019-11-15 21:28:37,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:28:37,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:37,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:28:37,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:28:37,097 INFO L87 Difference]: Start difference. First operand 1412 states and 2069 transitions. Second operand 4 states. [2019-11-15 21:28:44,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:44,215 INFO L93 Difference]: Finished difference Result 4589 states and 6895 transitions. [2019-11-15 21:28:44,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:28:44,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-11-15 21:28:44,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:44,237 INFO L225 Difference]: With dead ends: 4589 [2019-11-15 21:28:44,238 INFO L226 Difference]: Without dead ends: 3179 [2019-11-15 21:28:44,242 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:28:44,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-11-15 21:28:44,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 3175. [2019-11-15 21:28:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3175 states. [2019-11-15 21:28:44,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4562 transitions. [2019-11-15 21:28:44,315 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4562 transitions. Word has length 112 [2019-11-15 21:28:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:44,316 INFO L462 AbstractCegarLoop]: Abstraction has 3175 states and 4562 transitions. [2019-11-15 21:28:44,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:28:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4562 transitions. [2019-11-15 21:28:44,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-15 21:28:44,320 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:44,320 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:28:44,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:28:44,528 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:44,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:44,529 INFO L82 PathProgramCache]: Analyzing trace with hash 579168329, now seen corresponding path program 1 times [2019-11-15 21:28:44,529 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:44,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857523151] [2019-11-15 21:28:44,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:44,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:44,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:44,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857523151] [2019-11-15 21:28:44,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:44,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:28:44,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589534346] [2019-11-15 21:28:44,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:28:44,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:44,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:28:44,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:28:44,748 INFO L87 Difference]: Start difference. First operand 3175 states and 4562 transitions. Second operand 4 states. [2019-11-15 21:28:49,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:49,305 INFO L93 Difference]: Finished difference Result 11465 states and 16734 transitions. [2019-11-15 21:28:49,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:28:49,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-15 21:28:49,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:49,343 INFO L225 Difference]: With dead ends: 11465 [2019-11-15 21:28:49,343 INFO L226 Difference]: Without dead ends: 8292 [2019-11-15 21:28:49,349 INFO L600 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-15 21:28:49,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8292 states. [2019-11-15 21:28:49,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8292 to 8275. [2019-11-15 21:28:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8275 states. [2019-11-15 21:28:49,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8275 states to 8275 states and 10636 transitions. [2019-11-15 21:28:49,515 INFO L78 Accepts]: Start accepts. Automaton has 8275 states and 10636 transitions. Word has length 134 [2019-11-15 21:28:49,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:49,516 INFO L462 AbstractCegarLoop]: Abstraction has 8275 states and 10636 transitions. [2019-11-15 21:28:49,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:28:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 8275 states and 10636 transitions. [2019-11-15 21:28:49,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-15 21:28:49,530 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:49,531 INFO L380 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, 2, 2, 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] [2019-11-15 21:28:49,531 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:49,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:49,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1863909515, now seen corresponding path program 1 times [2019-11-15 21:28:49,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:49,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657630334] [2019-11-15 21:28:49,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:49,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:49,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:49,770 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 79 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:28:49,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657630334] [2019-11-15 21:28:49,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498487145] [2019-11-15 21:28:49,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/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-15 21:28:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:49,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:28:49,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:28:49,927 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-15 21:28:49,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:28:49,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2019-11-15 21:28:49,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669711877] [2019-11-15 21:28:49,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:28:49,930 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:49,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:28:49,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:28:49,931 INFO L87 Difference]: Start difference. First operand 8275 states and 10636 transitions. Second operand 3 states. [2019-11-15 21:28:56,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:28:56,407 INFO L93 Difference]: Finished difference Result 18688 states and 24630 transitions. [2019-11-15 21:28:56,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:28:56,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-11-15 21:28:56,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:28:56,447 INFO L225 Difference]: With dead ends: 18688 [2019-11-15 21:28:56,448 INFO L226 Difference]: Without dead ends: 10840 [2019-11-15 21:28:56,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:28:56,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10840 states. [2019-11-15 21:28:56,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10840 to 10838. [2019-11-15 21:28:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10838 states. [2019-11-15 21:28:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10838 states to 10838 states and 13664 transitions. [2019-11-15 21:28:56,672 INFO L78 Accepts]: Start accepts. Automaton has 10838 states and 13664 transitions. Word has length 177 [2019-11-15 21:28:56,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:28:56,673 INFO L462 AbstractCegarLoop]: Abstraction has 10838 states and 13664 transitions. [2019-11-15 21:28:56,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:28:56,673 INFO L276 IsEmpty]: Start isEmpty. Operand 10838 states and 13664 transitions. [2019-11-15 21:28:56,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-15 21:28:56,677 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:28:56,678 INFO L380 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:28:56,889 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:28:56,889 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:28:56,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:28:56,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1639068595, now seen corresponding path program 1 times [2019-11-15 21:28:56,892 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:28:56,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175546234] [2019-11-15 21:28:56,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:56,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:28:56,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:28:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:28:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-15 21:28:57,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175546234] [2019-11-15 21:28:57,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:28:57,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:28:57,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060432648] [2019-11-15 21:28:57,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:28:57,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:28:57,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:28:57,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:28:57,191 INFO L87 Difference]: Start difference. First operand 10838 states and 13664 transitions. Second operand 5 states. [2019-11-15 21:29:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:03,580 INFO L93 Difference]: Finished difference Result 38307 states and 48662 transitions. [2019-11-15 21:29:03,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:29:03,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2019-11-15 21:29:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:03,656 INFO L225 Difference]: With dead ends: 38307 [2019-11-15 21:29:03,657 INFO L226 Difference]: Without dead ends: 27896 [2019-11-15 21:29:03,670 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:29:03,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27896 states. [2019-11-15 21:29:03,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27896 to 20187. [2019-11-15 21:29:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20187 states. [2019-11-15 21:29:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20187 states to 20187 states and 24184 transitions. [2019-11-15 21:29:03,965 INFO L78 Accepts]: Start accepts. Automaton has 20187 states and 24184 transitions. Word has length 219 [2019-11-15 21:29:03,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:03,966 INFO L462 AbstractCegarLoop]: Abstraction has 20187 states and 24184 transitions. [2019-11-15 21:29:03,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:29:03,966 INFO L276 IsEmpty]: Start isEmpty. Operand 20187 states and 24184 transitions. [2019-11-15 21:29:03,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-11-15 21:29:03,972 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:03,973 INFO L380 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, 3, 3, 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, 1, 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-15 21:29:03,973 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:03,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:03,974 INFO L82 PathProgramCache]: Analyzing trace with hash 293167203, now seen corresponding path program 1 times [2019-11-15 21:29:03,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:03,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643588420] [2019-11-15 21:29:03,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:03,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:03,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 213 proven. 64 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-15 21:29:04,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643588420] [2019-11-15 21:29:04,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324724405] [2019-11-15 21:29:04,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/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-15 21:29:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:04,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:29:04,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:04,490 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-15 21:29:04,490 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:29:04,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-11-15 21:29:04,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157587676] [2019-11-15 21:29:04,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:29:04,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:04,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:04,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:29:04,492 INFO L87 Difference]: Start difference. First operand 20187 states and 24184 transitions. Second operand 3 states. [2019-11-15 21:29:06,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:06,762 INFO L93 Difference]: Finished difference Result 52699 states and 63905 transitions. [2019-11-15 21:29:06,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:06,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-11-15 21:29:06,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:06,826 INFO L225 Difference]: With dead ends: 52699 [2019-11-15 21:29:06,826 INFO L226 Difference]: Without dead ends: 29108 [2019-11-15 21:29:06,848 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 264 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-15 21:29:06,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29108 states. [2019-11-15 21:29:07,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29108 to 21024. [2019-11-15 21:29:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21024 states. [2019-11-15 21:29:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21024 states to 21024 states and 23944 transitions. [2019-11-15 21:29:07,104 INFO L78 Accepts]: Start accepts. Automaton has 21024 states and 23944 transitions. Word has length 265 [2019-11-15 21:29:07,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:07,104 INFO L462 AbstractCegarLoop]: Abstraction has 21024 states and 23944 transitions. [2019-11-15 21:29:07,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:07,104 INFO L276 IsEmpty]: Start isEmpty. Operand 21024 states and 23944 transitions. [2019-11-15 21:29:07,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-11-15 21:29:07,109 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:07,110 INFO L380 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, 3, 3, 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] [2019-11-15 21:29:07,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:29:07,314 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:07,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:07,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1882720223, now seen corresponding path program 1 times [2019-11-15 21:29:07,315 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:07,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916593060] [2019-11-15 21:29:07,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:07,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:07,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-15 21:29:07,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916593060] [2019-11-15 21:29:07,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:07,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:07,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332941628] [2019-11-15 21:29:07,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:29:07,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:07,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:07,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:07,464 INFO L87 Difference]: Start difference. First operand 21024 states and 23944 transitions. Second operand 3 states. [2019-11-15 21:29:09,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:09,645 INFO L93 Difference]: Finished difference Result 52247 states and 60153 transitions. [2019-11-15 21:29:09,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:09,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-11-15 21:29:09,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:09,682 INFO L225 Difference]: With dead ends: 52247 [2019-11-15 21:29:09,683 INFO L226 Difference]: Without dead ends: 31225 [2019-11-15 21:29:09,700 INFO L600 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-15 21:29:09,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31225 states. [2019-11-15 21:29:09,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31225 to 31225. [2019-11-15 21:29:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31225 states. [2019-11-15 21:29:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31225 states to 31225 states and 34792 transitions. [2019-11-15 21:29:10,015 INFO L78 Accepts]: Start accepts. Automaton has 31225 states and 34792 transitions. Word has length 278 [2019-11-15 21:29:10,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:10,015 INFO L462 AbstractCegarLoop]: Abstraction has 31225 states and 34792 transitions. [2019-11-15 21:29:10,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:10,016 INFO L276 IsEmpty]: Start isEmpty. Operand 31225 states and 34792 transitions. [2019-11-15 21:29:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-11-15 21:29:10,021 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:10,022 INFO L380 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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-15 21:29:10,022 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:10,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:10,022 INFO L82 PathProgramCache]: Analyzing trace with hash -582388829, now seen corresponding path program 1 times [2019-11-15 21:29:10,023 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:10,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428754282] [2019-11-15 21:29:10,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:10,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:10,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 227 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:10,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428754282] [2019-11-15 21:29:10,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039594872] [2019-11-15 21:29:10,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/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-15 21:29:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:10,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:29:10,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 222 proven. 82 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-15 21:29:10,664 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:29:10,664 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3] total 10 [2019-11-15 21:29:10,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784432738] [2019-11-15 21:29:10,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:29:10,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:10,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:29:10,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:29:10,667 INFO L87 Difference]: Start difference. First operand 31225 states and 34792 transitions. Second operand 10 states. [2019-11-15 21:29:25,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:25,496 INFO L93 Difference]: Finished difference Result 110612 states and 122769 transitions. [2019-11-15 21:29:25,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 21:29:25,497 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 302 [2019-11-15 21:29:25,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:25,587 INFO L225 Difference]: With dead ends: 110612 [2019-11-15 21:29:25,587 INFO L226 Difference]: Without dead ends: 75131 [2019-11-15 21:29:25,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-11-15 21:29:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75131 states. [2019-11-15 21:29:26,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75131 to 57201. [2019-11-15 21:29:26,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57201 states. [2019-11-15 21:29:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57201 states to 57201 states and 63330 transitions. [2019-11-15 21:29:26,192 INFO L78 Accepts]: Start accepts. Automaton has 57201 states and 63330 transitions. Word has length 302 [2019-11-15 21:29:26,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:26,192 INFO L462 AbstractCegarLoop]: Abstraction has 57201 states and 63330 transitions. [2019-11-15 21:29:26,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:29:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 57201 states and 63330 transitions. [2019-11-15 21:29:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2019-11-15 21:29:26,238 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:26,239 INFO L380 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:26,443 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:29:26,443 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:26,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:26,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1410443075, now seen corresponding path program 1 times [2019-11-15 21:29:26,444 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:26,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004862302] [2019-11-15 21:29:26,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:26,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:26,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 21:29:27,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004862302] [2019-11-15 21:29:27,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:27,432 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:27,432 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390808946] [2019-11-15 21:29:27,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:29:27,433 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:27,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:27,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:27,434 INFO L87 Difference]: Start difference. First operand 57201 states and 63330 transitions. Second operand 3 states. [2019-11-15 21:29:29,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:29,570 INFO L93 Difference]: Finished difference Result 113969 states and 126225 transitions. [2019-11-15 21:29:29,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:29,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 609 [2019-11-15 21:29:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:29,621 INFO L225 Difference]: With dead ends: 113969 [2019-11-15 21:29:29,621 INFO L226 Difference]: Without dead ends: 57195 [2019-11-15 21:29:29,646 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:29,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57195 states. [2019-11-15 21:29:30,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57195 to 56769. [2019-11-15 21:29:30,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56769 states. [2019-11-15 21:29:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56769 states to 56769 states and 62794 transitions. [2019-11-15 21:29:30,123 INFO L78 Accepts]: Start accepts. Automaton has 56769 states and 62794 transitions. Word has length 609 [2019-11-15 21:29:30,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:30,124 INFO L462 AbstractCegarLoop]: Abstraction has 56769 states and 62794 transitions. [2019-11-15 21:29:30,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:30,124 INFO L276 IsEmpty]: Start isEmpty. Operand 56769 states and 62794 transitions. [2019-11-15 21:29:30,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2019-11-15 21:29:30,145 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:30,145 INFO L380 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 21:29:30,146 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:30,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1172597637, now seen corresponding path program 1 times [2019-11-15 21:29:30,146 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:30,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392669907] [2019-11-15 21:29:30,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:30,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:30,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:30,539 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-11-15 21:29:30,539 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392669907] [2019-11-15 21:29:30,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:30,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:30,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125882704] [2019-11-15 21:29:30,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:29:30,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:30,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:30,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:30,541 INFO L87 Difference]: Start difference. First operand 56769 states and 62794 transitions. Second operand 3 states. [2019-11-15 21:29:33,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:33,925 INFO L93 Difference]: Finished difference Result 118640 states and 131216 transitions. [2019-11-15 21:29:33,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:33,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 628 [2019-11-15 21:29:33,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:33,985 INFO L225 Difference]: With dead ends: 118640 [2019-11-15 21:29:33,985 INFO L226 Difference]: Without dead ends: 61443 [2019-11-15 21:29:34,008 INFO L600 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-15 21:29:34,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61443 states. [2019-11-15 21:29:34,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61443 to 58888. [2019-11-15 21:29:34,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58888 states. [2019-11-15 21:29:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58888 states to 58888 states and 64260 transitions. [2019-11-15 21:29:34,503 INFO L78 Accepts]: Start accepts. Automaton has 58888 states and 64260 transitions. Word has length 628 [2019-11-15 21:29:34,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:34,503 INFO L462 AbstractCegarLoop]: Abstraction has 58888 states and 64260 transitions. [2019-11-15 21:29:34,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:34,503 INFO L276 IsEmpty]: Start isEmpty. Operand 58888 states and 64260 transitions. [2019-11-15 21:29:34,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2019-11-15 21:29:34,536 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:34,536 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:34,537 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:34,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:34,537 INFO L82 PathProgramCache]: Analyzing trace with hash 130534975, now seen corresponding path program 1 times [2019-11-15 21:29:34,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:34,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913766907] [2019-11-15 21:29:34,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:34,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:34,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1303 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-11-15 21:29:35,034 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913766907] [2019-11-15 21:29:35,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:35,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:35,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216015824] [2019-11-15 21:29:35,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:29:35,035 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:35,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:35,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:35,036 INFO L87 Difference]: Start difference. First operand 58888 states and 64260 transitions. Second operand 3 states. [2019-11-15 21:29:37,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:37,234 INFO L93 Difference]: Finished difference Result 121179 states and 132324 transitions. [2019-11-15 21:29:37,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:37,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 704 [2019-11-15 21:29:37,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:37,309 INFO L225 Difference]: With dead ends: 121179 [2019-11-15 21:29:37,309 INFO L226 Difference]: Without dead ends: 61860 [2019-11-15 21:29:37,335 INFO L600 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-15 21:29:37,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61860 states. [2019-11-15 21:29:38,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61860 to 60580. [2019-11-15 21:29:38,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60580 states. [2019-11-15 21:29:38,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60580 states to 60580 states and 65557 transitions. [2019-11-15 21:29:38,245 INFO L78 Accepts]: Start accepts. Automaton has 60580 states and 65557 transitions. Word has length 704 [2019-11-15 21:29:38,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:38,245 INFO L462 AbstractCegarLoop]: Abstraction has 60580 states and 65557 transitions. [2019-11-15 21:29:38,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 60580 states and 65557 transitions. [2019-11-15 21:29:38,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2019-11-15 21:29:38,266 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:38,266 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 21:29:38,267 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:38,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:38,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1200477907, now seen corresponding path program 1 times [2019-11-15 21:29:38,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:38,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257490992] [2019-11-15 21:29:38,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:38,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:38,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 1044 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-11-15 21:29:38,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257490992] [2019-11-15 21:29:38,879 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:38,879 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:38,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702237924] [2019-11-15 21:29:38,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:29:38,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:38,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:38,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:38,883 INFO L87 Difference]: Start difference. First operand 60580 states and 65557 transitions. Second operand 3 states. [2019-11-15 21:29:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:40,928 INFO L93 Difference]: Finished difference Result 125829 states and 136113 transitions. [2019-11-15 21:29:40,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:40,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 736 [2019-11-15 21:29:40,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:40,978 INFO L225 Difference]: With dead ends: 125829 [2019-11-15 21:29:40,978 INFO L226 Difference]: Without dead ends: 65676 [2019-11-15 21:29:40,998 INFO L600 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-15 21:29:41,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65676 states. [2019-11-15 21:29:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65676 to 56742. [2019-11-15 21:29:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56742 states. [2019-11-15 21:29:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56742 states to 56742 states and 61163 transitions. [2019-11-15 21:29:41,500 INFO L78 Accepts]: Start accepts. Automaton has 56742 states and 61163 transitions. Word has length 736 [2019-11-15 21:29:41,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:41,501 INFO L462 AbstractCegarLoop]: Abstraction has 56742 states and 61163 transitions. [2019-11-15 21:29:41,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:29:41,501 INFO L276 IsEmpty]: Start isEmpty. Operand 56742 states and 61163 transitions. [2019-11-15 21:29:41,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 799 [2019-11-15 21:29:41,529 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:41,530 INFO L380 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:41,530 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:41,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:41,531 INFO L82 PathProgramCache]: Analyzing trace with hash 756007935, now seen corresponding path program 1 times [2019-11-15 21:29:41,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:41,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822465515] [2019-11-15 21:29:41,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:41,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:41,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:43,885 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 44 proven. 474 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-11-15 21:29:43,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822465515] [2019-11-15 21:29:43,886 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86265521] [2019-11-15 21:29:43,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/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-15 21:29:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:44,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 21:29:44,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:44,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-15 21:29:44,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:29:44,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 21:29:44,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 21:29:44,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:29:44,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:29:44,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:29:44,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:29:44,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:29:44,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:29:45,500 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 440 proven. 235 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-15 21:29:45,500 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:29:45,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2019-11-15 21:29:45,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004404747] [2019-11-15 21:29:45,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 21:29:45,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:45,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:29:45,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:29:45,503 INFO L87 Difference]: Start difference. First operand 56742 states and 61163 transitions. Second operand 11 states. [2019-11-15 21:29:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:56,912 INFO L93 Difference]: Finished difference Result 137222 states and 147166 transitions. [2019-11-15 21:29:56,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 21:29:56,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 798 [2019-11-15 21:29:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:29:56,999 INFO L225 Difference]: With dead ends: 137222 [2019-11-15 21:29:57,000 INFO L226 Difference]: Without dead ends: 80049 [2019-11-15 21:29:57,536 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 837 GetRequests, 809 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=227, Invalid=423, Unknown=0, NotChecked=0, Total=650 [2019-11-15 21:29:57,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80049 states. [2019-11-15 21:29:58,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80049 to 65625. [2019-11-15 21:29:58,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65625 states. [2019-11-15 21:29:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65625 states to 65625 states and 69039 transitions. [2019-11-15 21:29:58,103 INFO L78 Accepts]: Start accepts. Automaton has 65625 states and 69039 transitions. Word has length 798 [2019-11-15 21:29:58,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:29:58,103 INFO L462 AbstractCegarLoop]: Abstraction has 65625 states and 69039 transitions. [2019-11-15 21:29:58,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 21:29:58,103 INFO L276 IsEmpty]: Start isEmpty. Operand 65625 states and 69039 transitions. [2019-11-15 21:29:58,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 962 [2019-11-15 21:29:58,142 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:29:58,143 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 21:29:58,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:29:58,347 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:29:58,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:58,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1475185063, now seen corresponding path program 1 times [2019-11-15 21:29:58,347 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:58,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055701987] [2019-11-15 21:29:58,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:58,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:58,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 692 proven. 385 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-11-15 21:30:00,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055701987] [2019-11-15 21:30:00,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539859323] [2019-11-15 21:30:00,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/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-15 21:30:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:00,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 1140 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:30:00,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:30:02,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 1077 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-11-15 21:30:02,046 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:30:02,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-11-15 21:30:02,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979962118] [2019-11-15 21:30:02,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:30:02,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:02,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:30:02,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:30:02,048 INFO L87 Difference]: Start difference. First operand 65625 states and 69039 transitions. Second operand 4 states. [2019-11-15 21:30:05,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:05,353 INFO L93 Difference]: Finished difference Result 159344 states and 167514 transitions. [2019-11-15 21:30:05,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:30:05,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 961 [2019-11-15 21:30:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:30:05,428 INFO L225 Difference]: With dead ends: 159344 [2019-11-15 21:30:05,428 INFO L226 Difference]: Without dead ends: 93721 [2019-11-15 21:30:05,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 967 GetRequests, 960 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:30:05,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93721 states. [2019-11-15 21:30:06,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93721 to 72436. [2019-11-15 21:30:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72436 states. [2019-11-15 21:30:06,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72436 states to 72436 states and 76073 transitions. [2019-11-15 21:30:06,167 INFO L78 Accepts]: Start accepts. Automaton has 72436 states and 76073 transitions. Word has length 961 [2019-11-15 21:30:06,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:30:06,167 INFO L462 AbstractCegarLoop]: Abstraction has 72436 states and 76073 transitions. [2019-11-15 21:30:06,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:30:06,168 INFO L276 IsEmpty]: Start isEmpty. Operand 72436 states and 76073 transitions. [2019-11-15 21:30:06,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 967 [2019-11-15 21:30:06,195 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:30:06,196 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 21:30:06,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:30:06,396 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:30:06,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:06,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1803371503, now seen corresponding path program 1 times [2019-11-15 21:30:06,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:06,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684398821] [2019-11-15 21:30:06,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:06,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:06,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 1057 proven. 30 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-11-15 21:30:07,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684398821] [2019-11-15 21:30:07,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809024522] [2019-11-15 21:30:07,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/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-15 21:30:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:08,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:30:08,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:30:08,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:30:08,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:30:08,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:30:10,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 732 proven. 355 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-11-15 21:30:10,237 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:30:10,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-11-15 21:30:10,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424225178] [2019-11-15 21:30:10,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:30:10,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:10,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:30:10,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:30:10,240 INFO L87 Difference]: Start difference. First operand 72436 states and 76073 transitions. Second operand 9 states. [2019-11-15 21:30:21,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:21,173 INFO L93 Difference]: Finished difference Result 172975 states and 181599 transitions. [2019-11-15 21:30:21,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:30:21,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 966 [2019-11-15 21:30:21,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:30:21,273 INFO L225 Difference]: With dead ends: 172975 [2019-11-15 21:30:21,273 INFO L226 Difference]: Without dead ends: 100966 [2019-11-15 21:30:21,306 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 977 GetRequests, 967 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:30:21,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100966 states. [2019-11-15 21:30:21,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100966 to 75844. [2019-11-15 21:30:21,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75844 states. [2019-11-15 21:30:22,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75844 states to 75844 states and 79516 transitions. [2019-11-15 21:30:22,054 INFO L78 Accepts]: Start accepts. Automaton has 75844 states and 79516 transitions. Word has length 966 [2019-11-15 21:30:22,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:30:22,055 INFO L462 AbstractCegarLoop]: Abstraction has 75844 states and 79516 transitions. [2019-11-15 21:30:22,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:30:22,055 INFO L276 IsEmpty]: Start isEmpty. Operand 75844 states and 79516 transitions. [2019-11-15 21:30:22,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1019 [2019-11-15 21:30:22,083 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:30:22,084 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:30:22,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:30:22,284 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:30:22,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:22,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1739013628, now seen corresponding path program 1 times [2019-11-15 21:30:22,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:22,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341788715] [2019-11-15 21:30:22,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:22,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:22,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:25,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 802 proven. 385 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-11-15 21:30:25,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341788715] [2019-11-15 21:30:25,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509642060] [2019-11-15 21:30:25,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/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-15 21:30:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:25,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:30:25,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:30:25,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:30:25,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:30:30,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 1187 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-11-15 21:30:30,994 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:30:30,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2019-11-15 21:30:30,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643483791] [2019-11-15 21:30:30,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:30:30,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:30,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:30:30,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:30:30,997 INFO L87 Difference]: Start difference. First operand 75844 states and 79516 transitions. Second operand 6 states. [2019-11-15 21:30:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:37,474 INFO L93 Difference]: Finished difference Result 160624 states and 168205 transitions. [2019-11-15 21:30:37,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:30:37,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1018 [2019-11-15 21:30:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:30:37,541 INFO L225 Difference]: With dead ends: 160624 [2019-11-15 21:30:37,541 INFO L226 Difference]: Without dead ends: 85207 [2019-11-15 21:30:37,572 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1025 GetRequests, 1015 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:30:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85207 states. [2019-11-15 21:30:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85207 to 78821. [2019-11-15 21:30:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78821 states. [2019-11-15 21:30:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78821 states to 78821 states and 82584 transitions. [2019-11-15 21:30:38,264 INFO L78 Accepts]: Start accepts. Automaton has 78821 states and 82584 transitions. Word has length 1018 [2019-11-15 21:30:38,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:30:38,264 INFO L462 AbstractCegarLoop]: Abstraction has 78821 states and 82584 transitions. [2019-11-15 21:30:38,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:30:38,264 INFO L276 IsEmpty]: Start isEmpty. Operand 78821 states and 82584 transitions. [2019-11-15 21:30:38,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1034 [2019-11-15 21:30:38,293 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:30:38,293 INFO L380 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:30:38,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:30:38,494 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:30:38,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:38,494 INFO L82 PathProgramCache]: Analyzing trace with hash 829003154, now seen corresponding path program 1 times [2019-11-15 21:30:38,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:38,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722602008] [2019-11-15 21:30:38,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:38,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:38,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:39,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 871 trivial. 0 not checked. [2019-11-15 21:30:39,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722602008] [2019-11-15 21:30:39,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:39,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:30:39,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028208684] [2019-11-15 21:30:39,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:30:39,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:39,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:39,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:39,413 INFO L87 Difference]: Start difference. First operand 78821 states and 82584 transitions. Second operand 3 states. [2019-11-15 21:30:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:41,208 INFO L93 Difference]: Finished difference Result 160181 states and 167770 transitions. [2019-11-15 21:30:41,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:41,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1033 [2019-11-15 21:30:41,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:30:41,272 INFO L225 Difference]: With dead ends: 160181 [2019-11-15 21:30:41,273 INFO L226 Difference]: Without dead ends: 82635 [2019-11-15 21:30:41,301 INFO L600 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-15 21:30:41,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82635 states. [2019-11-15 21:30:41,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82635 to 74113. [2019-11-15 21:30:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74113 states. [2019-11-15 21:30:41,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74113 states to 74113 states and 77597 transitions. [2019-11-15 21:30:41,969 INFO L78 Accepts]: Start accepts. Automaton has 74113 states and 77597 transitions. Word has length 1033 [2019-11-15 21:30:41,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:30:41,970 INFO L462 AbstractCegarLoop]: Abstraction has 74113 states and 77597 transitions. [2019-11-15 21:30:41,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:30:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 74113 states and 77597 transitions. [2019-11-15 21:30:42,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1265 [2019-11-15 21:30:42,015 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:30:42,016 INFO L380 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:30:42,016 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:30:42,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:42,017 INFO L82 PathProgramCache]: Analyzing trace with hash 19008312, now seen corresponding path program 1 times [2019-11-15 21:30:42,017 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:42,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671364296] [2019-11-15 21:30:42,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:42,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:42,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2382 backedges. 1250 proven. 0 refuted. 0 times theorem prover too weak. 1132 trivial. 0 not checked. [2019-11-15 21:30:43,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671364296] [2019-11-15 21:30:43,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:43,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:30:43,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408346411] [2019-11-15 21:30:43,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:30:43,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:43,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:30:43,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:30:43,078 INFO L87 Difference]: Start difference. First operand 74113 states and 77597 transitions. Second operand 3 states. [2019-11-15 21:30:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:45,151 INFO L93 Difference]: Finished difference Result 149502 states and 156614 transitions. [2019-11-15 21:30:45,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:30:45,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1264 [2019-11-15 21:30:45,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:30:45,214 INFO L225 Difference]: With dead ends: 149502 [2019-11-15 21:30:45,214 INFO L226 Difference]: Without dead ends: 76666 [2019-11-15 21:30:45,242 INFO L600 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-15 21:30:45,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76666 states. [2019-11-15 21:30:45,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76666 to 75387. [2019-11-15 21:30:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75387 states. [2019-11-15 21:30:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75387 states to 75387 states and 78808 transitions. [2019-11-15 21:30:45,882 INFO L78 Accepts]: Start accepts. Automaton has 75387 states and 78808 transitions. Word has length 1264 [2019-11-15 21:30:45,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:30:45,883 INFO L462 AbstractCegarLoop]: Abstraction has 75387 states and 78808 transitions. [2019-11-15 21:30:45,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:30:45,883 INFO L276 IsEmpty]: Start isEmpty. Operand 75387 states and 78808 transitions. [2019-11-15 21:30:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1295 [2019-11-15 21:30:45,927 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:30:45,928 INFO L380 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, 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, 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, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:30:45,928 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:30:45,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:45,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1801826477, now seen corresponding path program 1 times [2019-11-15 21:30:45,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:45,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902376243] [2019-11-15 21:30:45,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:45,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:45,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 1333 proven. 826 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-15 21:30:49,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902376243] [2019-11-15 21:30:49,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848435128] [2019-11-15 21:30:49,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/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-15 21:30:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:49,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 1497 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:30:49,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:30:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 1081 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-11-15 21:30:50,406 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:30:50,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2019-11-15 21:30:50,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824522293] [2019-11-15 21:30:50,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:30:50,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:50,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:30:50,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:30:50,408 INFO L87 Difference]: Start difference. First operand 75387 states and 78808 transitions. Second operand 5 states. [2019-11-15 21:30:54,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:54,245 INFO L93 Difference]: Finished difference Result 163528 states and 170805 transitions. [2019-11-15 21:30:54,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:30:54,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1294 [2019-11-15 21:30:54,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:30:54,320 INFO L225 Difference]: With dead ends: 163528 [2019-11-15 21:30:54,320 INFO L226 Difference]: Without dead ends: 88141 [2019-11-15 21:30:54,349 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1307 GetRequests, 1292 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:30:54,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88141 states. [2019-11-15 21:30:55,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88141 to 73250. [2019-11-15 21:30:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73250 states. [2019-11-15 21:30:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73250 states to 73250 states and 76093 transitions. [2019-11-15 21:30:55,076 INFO L78 Accepts]: Start accepts. Automaton has 73250 states and 76093 transitions. Word has length 1294 [2019-11-15 21:30:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:30:55,077 INFO L462 AbstractCegarLoop]: Abstraction has 73250 states and 76093 transitions. [2019-11-15 21:30:55,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:30:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 73250 states and 76093 transitions. [2019-11-15 21:30:55,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1422 [2019-11-15 21:30:55,123 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:30:55,123 INFO L380 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:30:55,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:30:55,326 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:30:55,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:55,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1039281333, now seen corresponding path program 1 times [2019-11-15 21:30:55,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:55,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483391162] [2019-11-15 21:30:55,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:55,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:55,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:58,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3038 backedges. 2491 proven. 0 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2019-11-15 21:30:58,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483391162] [2019-11-15 21:30:58,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:58,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:30:58,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045651810] [2019-11-15 21:30:58,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:30:58,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:58,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:30:58,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:30:58,088 INFO L87 Difference]: Start difference. First operand 73250 states and 76093 transitions. Second operand 6 states. [2019-11-15 21:31:03,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:03,374 INFO L93 Difference]: Finished difference Result 156294 states and 162268 transitions. [2019-11-15 21:31:03,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:31:03,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1421 [2019-11-15 21:31:03,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:03,437 INFO L225 Difference]: With dead ends: 156294 [2019-11-15 21:31:03,437 INFO L226 Difference]: Without dead ends: 83044 [2019-11-15 21:31:03,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:31:03,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83044 states. [2019-11-15 21:31:04,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83044 to 69409. [2019-11-15 21:31:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69409 states. [2019-11-15 21:31:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69409 states to 69409 states and 72032 transitions. [2019-11-15 21:31:04,117 INFO L78 Accepts]: Start accepts. Automaton has 69409 states and 72032 transitions. Word has length 1421 [2019-11-15 21:31:04,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:04,118 INFO L462 AbstractCegarLoop]: Abstraction has 69409 states and 72032 transitions. [2019-11-15 21:31:04,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:31:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 69409 states and 72032 transitions. [2019-11-15 21:31:04,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1561 [2019-11-15 21:31:04,164 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:04,164 INFO L380 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:04,165 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:31:04,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:04,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1425848221, now seen corresponding path program 1 times [2019-11-15 21:31:04,165 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:04,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141093625] [2019-11-15 21:31:04,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:04,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:04,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:06,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2896 backedges. 2136 proven. 36 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2019-11-15 21:31:06,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141093625] [2019-11-15 21:31:06,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822850098] [2019-11-15 21:31:06,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/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-15 21:31:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:06,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 1780 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:31:06,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:31:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2896 backedges. 2158 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2019-11-15 21:31:10,725 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:31:10,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-11-15 21:31:10,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317854074] [2019-11-15 21:31:10,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:31:10,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:10,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:31:10,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:31:10,727 INFO L87 Difference]: Start difference. First operand 69409 states and 72032 transitions. Second operand 4 states. [2019-11-15 21:31:38,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:31:38,824 INFO L93 Difference]: Finished difference Result 163078 states and 169252 transitions. [2019-11-15 21:31:38,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:31:38,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1560 [2019-11-15 21:31:38,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:31:38,892 INFO L225 Difference]: With dead ends: 163078 [2019-11-15 21:31:38,892 INFO L226 Difference]: Without dead ends: 94946 [2019-11-15 21:31:38,915 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1567 GetRequests, 1559 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:31:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94946 states. [2019-11-15 21:31:39,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94946 to 81751. [2019-11-15 21:31:39,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81751 states. [2019-11-15 21:31:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81751 states to 81751 states and 84763 transitions. [2019-11-15 21:31:39,626 INFO L78 Accepts]: Start accepts. Automaton has 81751 states and 84763 transitions. Word has length 1560 [2019-11-15 21:31:39,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:31:39,627 INFO L462 AbstractCegarLoop]: Abstraction has 81751 states and 84763 transitions. [2019-11-15 21:31:39,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:31:39,627 INFO L276 IsEmpty]: Start isEmpty. Operand 81751 states and 84763 transitions. [2019-11-15 21:31:39,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1579 [2019-11-15 21:31:39,673 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:31:39,674 INFO L380 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:31:39,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:31:39,875 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:31:39,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:31:39,875 INFO L82 PathProgramCache]: Analyzing trace with hash -605926517, now seen corresponding path program 1 times [2019-11-15 21:31:39,875 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:31:39,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376000494] [2019-11-15 21:31:39,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:39,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:31:39,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:31:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3108 backedges. 1855 proven. 1171 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-15 21:31:43,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376000494] [2019-11-15 21:31:43,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227292158] [2019-11-15 21:31:43,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/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-15 21:31:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:31:44,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 1795 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:31:44,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:31:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3108 backedges. 2488 proven. 0 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2019-11-15 21:31:48,301 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:31:48,302 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-11-15 21:31:48,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536745923] [2019-11-15 21:31:48,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:31:48,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:48,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:31:48,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:31:48,304 INFO L87 Difference]: Start difference. First operand 81751 states and 84763 transitions. Second operand 5 states. [2019-11-15 21:32:01,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:32:01,162 INFO L93 Difference]: Finished difference Result 183070 states and 189690 transitions. [2019-11-15 21:32:01,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:32:01,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1578 [2019-11-15 21:32:01,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:32:01,246 INFO L225 Difference]: With dead ends: 183070 [2019-11-15 21:32:01,246 INFO L226 Difference]: Without dead ends: 102596 [2019-11-15 21:32:01,276 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1588 GetRequests, 1576 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:32:01,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102596 states. [2019-11-15 21:32:01,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102596 to 91094. [2019-11-15 21:32:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91094 states. [2019-11-15 21:32:02,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91094 states to 91094 states and 94082 transitions. [2019-11-15 21:32:02,415 INFO L78 Accepts]: Start accepts. Automaton has 91094 states and 94082 transitions. Word has length 1578 [2019-11-15 21:32:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:32:02,416 INFO L462 AbstractCegarLoop]: Abstraction has 91094 states and 94082 transitions. [2019-11-15 21:32:02,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:32:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 91094 states and 94082 transitions. [2019-11-15 21:32:02,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1608 [2019-11-15 21:32:02,465 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:32:02,467 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 21:32:02,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:32:02,671 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:32:02,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:32:02,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1431347478, now seen corresponding path program 1 times [2019-11-15 21:32:02,671 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:32:02,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660544614] [2019-11-15 21:32:02,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:32:02,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:32:02,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:32:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:32:05,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4099 backedges. 3197 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2019-11-15 21:32:05,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660544614] [2019-11-15 21:32:05,410 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:32:05,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:32:05,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931640038] [2019-11-15 21:32:05,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:32:05,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:32:05,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:32:05,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:32:05,411 INFO L87 Difference]: Start difference. First operand 91094 states and 94082 transitions. Second operand 7 states. [2019-11-15 21:32:10,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:32:10,473 INFO L93 Difference]: Finished difference Result 186876 states and 192864 transitions. [2019-11-15 21:32:10,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:32:10,473 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1607 [2019-11-15 21:32:10,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:32:10,549 INFO L225 Difference]: With dead ends: 186876 [2019-11-15 21:32:10,549 INFO L226 Difference]: Without dead ends: 97059 [2019-11-15 21:32:10,578 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:32:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97059 states. [2019-11-15 21:32:11,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97059 to 87688. [2019-11-15 21:32:11,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87688 states. [2019-11-15 21:32:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87688 states to 87688 states and 90295 transitions. [2019-11-15 21:32:11,416 INFO L78 Accepts]: Start accepts. Automaton has 87688 states and 90295 transitions. Word has length 1607 [2019-11-15 21:32:11,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:32:11,417 INFO L462 AbstractCegarLoop]: Abstraction has 87688 states and 90295 transitions. [2019-11-15 21:32:11,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:32:11,417 INFO L276 IsEmpty]: Start isEmpty. Operand 87688 states and 90295 transitions. [2019-11-15 21:32:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1666 [2019-11-15 21:32:11,473 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:32:11,474 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:32:11,474 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:32:11,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:32:11,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1151993617, now seen corresponding path program 1 times [2019-11-15 21:32:11,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:32:11,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634987388] [2019-11-15 21:32:11,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:32:11,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:32:11,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:32:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:32:16,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 1696 proven. 2320 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-15 21:32:16,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634987388] [2019-11-15 21:32:16,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096524670] [2019-11-15 21:32:16,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/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-15 21:32:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:32:17,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 1925 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:32:17,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:32:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 2196 proven. 0 refuted. 0 times theorem prover too weak. 1902 trivial. 0 not checked. [2019-11-15 21:32:18,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:32:18,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 15 [2019-11-15 21:32:18,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394579746] [2019-11-15 21:32:18,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:32:18,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:32:18,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:32:18,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:32:18,426 INFO L87 Difference]: Start difference. First operand 87688 states and 90295 transitions. Second operand 3 states. [2019-11-15 21:32:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:32:20,198 INFO L93 Difference]: Finished difference Result 174099 states and 179278 transitions. [2019-11-15 21:32:20,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:32:20,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1665 [2019-11-15 21:32:20,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:32:20,263 INFO L225 Difference]: With dead ends: 174099 [2019-11-15 21:32:20,263 INFO L226 Difference]: Without dead ends: 87688 [2019-11-15 21:32:20,292 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1678 GetRequests, 1665 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:32:20,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87688 states. [2019-11-15 21:32:20,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87688 to 83004. [2019-11-15 21:32:20,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83004 states. [2019-11-15 21:32:21,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83004 states to 83004 states and 85515 transitions. [2019-11-15 21:32:21,051 INFO L78 Accepts]: Start accepts. Automaton has 83004 states and 85515 transitions. Word has length 1665 [2019-11-15 21:32:21,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:32:21,052 INFO L462 AbstractCegarLoop]: Abstraction has 83004 states and 85515 transitions. [2019-11-15 21:32:21,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:32:21,052 INFO L276 IsEmpty]: Start isEmpty. Operand 83004 states and 85515 transitions. [2019-11-15 21:32:21,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1952 [2019-11-15 21:32:21,109 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:32:21,110 INFO L380 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, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 21:32:21,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:32:21,311 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:32:21,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:32:21,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1757327394, now seen corresponding path program 1 times [2019-11-15 21:32:21,311 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:32:21,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299246069] [2019-11-15 21:32:21,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:32:21,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:32:21,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:32:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:32:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 5097 backedges. 3923 proven. 90 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2019-11-15 21:32:26,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299246069] [2019-11-15 21:32:26,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667275623] [2019-11-15 21:32:26,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:32:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:32:27,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 2241 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:32:27,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:32:27,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:27,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5097 backedges. 4013 proven. 0 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2019-11-15 21:32:30,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:32:30,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2019-11-15 21:32:30,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898646148] [2019-11-15 21:32:30,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:32:30,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:32:30,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:32:30,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:32:30,869 INFO L87 Difference]: Start difference. First operand 83004 states and 85515 transitions. Second operand 6 states. [2019-11-15 21:32:35,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:32:35,011 INFO L93 Difference]: Finished difference Result 185589 states and 191266 transitions. [2019-11-15 21:32:35,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:32:35,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1951 [2019-11-15 21:32:35,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:32:35,102 INFO L225 Difference]: With dead ends: 185589 [2019-11-15 21:32:35,102 INFO L226 Difference]: Without dead ends: 103437 [2019-11-15 21:32:35,130 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1957 GetRequests, 1951 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:32:35,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103437 states. [2019-11-15 21:32:35,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103437 to 87264. [2019-11-15 21:32:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87264 states. [2019-11-15 21:32:35,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87264 states to 87264 states and 89914 transitions. [2019-11-15 21:32:35,981 INFO L78 Accepts]: Start accepts. Automaton has 87264 states and 89914 transitions. Word has length 1951 [2019-11-15 21:32:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:32:35,982 INFO L462 AbstractCegarLoop]: Abstraction has 87264 states and 89914 transitions. [2019-11-15 21:32:35,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:32:35,982 INFO L276 IsEmpty]: Start isEmpty. Operand 87264 states and 89914 transitions. [2019-11-15 21:32:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2056 [2019-11-15 21:32:36,043 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:32:36,044 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 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] [2019-11-15 21:32:36,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:32:36,244 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:32:36,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:32:36,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1859421298, now seen corresponding path program 1 times [2019-11-15 21:32:36,245 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:32:36,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804304845] [2019-11-15 21:32:36,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:32:36,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:32:36,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:32:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:32:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5683 backedges. 2660 proven. 2341 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2019-11-15 21:32:41,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804304845] [2019-11-15 21:32:41,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325367683] [2019-11-15 21:32:41,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:32:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:32:42,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 2332 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:32:42,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:32:42,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:32:42,653 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 27 [2019-11-15 21:32:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5683 backedges. 3897 proven. 0 refuted. 0 times theorem prover too weak. 1786 trivial. 0 not checked. [2019-11-15 21:32:49,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:32:49,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2019-11-15 21:32:49,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485379349] [2019-11-15 21:32:49,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:32:49,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:32:49,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:32:49,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:32:49,948 INFO L87 Difference]: Start difference. First operand 87264 states and 89914 transitions. Second operand 4 states. [2019-11-15 21:32:54,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:32:54,550 INFO L93 Difference]: Finished difference Result 180489 states and 185985 transitions. [2019-11-15 21:32:54,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:32:54,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2055 [2019-11-15 21:32:54,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:32:54,635 INFO L225 Difference]: With dead ends: 180489 [2019-11-15 21:32:54,635 INFO L226 Difference]: Without dead ends: 94502 [2019-11-15 21:32:54,669 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2066 GetRequests, 2054 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:32:54,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94502 states. [2019-11-15 21:32:55,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94502 to 90239. [2019-11-15 21:32:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90239 states. [2019-11-15 21:32:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90239 states to 90239 states and 92991 transitions. [2019-11-15 21:32:55,586 INFO L78 Accepts]: Start accepts. Automaton has 90239 states and 92991 transitions. Word has length 2055 [2019-11-15 21:32:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:32:55,588 INFO L462 AbstractCegarLoop]: Abstraction has 90239 states and 92991 transitions. [2019-11-15 21:32:55,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:32:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 90239 states and 92991 transitions. [2019-11-15 21:32:55,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2304 [2019-11-15 21:32:55,661 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:32:55,662 INFO L380 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, 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, 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, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:32:55,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:32:55,862 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:32:55,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:32:55,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1712623548, now seen corresponding path program 1 times [2019-11-15 21:32:55,863 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:32:55,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290279620] [2019-11-15 21:32:55,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:32:55,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:32:55,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:32:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 7352 backedges. 2563 proven. 4422 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-15 21:33:05,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290279620] [2019-11-15 21:33:05,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708678844] [2019-11-15 21:33:05,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:06,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 2602 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:33:06,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:33:06,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:06,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:14,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7352 backedges. 5388 proven. 0 refuted. 0 times theorem prover too weak. 1964 trivial. 0 not checked. [2019-11-15 21:33:14,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:33:14,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2019-11-15 21:33:14,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157146913] [2019-11-15 21:33:14,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:33:14,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:14,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:33:14,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:33:14,692 INFO L87 Difference]: Start difference. First operand 90239 states and 92991 transitions. Second operand 5 states. [2019-11-15 21:33:23,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:23,963 INFO L93 Difference]: Finished difference Result 212416 states and 219064 transitions. [2019-11-15 21:33:23,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:33:23,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 2303 [2019-11-15 21:33:23,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:24,067 INFO L225 Difference]: With dead ends: 212416 [2019-11-15 21:33:24,067 INFO L226 Difference]: Without dead ends: 123454 [2019-11-15 21:33:24,090 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2317 GetRequests, 2301 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:33:24,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123454 states. [2019-11-15 21:33:25,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123454 to 114939. [2019-11-15 21:33:25,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114939 states. [2019-11-15 21:33:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114939 states to 114939 states and 118404 transitions. [2019-11-15 21:33:25,278 INFO L78 Accepts]: Start accepts. Automaton has 114939 states and 118404 transitions. Word has length 2303 [2019-11-15 21:33:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:25,279 INFO L462 AbstractCegarLoop]: Abstraction has 114939 states and 118404 transitions. [2019-11-15 21:33:25,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:33:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 114939 states and 118404 transitions. [2019-11-15 21:33:25,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2547 [2019-11-15 21:33:25,384 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:25,386 INFO L380 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, 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, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:33:25,586 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:25,586 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:33:25,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:25,587 INFO L82 PathProgramCache]: Analyzing trace with hash -772799974, now seen corresponding path program 1 times [2019-11-15 21:33:25,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:25,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459091494] [2019-11-15 21:33:25,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:25,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:25,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9147 backedges. 3027 proven. 5753 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-15 21:33:37,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459091494] [2019-11-15 21:33:37,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864254691] [2019-11-15 21:33:37,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:38,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 2868 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:33:38,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:33:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9147 backedges. 7057 proven. 0 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2019-11-15 21:33:45,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:33:45,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 17 [2019-11-15 21:33:45,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841627504] [2019-11-15 21:33:45,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:33:45,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:45,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:33:45,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:33:45,269 INFO L87 Difference]: Start difference. First operand 114939 states and 118404 transitions. Second operand 4 states. [2019-11-15 21:33:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:56,238 INFO L93 Difference]: Finished difference Result 268191 states and 276256 transitions. [2019-11-15 21:33:56,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:33:56,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2546 [2019-11-15 21:33:56,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:33:56,361 INFO L225 Difference]: With dead ends: 268191 [2019-11-15 21:33:56,361 INFO L226 Difference]: Without dead ends: 154104 [2019-11-15 21:33:56,402 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2561 GetRequests, 2545 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:33:56,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154104 states. [2019-11-15 21:33:57,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154104 to 131544. [2019-11-15 21:33:57,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131544 states. [2019-11-15 21:33:57,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131544 states to 131544 states and 135396 transitions. [2019-11-15 21:33:57,665 INFO L78 Accepts]: Start accepts. Automaton has 131544 states and 135396 transitions. Word has length 2546 [2019-11-15 21:33:57,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:33:57,666 INFO L462 AbstractCegarLoop]: Abstraction has 131544 states and 135396 transitions. [2019-11-15 21:33:57,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:33:57,667 INFO L276 IsEmpty]: Start isEmpty. Operand 131544 states and 135396 transitions. [2019-11-15 21:33:57,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2719 [2019-11-15 21:33:57,773 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:33:57,774 INFO L380 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, 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, 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, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:33:57,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:57,975 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:33:57,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:57,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1642980089, now seen corresponding path program 1 times [2019-11-15 21:33:57,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:57,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333528121] [2019-11-15 21:33:57,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:57,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:57,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:11,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10306 backedges. 3320 proven. 6619 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-15 21:34:11,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333528121] [2019-11-15 21:34:11,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443106017] [2019-11-15 21:34:11,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:34:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:12,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 3048 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:34:12,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:34:20,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10306 backedges. 8068 proven. 0 refuted. 0 times theorem prover too weak. 2238 trivial. 0 not checked. [2019-11-15 21:34:20,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:34:20,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 17 [2019-11-15 21:34:20,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638425776] [2019-11-15 21:34:20,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:34:20,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:20,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:34:20,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:34:20,874 INFO L87 Difference]: Start difference. First operand 131544 states and 135396 transitions. Second operand 4 states. [2019-11-15 21:34:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:38,663 INFO L93 Difference]: Finished difference Result 283511 states and 291505 transitions. [2019-11-15 21:34:38,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:34:38,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2718 [2019-11-15 21:34:38,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:38,664 INFO L225 Difference]: With dead ends: 283511 [2019-11-15 21:34:38,665 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:34:38,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2733 GetRequests, 2717 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:34:38,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:34:38,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:34:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:34:38,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:34:38,723 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2718 [2019-11-15 21:34:38,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:38,724 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:34:38,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:34:38,724 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:34:38,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:34:38,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:34:38,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:34:50,915 WARN L191 SmtUtils]: Spent 11.97 s on a formula simplification. DAG size of input: 2068 DAG size of output: 1731 [2019-11-15 21:35:01,409 WARN L191 SmtUtils]: Spent 10.49 s on a formula simplification. DAG size of input: 1985 DAG size of output: 1659 [2019-11-15 21:35:12,710 WARN L191 SmtUtils]: Spent 11.30 s on a formula simplification. DAG size of input: 2065 DAG size of output: 1729 [2019-11-15 21:35:58,529 WARN L191 SmtUtils]: Spent 45.81 s on a formula simplification. DAG size of input: 1631 DAG size of output: 209 [2019-11-15 21:36:40,708 WARN L191 SmtUtils]: Spent 42.17 s on a formula simplification. DAG size of input: 1582 DAG size of output: 213 [2019-11-15 21:37:26,692 WARN L191 SmtUtils]: Spent 45.98 s on a formula simplification. DAG size of input: 1631 DAG size of output: 209 [2019-11-15 21:37:26,694 INFO L443 ceAbstractionStarter]: For program point L1819(lines 1819 1830) no Hoare annotation was computed. [2019-11-15 21:37:26,694 INFO L443 ceAbstractionStarter]: For program point L762(lines 762 770) no Hoare annotation was computed. [2019-11-15 21:37:26,694 INFO L443 ceAbstractionStarter]: For program point L1819-2(lines 1819 1830) no Hoare annotation was computed. [2019-11-15 21:37:26,694 INFO L443 ceAbstractionStarter]: For program point L762-2(lines 762 770) no Hoare annotation was computed. [2019-11-15 21:37:26,694 INFO L443 ceAbstractionStarter]: For program point L1291(lines 1291 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,694 INFO L443 ceAbstractionStarter]: For program point L1159(lines 1159 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,694 INFO L443 ceAbstractionStarter]: For program point L1556(lines 1556 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,694 INFO L443 ceAbstractionStarter]: For program point L1424(lines 1424 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,694 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,694 INFO L443 ceAbstractionStarter]: For program point L103-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,694 INFO L443 ceAbstractionStarter]: For program point L1028(lines 1028 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,694 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 377) no Hoare annotation was computed. [2019-11-15 21:37:26,694 INFO L443 ceAbstractionStarter]: For program point L368-2(lines 368 377) no Hoare annotation was computed. [2019-11-15 21:37:26,694 INFO L443 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2019-11-15 21:37:26,694 INFO L443 ceAbstractionStarter]: For program point L2086(lines 2086 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,695 INFO L443 ceAbstractionStarter]: For program point L2351(lines 2351 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,695 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,695 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,695 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,695 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,695 INFO L443 ceAbstractionStarter]: For program point L2220(lines 2220 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,695 INFO L443 ceAbstractionStarter]: For program point L106-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,695 INFO L443 ceAbstractionStarter]: For program point L1956(lines 1956 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,695 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 908) no Hoare annotation was computed. [2019-11-15 21:37:26,695 INFO L443 ceAbstractionStarter]: For program point L899-2(lines 899 908) no Hoare annotation was computed. [2019-11-15 21:37:26,695 INFO L443 ceAbstractionStarter]: For program point L1428(lines 1428 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,695 INFO L443 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-11-15 21:37:26,695 INFO L443 ceAbstractionStarter]: For program point L2486(lines 2486 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,695 INFO L443 ceAbstractionStarter]: For program point L1429(lines 1429 1439) no Hoare annotation was computed. [2019-11-15 21:37:26,695 INFO L443 ceAbstractionStarter]: For program point L1429-2(lines 1429 1439) no Hoare annotation was computed. [2019-11-15 21:37:26,695 INFO L443 ceAbstractionStarter]: For program point L1297(lines 1297 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,696 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,696 INFO L443 ceAbstractionStarter]: For program point L1166(lines 1166 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,696 INFO L443 ceAbstractionStarter]: For program point L109-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,696 INFO L443 ceAbstractionStarter]: For program point L1034(lines 1034 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,696 INFO L443 ceAbstractionStarter]: For program point L1563(lines 1563 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,696 INFO L443 ceAbstractionStarter]: For program point L2224(lines 2224 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,696 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-11-15 21:37:26,696 INFO L443 ceAbstractionStarter]: For program point L2092(lines 2092 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,696 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,696 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,696 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,696 INFO L443 ceAbstractionStarter]: For program point L640(lines 640 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,696 INFO L443 ceAbstractionStarter]: For program point L2358(lines 2358 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,696 INFO L443 ceAbstractionStarter]: For program point L112-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,696 INFO L443 ceAbstractionStarter]: For program point L2491(lines 2491 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,696 INFO L443 ceAbstractionStarter]: For program point L113(line 113) no Hoare annotation was computed. [2019-11-15 21:37:26,696 INFO L443 ceAbstractionStarter]: For program point L2095(lines 2095 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,697 INFO L443 ceAbstractionStarter]: For program point L1963(lines 1963 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,697 INFO L443 ceAbstractionStarter]: For program point L1831(lines 1831 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,697 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,697 INFO L443 ceAbstractionStarter]: For program point L1303(lines 1303 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,697 INFO L443 ceAbstractionStarter]: For program point L1964(lines 1964 1974) no Hoare annotation was computed. [2019-11-15 21:37:26,697 INFO L443 ceAbstractionStarter]: For program point L1964-2(lines 1964 1974) no Hoare annotation was computed. [2019-11-15 21:37:26,697 INFO L443 ceAbstractionStarter]: For program point L1700(lines 1700 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,697 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,697 INFO L443 ceAbstractionStarter]: For program point L115-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,697 INFO L443 ceAbstractionStarter]: For program point L1040(lines 1040 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,697 INFO L443 ceAbstractionStarter]: For program point L776(lines 776 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,697 INFO L443 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-11-15 21:37:26,697 INFO L443 ceAbstractionStarter]: For program point L909(lines 909 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,697 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,697 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,697 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,697 INFO L443 ceAbstractionStarter]: For program point L2231(lines 2231 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,698 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,698 INFO L443 ceAbstractionStarter]: For program point L2496(lines 2496 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,698 INFO L443 ceAbstractionStarter]: For program point L2232(lines 2232 2243) no Hoare annotation was computed. [2019-11-15 21:37:26,698 INFO L443 ceAbstractionStarter]: For program point L2232-2(lines 2232 2243) no Hoare annotation was computed. [2019-11-15 21:37:26,698 INFO L443 ceAbstractionStarter]: For program point L118-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,698 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,698 INFO L443 ceAbstractionStarter]: For program point L1440(lines 1440 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,698 INFO L443 ceAbstractionStarter]: For program point L2365(lines 2365 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,698 INFO L443 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2019-11-15 21:37:26,698 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,698 INFO L443 ceAbstractionStarter]: For program point L2101(lines 2101 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,698 INFO L443 ceAbstractionStarter]: For program point L1837(lines 1837 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,698 INFO L443 ceAbstractionStarter]: For program point L913(lines 913 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,698 INFO L443 ceAbstractionStarter]: For program point L781(lines 781 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,698 INFO L443 ceAbstractionStarter]: For program point L1574(lines 1574 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,698 INFO L443 ceAbstractionStarter]: For program point L385(lines 385 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,699 INFO L443 ceAbstractionStarter]: For program point L121-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,699 INFO L443 ceAbstractionStarter]: For program point L1707(lines 1707 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,699 INFO L443 ceAbstractionStarter]: For program point L1575(lines 1575 1581) no Hoare annotation was computed. [2019-11-15 21:37:26,699 INFO L443 ceAbstractionStarter]: For program point L1575-2(lines 1575 1581) no Hoare annotation was computed. [2019-11-15 21:37:26,699 INFO L443 ceAbstractionStarter]: For program point L1179(lines 1179 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,699 INFO L443 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-11-15 21:37:26,699 INFO L443 ceAbstractionStarter]: For program point L1708(lines 1708 1717) no Hoare annotation was computed. [2019-11-15 21:37:26,699 INFO L443 ceAbstractionStarter]: For program point L1708-2(lines 1708 1717) no Hoare annotation was computed. [2019-11-15 21:37:26,699 INFO L443 ceAbstractionStarter]: For program point L1444(lines 1444 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,699 INFO L443 ceAbstractionStarter]: For program point L2105(lines 2105 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,699 INFO L443 ceAbstractionStarter]: For program point L2502(lines 2502 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,699 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,699 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,699 INFO L443 ceAbstractionStarter]: For program point L124-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,699 INFO L443 ceAbstractionStarter]: For program point L2106(lines 2106 2112) no Hoare annotation was computed. [2019-11-15 21:37:26,699 INFO L443 ceAbstractionStarter]: For program point L2106-2(lines 2106 2112) no Hoare annotation was computed. [2019-11-15 21:37:26,699 INFO L443 ceAbstractionStarter]: For program point L1842(lines 1842 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,700 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,700 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,700 INFO L443 ceAbstractionStarter]: For program point L2371(lines 2371 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,700 INFO L443 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2019-11-15 21:37:26,700 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,700 INFO L443 ceAbstractionStarter]: For program point L1975(lines 1975 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,700 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 531) no Hoare annotation was computed. [2019-11-15 21:37:26,700 INFO L443 ceAbstractionStarter]: For program point L522-2(lines 522 531) no Hoare annotation was computed. [2019-11-15 21:37:26,700 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,700 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,700 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,700 INFO L443 ceAbstractionStarter]: For program point L127-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,700 INFO L443 ceAbstractionStarter]: For program point L920(lines 920 929) no Hoare annotation was computed. [2019-11-15 21:37:26,700 INFO L443 ceAbstractionStarter]: For program point L920-2(lines 920 929) no Hoare annotation was computed. [2019-11-15 21:37:26,700 INFO L443 ceAbstractionStarter]: For program point L1845(lines 1845 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,700 INFO L443 ceAbstractionStarter]: For program point L392(lines 392 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,700 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,701 INFO L443 ceAbstractionStarter]: For program point L1185(lines 1185 1196) no Hoare annotation was computed. [2019-11-15 21:37:26,701 INFO L443 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-11-15 21:37:26,701 INFO L443 ceAbstractionStarter]: For program point L1185-2(lines 1185 1196) no Hoare annotation was computed. [2019-11-15 21:37:26,701 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,701 INFO L443 ceAbstractionStarter]: For program point L1979(lines 1979 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,701 INFO L443 ceAbstractionStarter]: For program point L1451(lines 1451 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,701 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,701 INFO L443 ceAbstractionStarter]: For program point L2244(lines 2244 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,702 INFO L443 ceAbstractionStarter]: For program point L130-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,702 INFO L443 ceAbstractionStarter]: For program point L2509(lines 2509 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,702 INFO L443 ceAbstractionStarter]: For program point L2377(lines 2377 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,702 INFO L443 ceAbstractionStarter]: For program point L2245(lines 2245 2255) no Hoare annotation was computed. [2019-11-15 21:37:26,702 INFO L443 ceAbstractionStarter]: For program point L131(line 131) no Hoare annotation was computed. [2019-11-15 21:37:26,702 INFO L443 ceAbstractionStarter]: For program point L2245-2(lines 2245 2255) no Hoare annotation was computed. [2019-11-15 21:37:26,702 INFO L443 ceAbstractionStarter]: For program point L1056(lines 1056 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,702 INFO L443 ceAbstractionStarter]: For program point L2113(lines 2113 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,702 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 21:37:26,702 INFO L443 ceAbstractionStarter]: For program point L660(lines 660 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,703 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,703 INFO L443 ceAbstractionStarter]: For program point L1718(lines 1718 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,703 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,703 INFO L443 ceAbstractionStarter]: For program point L133-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,703 INFO L443 ceAbstractionStarter]: For program point L1587(lines 1587 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,703 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,703 INFO L443 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2019-11-15 21:37:26,703 INFO L443 ceAbstractionStarter]: For program point L1984(lines 1984 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,703 INFO L443 ceAbstractionStarter]: For program point L1852(lines 1852 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,703 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,703 INFO L443 ceAbstractionStarter]: For program point L532(lines 532 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,703 INFO L443 ceAbstractionStarter]: For program point L2514(lines 2514 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,703 INFO L443 ceAbstractionStarter]: For program point L1457(lines 1457 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,703 INFO L443 ceAbstractionStarter]: For program point L2382(lines 2382 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,703 INFO L443 ceAbstractionStarter]: For program point L136-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,703 INFO L443 ceAbstractionStarter]: For program point L2118(lines 2118 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,703 INFO L443 ceAbstractionStarter]: For program point L1590(lines 1590 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,704 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-11-15 21:37:26,704 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,704 INFO L443 ceAbstractionStarter]: For program point L1723(lines 1723 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,704 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,704 INFO L443 ceAbstractionStarter]: For program point L667(lines 667 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,704 INFO L443 ceAbstractionStarter]: For program point L535(lines 535 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,704 INFO L443 ceAbstractionStarter]: For program point L2517(lines 2517 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,704 INFO L443 ceAbstractionStarter]: For program point L1328(lines 1328 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,704 INFO L443 ceAbstractionStarter]: For program point L139-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,704 INFO L443 ceAbstractionStarter]: For program point L800(lines 800 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,704 INFO L443 ceAbstractionStarter]: For program point L1329(lines 1329 1338) no Hoare annotation was computed. [2019-11-15 21:37:26,704 INFO L443 ceAbstractionStarter]: For program point L1329-2(lines 1329 1338) no Hoare annotation was computed. [2019-11-15 21:37:26,704 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,704 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-15 21:37:26,704 INFO L443 ceAbstractionStarter]: For program point L1858(lines 1858 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,704 INFO L443 ceAbstractionStarter]: For program point L1462(lines 1462 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,705 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,705 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,705 INFO L443 ceAbstractionStarter]: For program point L1991(lines 1991 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,705 INFO L443 ceAbstractionStarter]: For program point L1859(lines 1859 1867) no Hoare annotation was computed. [2019-11-15 21:37:26,705 INFO L443 ceAbstractionStarter]: For program point L1859-2(lines 1859 1867) no Hoare annotation was computed. [2019-11-15 21:37:26,705 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,705 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 415) no Hoare annotation was computed. [2019-11-15 21:37:26,705 INFO L443 ceAbstractionStarter]: For program point L406-2(lines 406 415) no Hoare annotation was computed. [2019-11-15 21:37:26,705 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 286) no Hoare annotation was computed. [2019-11-15 21:37:26,705 INFO L443 ceAbstractionStarter]: For program point L2256(lines 2256 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,705 INFO L443 ceAbstractionStarter]: For program point L274-2(lines 274 286) no Hoare annotation was computed. [2019-11-15 21:37:26,705 INFO L443 ceAbstractionStarter]: For program point L142-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,705 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,705 INFO L443 ceAbstractionStarter]: For program point L1596(lines 1596 1607) no Hoare annotation was computed. [2019-11-15 21:37:26,705 INFO L443 ceAbstractionStarter]: For program point L1596-2(lines 1596 1607) no Hoare annotation was computed. [2019-11-15 21:37:26,705 INFO L443 ceAbstractionStarter]: For program point L2389(lines 2389 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,705 INFO L443 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-11-15 21:37:26,706 INFO L443 ceAbstractionStarter]: For program point L2125(lines 2125 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,706 INFO L443 ceAbstractionStarter]: For program point L2522(lines 2522 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,706 INFO L443 ceAbstractionStarter]: For program point L2390(lines 2390 2402) no Hoare annotation was computed. [2019-11-15 21:37:26,706 INFO L443 ceAbstractionStarter]: For program point L2390-2(lines 2390 2402) no Hoare annotation was computed. [2019-11-15 21:37:26,706 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 134) no Hoare annotation was computed. [2019-11-15 21:37:26,706 INFO L443 ceAbstractionStarter]: For program point L1069(lines 1069 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,706 INFO L443 ceAbstractionStarter]: For program point L1730(lines 1730 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,706 INFO L443 ceAbstractionStarter]: For program point L673(lines 673 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,706 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,706 INFO L443 ceAbstractionStarter]: For program point L1202(lines 1202 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,706 INFO L443 ceAbstractionStarter]: For program point L145-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,706 INFO L443 ceAbstractionStarter]: For program point L1995(lines 1995 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,706 INFO L443 ceAbstractionStarter]: For program point L1467(lines 1467 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,706 INFO L443 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2019-11-15 21:37:26,706 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,706 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,707 INFO L443 ceAbstractionStarter]: For program point L2129(lines 2129 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,707 INFO L443 ceAbstractionStarter]: For program point L148-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,707 INFO L443 ceAbstractionStarter]: For program point L2527(lines 2527 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,707 INFO L443 ceAbstractionStarter]: For program point L2263(lines 2263 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,707 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-11-15 21:37:26,707 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,707 INFO L443 ceAbstractionStarter]: For program point L2528(lines 2528 2538) no Hoare annotation was computed. [2019-11-15 21:37:26,707 INFO L443 ceAbstractionStarter]: For program point L2528-2(lines 2528 2538) no Hoare annotation was computed. [2019-11-15 21:37:26,707 INFO L443 ceAbstractionStarter]: For program point L1339(lines 1339 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,707 INFO L443 ceAbstractionStarter]: For program point L1868(lines 1868 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,707 INFO L443 ceAbstractionStarter]: For program point L679(lines 679 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,707 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,707 INFO L443 ceAbstractionStarter]: For program point L151-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,707 INFO L443 ceAbstractionStarter]: For program point L1076(lines 1076 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,707 INFO L443 ceAbstractionStarter]: For program point L548(lines 548 557) no Hoare annotation was computed. [2019-11-15 21:37:26,707 INFO L443 ceAbstractionStarter]: For program point L548-2(lines 548 557) no Hoare annotation was computed. [2019-11-15 21:37:26,708 INFO L443 ceAbstractionStarter]: For program point L416(lines 416 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,708 INFO L443 ceAbstractionStarter]: For program point L1209(lines 1209 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,708 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-15 21:37:26,708 INFO L443 ceAbstractionStarter]: For program point L2002(lines 2002 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,708 INFO L443 ceAbstractionStarter]: For program point L1474(lines 1474 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,708 INFO L443 ceAbstractionStarter]: For program point L2135(lines 2135 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,708 INFO L443 ceAbstractionStarter]: For program point L946(lines 946 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,708 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,708 INFO L443 ceAbstractionStarter]: For program point L2268(lines 2268 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,708 INFO L443 ceAbstractionStarter]: For program point L154-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,708 INFO L443 ceAbstractionStarter]: For program point L1608(lines 1608 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,708 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,708 INFO L443 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2019-11-15 21:37:26,708 INFO L443 ceAbstractionStarter]: For program point L1741(lines 1741 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,708 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,708 INFO L443 ceAbstractionStarter]: For program point L1346(lines 1346 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,708 INFO L443 ceAbstractionStarter]: For program point L2403(lines 2403 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,709 INFO L443 ceAbstractionStarter]: For program point L157-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,709 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 27) no Hoare annotation was computed. [2019-11-15 21:37:26,709 INFO L443 ceAbstractionStarter]: For program point L25-2(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,709 INFO L443 ceAbstractionStarter]: For program point L2007(lines 2007 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,709 INFO L443 ceAbstractionStarter]: For program point L1875(lines 1875 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,709 INFO L443 ceAbstractionStarter]: For program point L686(lines 686 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,709 INFO L443 ceAbstractionStarter]: For program point L2404(lines 2404 2415) no Hoare annotation was computed. [2019-11-15 21:37:26,709 INFO L443 ceAbstractionStarter]: For program point L2404-2(lines 2404 2415) no Hoare annotation was computed. [2019-11-15 21:37:26,709 INFO L443 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-11-15 21:37:26,709 INFO L443 ceAbstractionStarter]: For program point L2140(lines 2140 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,709 INFO L443 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2019-11-15 21:37:26,709 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 697) no Hoare annotation was computed. [2019-11-15 21:37:26,709 INFO L443 ceAbstractionStarter]: For program point L687-2(lines 687 697) no Hoare annotation was computed. [2019-11-15 21:37:26,709 INFO L443 ceAbstractionStarter]: For program point L423(lines 423 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,710 INFO L443 ceAbstractionStarter]: For program point L1216(lines 1216 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,710 INFO L443 ceAbstractionStarter]: For program point L952(lines 952 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,710 INFO L443 ceAbstractionStarter]: For program point L820(lines 820 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,710 INFO L443 ceAbstractionStarter]: For program point L1745(lines 1745 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,710 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,710 INFO L443 ceAbstractionStarter]: For program point L1481(lines 1481 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,710 INFO L443 ceAbstractionStarter]: For program point L160-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,710 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:37:26,710 INFO L443 ceAbstractionStarter]: For program point L28-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,710 INFO L443 ceAbstractionStarter]: For program point L2010(lines 2010 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,710 INFO L443 ceAbstractionStarter]: For program point L2539(lines 2539 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,710 INFO L443 ceAbstractionStarter]: For program point L2275(lines 2275 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,710 INFO L443 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2019-11-15 21:37:26,711 INFO L443 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-11-15 21:37:26,711 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,711 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,711 INFO L443 ceAbstractionStarter]: For program point L1352(lines 1352 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,711 INFO L443 ceAbstractionStarter]: For program point L1220(lines 1220 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,711 INFO L443 ceAbstractionStarter]: For program point L163-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,711 INFO L443 ceAbstractionStarter]: For program point L1088(lines 1088 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,711 INFO L443 ceAbstractionStarter]: For program point L2145(lines 2145 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,711 INFO L443 ceAbstractionStarter]: For program point L31-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,711 INFO L443 ceAbstractionStarter]: For program point L1881(lines 1881 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,711 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,711 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,712 INFO L443 ceAbstractionStarter]: For program point L1221(lines 1221 1230) no Hoare annotation was computed. [2019-11-15 21:37:26,712 INFO L443 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2019-11-15 21:37:26,712 INFO L443 ceAbstractionStarter]: For program point L1221-2(lines 1221 1230) no Hoare annotation was computed. [2019-11-15 21:37:26,712 INFO L443 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2019-11-15 21:37:26,712 INFO L443 ceAbstractionStarter]: For program point L826(lines 826 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,712 INFO L443 ceAbstractionStarter]: For program point L2544(lines 2544 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,712 INFO L443 ceAbstractionStarter]: For program point L1487(lines 1487 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,712 INFO L443 ceAbstractionStarter]: For program point L166-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,712 INFO L443 ceAbstractionStarter]: For program point L34-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,712 INFO L443 ceAbstractionStarter]: For program point L2016(lines 2016 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,712 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,712 INFO L443 ceAbstractionStarter]: For program point L1620(lines 1620 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,712 INFO L443 ceAbstractionStarter]: For program point L2281(lines 2281 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,713 INFO L443 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-11-15 21:37:26,713 INFO L443 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2019-11-15 21:37:26,713 INFO L443 ceAbstractionStarter]: For program point L565(lines 565 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,713 INFO L443 ceAbstractionStarter]: For program point L1490(lines 1490 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,713 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,713 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,713 INFO L443 ceAbstractionStarter]: For program point L169-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,713 INFO L443 ceAbstractionStarter]: For program point L1094(lines 1094 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,713 INFO L443 ceAbstractionStarter]: For program point L37-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,713 INFO L443 ceAbstractionStarter]: For program point L698(lines 698 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,713 INFO L443 ceAbstractionStarter]: For program point L2416(lines 2416 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,713 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,713 INFO L443 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-11-15 21:37:26,714 INFO L443 ceAbstractionStarter]: For program point L2152(lines 2152 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,714 INFO L443 ceAbstractionStarter]: For program point L38(line 38) no Hoare annotation was computed. [2019-11-15 21:37:26,714 INFO L443 ceAbstractionStarter]: For program point L2020(lines 2020 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,714 INFO L443 ceAbstractionStarter]: For program point L1888(lines 1888 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,714 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,714 INFO L443 ceAbstractionStarter]: For program point L1756(lines 1756 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,714 INFO L443 ceAbstractionStarter]: For program point L2021(lines 2021 2030) no Hoare annotation was computed. [2019-11-15 21:37:26,714 INFO L443 ceAbstractionStarter]: For program point L2021-2(lines 2021 2030) no Hoare annotation was computed. [2019-11-15 21:37:26,714 INFO L443 ceAbstractionStarter]: For program point L172-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,714 INFO L443 ceAbstractionStarter]: For program point L40-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,714 INFO L443 ceAbstractionStarter]: For program point L1626(lines 1626 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,714 INFO L443 ceAbstractionStarter]: For program point L2551(lines 2551 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,715 INFO L443 ceAbstractionStarter]: For program point L2287(lines 2287 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,715 INFO L443 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-11-15 21:37:26,715 INFO L443 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-11-15 21:37:26,715 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,715 INFO L443 ceAbstractionStarter]: For program point L570(lines 570 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,715 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,715 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,715 INFO L443 ceAbstractionStarter]: For program point L703(lines 703 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,715 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,715 INFO L443 ceAbstractionStarter]: For program point L1364(lines 1364 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,715 INFO L443 ceAbstractionStarter]: For program point L175-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,715 INFO L443 ceAbstractionStarter]: For program point L1100(lines 1100 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,716 INFO L443 ceAbstractionStarter]: For program point L2157(lines 2157 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,716 INFO L443 ceAbstractionStarter]: For program point L43-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,716 INFO L443 ceAbstractionStarter]: For program point L1497(lines 1497 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,716 INFO L443 ceAbstractionStarter]: For program point L2422(lines 2422 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,716 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1376) no Hoare annotation was computed. [2019-11-15 21:37:26,716 INFO L443 ceAbstractionStarter]: For program point L1365-2(lines 1365 1376) no Hoare annotation was computed. [2019-11-15 21:37:26,716 INFO L443 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2019-11-15 21:37:26,716 INFO L443 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-11-15 21:37:26,716 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,716 INFO L443 ceAbstractionStarter]: For program point L1895(lines 1895 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,716 INFO L443 ceAbstractionStarter]: For program point L838(lines 838 846) no Hoare annotation was computed. [2019-11-15 21:37:26,716 INFO L443 ceAbstractionStarter]: For program point L838-2(lines 838 846) no Hoare annotation was computed. [2019-11-15 21:37:26,716 INFO L443 ceAbstractionStarter]: For program point L1763(lines 1763 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,717 INFO L443 ceAbstractionStarter]: For program point L178-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,717 INFO L443 ceAbstractionStarter]: For program point L46-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,717 INFO L443 ceAbstractionStarter]: For program point L1632(lines 1632 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,717 INFO L443 ceAbstractionStarter]: For program point L2557(lines 2557 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,717 INFO L443 ceAbstractionStarter]: For program point L2293(lines 2293 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,717 INFO L443 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2019-11-15 21:37:26,717 INFO L443 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-11-15 21:37:26,717 INFO L443 ceAbstractionStarter]: For program point L972(lines 972 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,717 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,717 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,717 INFO L443 ceAbstractionStarter]: For program point L709(lines 709 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,717 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,717 INFO L443 ceAbstractionStarter]: For program point L181-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,718 INFO L443 ceAbstractionStarter]: For program point L1106(lines 1106 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,718 INFO L443 ceAbstractionStarter]: For program point L2163(lines 2163 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,718 INFO L443 ceAbstractionStarter]: For program point L49-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,718 INFO L443 ceAbstractionStarter]: For program point L2031(lines 2031 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,718 INFO L443 ceAbstractionStarter]: For program point L710(lines 710 718) no Hoare annotation was computed. [2019-11-15 21:37:26,718 INFO L443 ceAbstractionStarter]: For program point L710-2(lines 710 718) no Hoare annotation was computed. [2019-11-15 21:37:26,718 INFO L443 ceAbstractionStarter]: For program point L446(lines 446 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,718 INFO L443 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-11-15 21:37:26,718 INFO L443 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-11-15 21:37:26,718 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,718 INFO L443 ceAbstractionStarter]: For program point L1900(lines 1900 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,718 INFO L443 ceAbstractionStarter]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,719 INFO L443 ceAbstractionStarter]: For program point L1504(lines 1504 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,719 INFO L443 ceAbstractionStarter]: For program point L2429(lines 2429 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,719 INFO L443 ceAbstractionStarter]: For program point L2297(lines 2297 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,719 INFO L443 ceAbstractionStarter]: For program point L2430(lines 2430 2439) no Hoare annotation was computed. [2019-11-15 21:37:26,719 INFO L443 ceAbstractionStarter]: For program point L2430-2(lines 2430 2439) no Hoare annotation was computed. [2019-11-15 21:37:26,719 INFO L443 ceAbstractionStarter]: For program point L184-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,719 INFO L443 ceAbstractionStarter]: For program point L52-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,719 INFO L443 ceAbstractionStarter]: For program point L1770(lines 1770 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,719 INFO L443 ceAbstractionStarter]: For program point L2563(lines 2563 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,719 INFO L443 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2019-11-15 21:37:26,719 INFO L443 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2019-11-15 21:37:26,719 INFO L443 ceAbstractionStarter]: For program point L582(lines 582 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,719 INFO L443 ceAbstractionStarter]: For program point L2168(lines 2168 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,720 INFO L443 ceAbstractionStarter]: For program point L847(lines 847 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,720 INFO L443 ceAbstractionStarter]: For program point L451(lines 451 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,720 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,720 INFO L443 ceAbstractionStarter]: For program point L1244(lines 1244 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,720 INFO L443 ceAbstractionStarter]: For program point L187-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,720 INFO L443 ceAbstractionStarter]: For program point L55-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,720 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 858) no Hoare annotation was computed. [2019-11-15 21:37:26,720 INFO L443 ceAbstractionStarter]: For program point L848-2(lines 848 858) no Hoare annotation was computed. [2019-11-15 21:37:26,720 INFO L443 ceAbstractionStarter]: For program point L1377(lines 1377 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,720 INFO L443 ceAbstractionStarter]: For program point L2302(lines 2302 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,720 INFO L443 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-11-15 21:37:26,720 INFO L443 ceAbstractionStarter]: For program point L1113(lines 1113 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,720 INFO L443 ceAbstractionStarter]: For program point L56(line 56) no Hoare annotation was computed. [2019-11-15 21:37:26,721 INFO L443 ceAbstractionStarter]: For program point L2038(lines 2038 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,721 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,721 INFO L443 ceAbstractionStarter]: For program point L1906(lines 1906 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,721 INFO L443 ceAbstractionStarter]: For program point L1510(lines 1510 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,721 INFO L443 ceAbstractionStarter]: For program point L1907(lines 1907 1915) no Hoare annotation was computed. [2019-11-15 21:37:26,721 INFO L443 ceAbstractionStarter]: For program point L1907-2(lines 1907 1915) no Hoare annotation was computed. [2019-11-15 21:37:26,722 INFO L439 ceAbstractionStarter]: At program point L1643(lines 24 1644) the Hoare annotation is: (let ((.cse14 (<= ~a28~0 134)) (.cse15 (< 37 ~a28~0)) (.cse41 (+ ~a14~0 114))) (let ((.cse40 (+ ~a14~0 182)) (.cse10 (< 0 .cse41)) (.cse12 (< 124 ~a26~0)) (.cse38 (and .cse14 .cse15)) (.cse4 (<= ~a24~0 1))) (let ((.cse35 (< 134 ~a28~0)) (.cse29 (<= 301 ~a28~0)) (.cse34 (or (and .cse10 .cse4) (and .cse12 .cse4) (and .cse38 .cse4))) (.cse39 (- ~a26~0)) (.cse8 (<= (+ ~a14~0 84) 0)) (.cse25 (<= (+ ~a14~0 183) 0)) (.cse7 (= ~a24~0 2)) (.cse3 (<= ~a21~0 124)) (.cse6 (<= .cse40 0))) (let ((.cse27 (exists ((v_~a14~0_1227 Int)) (let ((.cse43 (div v_~a14~0_1227 (- 5)))) (let ((.cse42 (* 10 .cse43))) (and (<= 0 (+ .cse42 3221490)) (<= (div (+ (* .cse43 10) 3221480) 9) ~a14~0) (not (= (mod v_~a14~0_1227 (- 5)) 0)) (< v_~a14~0_1227 0) (<= (+ v_~a14~0_1227 84) 0) (<= 0 (+ .cse42 3221480))))))) (.cse0 (and .cse14 .cse15 .cse6)) (.cse20 (and .cse12 .cse25 .cse7 .cse3)) (.cse5 (<= (+ ~a26~0 68) 0)) (.cse30 (<= ~a28~0 279)) (.cse31 (and .cse7 (<= 183 ~a28~0) .cse3)) (.cse13 (<= ~a26~0 222)) (.cse2 (<= ~a26~0 217)) (.cse32 (and .cse38 .cse7)) (.cse28 (<= 0 (+ (div (+ ~a14~0 459561) 5) 113))) (.cse21 (or (<= ~a28~0 37) .cse8)) (.cse18 (< 217 ~a26~0)) (.cse24 (<= 0 (+ ~a14~0 79))) (.cse33 (<= .cse41 0)) (.cse9 (< 0 .cse40)) (.cse37 (<= (div (+ .cse39 596057) (- 5)) 124)) (.cse1 (= ~a24~0 3)) (.cse19 (<= ~a26~0 460652)) (.cse23 (<= 222 ~a26~0)) (.cse26 (<= ~a26~0 599553)) (.cse11 (<= ~a26~0 124)) (.cse22 (<= ~a14~0 364756)) (.cse17 (or (and .cse29 .cse4 .cse3) (and .cse34 .cse3))) (.cse16 (or .cse35 .cse6))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (or .cse5 .cse6)) (and .cse7 .cse2 .cse8 .cse3 .cse9) (and .cse1 .cse8 .cse3 .cse10 .cse11) (and (and (and .cse12 .cse13 .cse14 .cse15) .cse7) .cse3) (and (and (and .cse5 .cse7) .cse3) .cse16) (and .cse17 .cse2) (and .cse12 .cse7 .cse2 .cse3 .cse15) (and .cse18 (and .cse19 .cse20)) (and .cse21 (and .cse7 .cse22 .cse23 .cse24 .cse3)) (and .cse7 .cse10 .cse3 .cse8) (and (and .cse18 .cse25 .cse1 .cse15 .cse3) .cse26) (and .cse7 .cse3 .cse11 .cse27) (and .cse7 .cse3 .cse16 .cse27) (and .cse28 (and .cse7 .cse0 .cse3)) (and .cse20 .cse14 .cse28 .cse26) (and .cse29 .cse7 .cse26 .cse3) (and .cse4 .cse22 (= ~a26~0 222) .cse3) (and .cse30 .cse28 .cse31 .cse6) (and (and .cse1 (and .cse5 .cse25) .cse3) (<= (+ ~a28~0 599901) 0)) (and .cse29 .cse25 .cse1 .cse26 .cse3) (and (and .cse32 .cse3) (<= (+ ~a26~0 600) 0)) (and .cse30 .cse31 .cse26 .cse6) (and .cse18 .cse7 .cse13 .cse33 .cse15 .cse3) (and (and (and .cse12 .cse14 .cse15 .cse24) .cse7) .cse3) (and .cse34 .cse8) (and .cse12 .cse1 .cse33 .cse2 .cse3 (or (not (= 2 ULTIMATE.start_calculate_output_~input)) .cse35) .cse9) (and (exists ((v_~a14~0_1230 Int)) (let ((.cse36 (* v_~a14~0_1230 9))) (and (<= (+ v_~a14~0_1230 182) 0) (< (* 9 v_~a14~0_1230) 0) (<= 0 (+ (div (+ v_~a14~0_1230 459561) 5) 113)) (not (= (mod .cse36 10) 0)) (<= (+ (div .cse36 10) 588353) ~a14~0)))) .cse32 .cse3) (and .cse7 .cse28 .cse23 .cse37 .cse3 .cse8 .cse15) (and .cse17 .cse21) (and .cse18 (and .cse19 .cse7 .cse22 .cse24 .cse3)) (and .cse33 .cse15 .cse4 .cse3) (and .cse38 .cse1 .cse33 .cse9 .cse3) (and .cse7 .cse9 .cse23 .cse37 .cse3 .cse8) (and .cse1 .cse15 .cse11 .cse3 .cse16) (and .cse7 .cse23 .cse3 .cse19 .cse15) (and (and (and (and .cse14 .cse15 .cse23) .cse7) .cse3) .cse26) (and .cse14 (and (and .cse25 .cse7) .cse3) .cse11) (and (or (and .cse34 .cse22 .cse3) (and .cse17 (<= ~a26~0 466645))) (<= (div (+ .cse39 557256) (- 20)) 124) .cse16)))))) [2019-11-15 21:37:26,722 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:37:26,722 INFO L443 ceAbstractionStarter]: For program point L190-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,722 INFO L443 ceAbstractionStarter]: For program point L2172(lines 2172 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,722 INFO L443 ceAbstractionStarter]: For program point L58-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,722 INFO L443 ceAbstractionStarter]: For program point L719(lines 719 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,722 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,722 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,723 INFO L443 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2019-11-15 21:37:26,723 INFO L443 ceAbstractionStarter]: For program point L59(line 59) no Hoare annotation was computed. [2019-11-15 21:37:26,723 INFO L443 ceAbstractionStarter]: For program point L1777(lines 1777 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,723 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,723 INFO L439 ceAbstractionStarter]: At program point L2571(lines 1646 2572) the Hoare annotation is: (let ((.cse0 (<= ~a28~0 134)) (.cse1 (< 37 ~a28~0)) (.cse41 (+ ~a14~0 114))) (let ((.cse13 (< 0 .cse41)) (.cse15 (< 124 ~a26~0)) (.cse37 (and .cse0 .cse1)) (.cse6 (<= ~a24~0 1)) (.cse40 (+ ~a14~0 182))) (let ((.cse35 (< 134 ~a28~0)) (.cse2 (<= .cse40 0)) (.cse27 (<= 301 ~a28~0)) (.cse34 (or (and .cse13 .cse6) (and .cse15 .cse6) (and .cse37 .cse6))) (.cse39 (- ~a26~0)) (.cse18 (<= (+ ~a14~0 183) 0)) (.cse16 (<= ~a26~0 222)) (.cse8 (= ~a24~0 2)) (.cse5 (<= ~a21~0 124)) (.cse9 (<= (+ ~a14~0 84) 0))) (let ((.cse7 (<= (+ ~a26~0 68) 0)) (.cse24 (exists ((v_~a14~0_1227 Int)) (let ((.cse43 (div v_~a14~0_1227 (- 5)))) (let ((.cse42 (* 10 .cse43))) (and (<= 0 (+ .cse42 3221490)) (<= (div (+ (* .cse43 10) 3221480) 9) ~a14~0) (not (= (mod v_~a14~0_1227 (- 5)) 0)) (< v_~a14~0_1227 0) (<= (+ v_~a14~0_1227 84) 0) (<= 0 (+ .cse42 3221480))))))) (.cse19 (or (<= ~a28~0 37) .cse9)) (.cse29 (<= ~a28~0 279)) (.cse30 (and .cse8 (<= 183 ~a28~0) .cse5)) (.cse21 (<= 0 (+ ~a14~0 79))) (.cse28 (or (and .cse15 .cse16 .cse6) (and .cse16 .cse13 .cse6))) (.cse4 (<= ~a26~0 217)) (.cse33 (<= .cse41 0)) (.cse22 (< 217 ~a26~0)) (.cse12 (<= ~a26~0 460652)) (.cse25 (and .cse15 .cse18 .cse8 .cse5)) (.cse31 (and .cse37 .cse8)) (.cse10 (< 0 .cse40)) (.cse36 (<= (div (+ .cse39 596057) (- 5)) 124)) (.cse3 (= ~a24~0 3)) (.cse11 (<= 222 ~a26~0)) (.cse23 (<= ~a26~0 599553)) (.cse14 (<= ~a26~0 124)) (.cse20 (<= ~a14~0 364756)) (.cse32 (or (and .cse27 .cse6 .cse5) (and .cse34 .cse5))) (.cse17 (or .cse35 .cse2)) (.cse26 (<= 0 (+ (div (+ ~a14~0 459561) 5) 113)))) (or (and (and .cse0 .cse1 .cse2) .cse3 .cse4 .cse5) (and .cse6 (or .cse7 .cse2)) (and .cse8 .cse4 .cse9 .cse5 .cse10) (and .cse8 .cse11 .cse5 .cse12 .cse1) (and .cse3 .cse9 .cse5 .cse13 .cse14) (and (and (and .cse15 .cse16 .cse0 .cse1) .cse8) .cse5) (and (and (and .cse7 .cse8) .cse5) .cse17) (and (<= (+ ~a28~0 599901) 0) (and .cse3 (and .cse7 .cse18) .cse5)) (and .cse15 .cse8 .cse4 .cse5 .cse1) (and .cse19 (and .cse8 .cse20 .cse11 .cse21 .cse5)) (and .cse8 .cse13 .cse5 .cse9) (and (and .cse22 .cse18 .cse3 .cse1 .cse5) .cse23) (and .cse8 .cse5 .cse14 .cse24) (and .cse8 .cse17 .cse5 .cse24) (and .cse25 .cse0 .cse26 .cse23) (and .cse27 .cse8 .cse23 .cse5) (and .cse28 .cse20 (= ~a26~0 222) .cse5) (and .cse29 .cse26 .cse30 .cse2) (and .cse27 .cse18 .cse3 .cse23 .cse5) (and (and .cse31 .cse5) (<= (+ ~a26~0 600) 0)) (and .cse19 .cse32) (and .cse29 .cse30 .cse23 .cse2) (and .cse22 .cse8 .cse16 .cse33 .cse1 .cse5) (and (and (and .cse15 .cse0 .cse1 .cse21) .cse8) .cse5) (and .cse34 .cse9) (and .cse15 .cse3 .cse33 .cse4 .cse5 (or (not (= 2 ULTIMATE.start_calculate_output_~input)) .cse35) .cse10) (and .cse8 .cse26 .cse11 .cse36 .cse5 .cse9 .cse1) (and .cse22 (and .cse12 .cse8 .cse20 .cse21 .cse5)) (and (and .cse28 .cse5) .cse4) (and .cse33 .cse1 .cse6 .cse5) (and .cse37 .cse3 .cse33 .cse10 .cse5) (and .cse22 (and .cse12 .cse25)) (and (exists ((v_~a14~0_1230 Int)) (let ((.cse38 (* v_~a14~0_1230 9))) (and (<= (+ v_~a14~0_1230 182) 0) (< (* 9 v_~a14~0_1230) 0) (<= 0 (+ (div (+ v_~a14~0_1230 459561) 5) 113)) (not (= (mod .cse38 10) 0)) (<= (+ (div .cse38 10) 588353) ~a14~0)))) .cse31 .cse5) (and .cse8 .cse10 .cse11 .cse36 .cse5 .cse9) (and .cse3 .cse1 .cse14 .cse5 .cse17) (and (and (and (and .cse0 .cse1 .cse11) .cse8) .cse5) .cse23) (and .cse0 (and (and .cse18 .cse8) .cse5) .cse14) (and (or (and .cse34 .cse20 .cse5) (and .cse32 (<= ~a26~0 466645))) (<= (div (+ .cse39 557256) (- 20)) 124) .cse17) (and (and .cse8 .cse1 .cse5) .cse0 .cse26 .cse2)))))) [2019-11-15 21:37:26,724 INFO L443 ceAbstractionStarter]: For program point L2307(lines 2307 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,724 INFO L443 ceAbstractionStarter]: For program point L193-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,724 INFO L443 ceAbstractionStarter]: For program point L61-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,724 INFO L443 ceAbstractionStarter]: For program point L2043(lines 2043 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,724 INFO L443 ceAbstractionStarter]: For program point L1515(lines 1515 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,724 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,724 INFO L443 ceAbstractionStarter]: For program point L2440(lines 2440 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,724 INFO L443 ceAbstractionStarter]: For program point L1383(lines 1383 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,724 INFO L443 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2019-11-15 21:37:26,724 INFO L443 ceAbstractionStarter]: For program point L1119(lines 1119 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,724 INFO L443 ceAbstractionStarter]: For program point L62(line 62) no Hoare annotation was computed. [2019-11-15 21:37:26,724 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,724 INFO L443 ceAbstractionStarter]: For program point L1649(lines 1649 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,725 INFO L446 ceAbstractionStarter]: At program point L2574(lines 2574 2590) the Hoare annotation is: true [2019-11-15 21:37:26,725 INFO L443 ceAbstractionStarter]: For program point L196-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,725 INFO L443 ceAbstractionStarter]: For program point L2178(lines 2178 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,725 INFO L443 ceAbstractionStarter]: For program point L64-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,725 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,725 INFO L443 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-11-15 21:37:26,725 INFO L443 ceAbstractionStarter]: For program point L65(line 65) no Hoare annotation was computed. [2019-11-15 21:37:26,725 INFO L443 ceAbstractionStarter]: For program point L726(lines 726 736) no Hoare annotation was computed. [2019-11-15 21:37:26,725 INFO L443 ceAbstractionStarter]: For program point L726-2(lines 726 736) no Hoare annotation was computed. [2019-11-15 21:37:26,725 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,725 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,725 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,725 INFO L443 ceAbstractionStarter]: For program point L1916(lines 1916 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,725 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,726 INFO L443 ceAbstractionStarter]: For program point L1784(lines 1784 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,726 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,726 INFO L443 ceAbstractionStarter]: For program point L2313(lines 2313 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,726 INFO L443 ceAbstractionStarter]: For program point L199-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,726 INFO L443 ceAbstractionStarter]: For program point L67-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,726 INFO L443 ceAbstractionStarter]: For program point L1521(lines 1521 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,726 INFO L443 ceAbstractionStarter]: For program point L2446(lines 2446 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,726 INFO L443 ceAbstractionStarter]: For program point L1389(lines 1389 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,726 INFO L443 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-11-15 21:37:26,729 INFO L443 ceAbstractionStarter]: For program point L1125(lines 1125 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,729 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-15 21:37:26,729 INFO L443 ceAbstractionStarter]: For program point L2050(lines 2050 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,729 INFO L443 ceAbstractionStarter]: For program point L1654(lines 1654 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,730 INFO L439 ceAbstractionStarter]: At program point L2580-2(lines 2580 2589) the Hoare annotation is: (let ((.cse14 (<= ~a28~0 134)) (.cse15 (< 37 ~a28~0)) (.cse41 (+ ~a14~0 114))) (let ((.cse40 (+ ~a14~0 182)) (.cse10 (< 0 .cse41)) (.cse12 (< 124 ~a26~0)) (.cse38 (and .cse14 .cse15)) (.cse4 (<= ~a24~0 1))) (let ((.cse35 (< 134 ~a28~0)) (.cse29 (<= 301 ~a28~0)) (.cse34 (or (and .cse10 .cse4) (and .cse12 .cse4) (and .cse38 .cse4))) (.cse39 (- ~a26~0)) (.cse8 (<= (+ ~a14~0 84) 0)) (.cse25 (<= (+ ~a14~0 183) 0)) (.cse7 (= ~a24~0 2)) (.cse3 (<= ~a21~0 124)) (.cse6 (<= .cse40 0))) (let ((.cse27 (exists ((v_~a14~0_1227 Int)) (let ((.cse43 (div v_~a14~0_1227 (- 5)))) (let ((.cse42 (* 10 .cse43))) (and (<= 0 (+ .cse42 3221490)) (<= (div (+ (* .cse43 10) 3221480) 9) ~a14~0) (not (= (mod v_~a14~0_1227 (- 5)) 0)) (< v_~a14~0_1227 0) (<= (+ v_~a14~0_1227 84) 0) (<= 0 (+ .cse42 3221480))))))) (.cse0 (and .cse14 .cse15 .cse6)) (.cse20 (and .cse12 .cse25 .cse7 .cse3)) (.cse5 (<= (+ ~a26~0 68) 0)) (.cse30 (<= ~a28~0 279)) (.cse31 (and .cse7 (<= 183 ~a28~0) .cse3)) (.cse13 (<= ~a26~0 222)) (.cse2 (<= ~a26~0 217)) (.cse32 (and .cse38 .cse7)) (.cse28 (<= 0 (+ (div (+ ~a14~0 459561) 5) 113))) (.cse21 (or (<= ~a28~0 37) .cse8)) (.cse18 (< 217 ~a26~0)) (.cse24 (<= 0 (+ ~a14~0 79))) (.cse33 (<= .cse41 0)) (.cse9 (< 0 .cse40)) (.cse37 (<= (div (+ .cse39 596057) (- 5)) 124)) (.cse1 (= ~a24~0 3)) (.cse19 (<= ~a26~0 460652)) (.cse23 (<= 222 ~a26~0)) (.cse26 (<= ~a26~0 599553)) (.cse11 (<= ~a26~0 124)) (.cse22 (<= ~a14~0 364756)) (.cse17 (or (and .cse29 .cse4 .cse3) (and .cse34 .cse3))) (.cse16 (or .cse35 .cse6))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (or .cse5 .cse6)) (and .cse7 .cse2 .cse8 .cse3 .cse9) (and .cse1 .cse8 .cse3 .cse10 .cse11) (and (and (and .cse12 .cse13 .cse14 .cse15) .cse7) .cse3) (and (and (and .cse5 .cse7) .cse3) .cse16) (and .cse17 .cse2) (and .cse12 .cse7 .cse2 .cse3 .cse15) (and .cse18 (and .cse19 .cse20)) (and .cse21 (and .cse7 .cse22 .cse23 .cse24 .cse3)) (and .cse7 .cse10 .cse3 .cse8) (and (and .cse18 .cse25 .cse1 .cse15 .cse3) .cse26) (and .cse4 .cse22 (= ~a26~0 222) .cse3) (and .cse7 .cse3 .cse11 .cse27) (and .cse7 .cse3 .cse16 .cse27) (and .cse28 (and .cse7 .cse0 .cse3)) (and .cse20 .cse14 .cse28 .cse26) (and .cse29 .cse7 .cse26 .cse3) (and .cse30 .cse28 .cse31 .cse6) (and (and .cse1 (and .cse5 .cse25) .cse3) (<= (+ ~a28~0 599901) 0)) (and .cse29 .cse25 .cse1 .cse26 .cse3) (and (and .cse32 .cse3) (<= (+ ~a26~0 600) 0)) (and .cse30 .cse31 .cse26 .cse6) (and .cse18 .cse7 .cse13 .cse33 .cse15 .cse3) (and (and (and .cse12 .cse14 .cse15 .cse24) .cse7) .cse3) (and .cse34 .cse8) (and .cse12 .cse1 .cse33 .cse2 .cse3 (or (not (= 2 ULTIMATE.start_calculate_output_~input)) .cse35) .cse9) (and (exists ((v_~a14~0_1230 Int)) (let ((.cse36 (* v_~a14~0_1230 9))) (and (<= (+ v_~a14~0_1230 182) 0) (< (* 9 v_~a14~0_1230) 0) (<= 0 (+ (div (+ v_~a14~0_1230 459561) 5) 113)) (not (= (mod .cse36 10) 0)) (<= (+ (div .cse36 10) 588353) ~a14~0)))) .cse32 .cse3) (and .cse7 .cse28 .cse23 .cse37 .cse3 .cse8 .cse15) (and .cse17 .cse21) (and .cse18 (and .cse19 .cse7 .cse22 .cse24 .cse3)) (and .cse33 .cse15 .cse4 .cse3) (and .cse38 .cse1 .cse33 .cse9 .cse3) (and .cse7 .cse9 .cse23 .cse37 .cse3 .cse8) (and .cse1 .cse15 .cse11 .cse3 .cse16) (and .cse7 .cse23 .cse3 .cse19 .cse15) (and (and (and (and .cse14 .cse15 .cse23) .cse7) .cse3) .cse26) (and .cse14 (and (and .cse25 .cse7) .cse3) .cse11) (and (or (and .cse34 .cse22 .cse3) (and .cse17 (<= ~a26~0 466645))) (<= (div (+ .cse39 557256) (- 20)) 124) .cse16)))))) [2019-11-15 21:37:26,730 INFO L443 ceAbstractionStarter]: For program point L202-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,730 INFO L443 ceAbstractionStarter]: For program point L70-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,730 INFO L443 ceAbstractionStarter]: For program point L995(lines 995 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,730 INFO L443 ceAbstractionStarter]: For program point L599(lines 599 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,730 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,730 INFO L443 ceAbstractionStarter]: For program point L2317(lines 2317 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,730 INFO L443 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-11-15 21:37:26,730 INFO L443 ceAbstractionStarter]: For program point L2185(lines 2185 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,731 INFO L443 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-11-15 21:37:26,731 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 605) no Hoare annotation was computed. [2019-11-15 21:37:26,731 INFO L443 ceAbstractionStarter]: For program point L600-2(lines 600 605) no Hoare annotation was computed. [2019-11-15 21:37:26,731 INFO L443 ceAbstractionStarter]: For program point L1525(lines 1525 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,731 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,731 INFO L443 ceAbstractionStarter]: For program point L2318(lines 2318 2329) no Hoare annotation was computed. [2019-11-15 21:37:26,731 INFO L443 ceAbstractionStarter]: For program point L2318-2(lines 2318 2329) no Hoare annotation was computed. [2019-11-15 21:37:26,731 INFO L443 ceAbstractionStarter]: For program point L2186(lines 2186 2196) no Hoare annotation was computed. [2019-11-15 21:37:26,731 INFO L443 ceAbstractionStarter]: For program point L2186-2(lines 2186 2196) no Hoare annotation was computed. [2019-11-15 21:37:26,732 INFO L443 ceAbstractionStarter]: For program point L1922(lines 1922 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,732 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,732 INFO L443 ceAbstractionStarter]: For program point L1262(lines 1262 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,732 INFO L443 ceAbstractionStarter]: For program point L205-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,732 INFO L443 ceAbstractionStarter]: For program point L1130(lines 1130 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,732 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,732 INFO L443 ceAbstractionStarter]: For program point L1791(lines 1791 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,732 INFO L443 ceAbstractionStarter]: For program point L1659(lines 1659 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,732 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,732 INFO L443 ceAbstractionStarter]: For program point L206(line 206) no Hoare annotation was computed. [2019-11-15 21:37:26,732 INFO L443 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-11-15 21:37:26,732 INFO L443 ceAbstractionStarter]: For program point L999(lines 999 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,732 INFO L443 ceAbstractionStarter]: For program point L1792(lines 1792 1800) no Hoare annotation was computed. [2019-11-15 21:37:26,733 INFO L443 ceAbstractionStarter]: For program point L1792-2(lines 1792 1800) no Hoare annotation was computed. [2019-11-15 21:37:26,733 INFO L443 ceAbstractionStarter]: For program point L2585(line 2585) no Hoare annotation was computed. [2019-11-15 21:37:26,733 INFO L443 ceAbstractionStarter]: For program point L1396(lines 1396 1405) no Hoare annotation was computed. [2019-11-15 21:37:26,733 INFO L443 ceAbstractionStarter]: For program point L2453(lines 2453 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,733 INFO L443 ceAbstractionStarter]: For program point L1396-2(lines 1396 1405) no Hoare annotation was computed. [2019-11-15 21:37:26,733 INFO L443 ceAbstractionStarter]: For program point L2057(lines 2057 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,733 INFO L443 ceAbstractionStarter]: For program point L76-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,733 INFO L443 ceAbstractionStarter]: For program point L737(lines 737 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,733 INFO L443 ceAbstractionStarter]: For program point L77(line 77) no Hoare annotation was computed. [2019-11-15 21:37:26,733 INFO L443 ceAbstractionStarter]: For program point L1927(lines 1927 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,733 INFO L443 ceAbstractionStarter]: For program point L1663(lines 1663 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,734 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,734 INFO L443 ceAbstractionStarter]: For program point L1531(lines 1531 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,734 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,734 INFO L443 ceAbstractionStarter]: For program point L1267(lines 1267 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,734 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,734 INFO L443 ceAbstractionStarter]: For program point L871(lines 871 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,735 INFO L443 ceAbstractionStarter]: For program point L607(lines 607 617) no Hoare annotation was computed. [2019-11-15 21:37:26,735 INFO L443 ceAbstractionStarter]: For program point L607-2(lines 607 617) no Hoare annotation was computed. [2019-11-15 21:37:26,735 INFO L443 ceAbstractionStarter]: For program point L475(lines 475 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,735 INFO L443 ceAbstractionStarter]: For program point L79-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,735 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-15 21:37:26,735 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,735 INFO L443 ceAbstractionStarter]: For program point L2063(lines 2063 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,736 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,736 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,736 INFO L443 ceAbstractionStarter]: For program point L2460(lines 2460 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,736 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,736 INFO L443 ceAbstractionStarter]: For program point L1932(lines 1932 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,736 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,736 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,736 INFO L443 ceAbstractionStarter]: For program point L1272(lines 1272 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,737 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,737 INFO L443 ceAbstractionStarter]: For program point L2197(lines 2197 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,737 INFO L443 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-11-15 21:37:26,737 INFO L443 ceAbstractionStarter]: For program point L1933(lines 1933 1944) no Hoare annotation was computed. [2019-11-15 21:37:26,737 INFO L443 ceAbstractionStarter]: For program point L1933-2(lines 1933 1944) no Hoare annotation was computed. [2019-11-15 21:37:26,737 INFO L443 ceAbstractionStarter]: For program point L1801(lines 1801 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,737 INFO L443 ceAbstractionStarter]: For program point L2330(lines 2330 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,737 INFO L443 ceAbstractionStarter]: For program point L1670(lines 1670 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,738 INFO L443 ceAbstractionStarter]: For program point L1538(lines 1538 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,738 INFO L443 ceAbstractionStarter]: For program point L1406(lines 1406 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,738 INFO L443 ceAbstractionStarter]: For program point L1142(lines 1142 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,738 INFO L443 ceAbstractionStarter]: For program point L85-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,738 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:37:26,738 INFO L443 ceAbstractionStarter]: For program point L86(line 86) no Hoare annotation was computed. [2019-11-15 21:37:26,738 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,739 INFO L443 ceAbstractionStarter]: For program point L2069(lines 2069 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,739 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,739 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,739 INFO L443 ceAbstractionStarter]: For program point L2334(lines 2334 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,739 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,739 INFO L443 ceAbstractionStarter]: For program point L88-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,739 INFO L443 ceAbstractionStarter]: For program point L749(lines 749 760) no Hoare annotation was computed. [2019-11-15 21:37:26,739 INFO L443 ceAbstractionStarter]: For program point L749-2(lines 749 760) no Hoare annotation was computed. [2019-11-15 21:37:26,740 INFO L443 ceAbstractionStarter]: For program point L2467(lines 2467 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,740 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,740 INFO L443 ceAbstractionStarter]: For program point L2203(lines 2203 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,740 INFO L443 ceAbstractionStarter]: For program point L89(line 89) no Hoare annotation was computed. [2019-11-15 21:37:26,740 INFO L443 ceAbstractionStarter]: For program point L1807(lines 1807 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,740 INFO L443 ceAbstractionStarter]: For program point L618(lines 618 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,740 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,740 INFO L443 ceAbstractionStarter]: For program point L1279(lines 1279 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,741 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,741 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,741 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,741 INFO L443 ceAbstractionStarter]: For program point L884(lines 884 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,741 INFO L443 ceAbstractionStarter]: For program point L1677(lines 1677 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,741 INFO L443 ceAbstractionStarter]: For program point L1545(lines 1545 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,741 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,742 INFO L443 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-11-15 21:37:26,742 INFO L443 ceAbstractionStarter]: For program point L2074(lines 2074 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,742 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1027) no Hoare annotation was computed. [2019-11-15 21:37:26,742 INFO L443 ceAbstractionStarter]: For program point L1017-2(lines 1017 1027) no Hoare annotation was computed. [2019-11-15 21:37:26,742 INFO L443 ceAbstractionStarter]: For program point L1546(lines 1546 1550) no Hoare annotation was computed. [2019-11-15 21:37:26,742 INFO L443 ceAbstractionStarter]: For program point L1546-2(lines 1546 1550) no Hoare annotation was computed. [2019-11-15 21:37:26,742 INFO L443 ceAbstractionStarter]: For program point L1414(lines 1414 1423) no Hoare annotation was computed. [2019-11-15 21:37:26,742 INFO L443 ceAbstractionStarter]: For program point L1414-2(lines 1414 1423) no Hoare annotation was computed. [2019-11-15 21:37:26,743 INFO L443 ceAbstractionStarter]: For program point L2339(lines 2339 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,743 INFO L443 ceAbstractionStarter]: For program point L2075(lines 2075 2085) no Hoare annotation was computed. [2019-11-15 21:37:26,743 INFO L443 ceAbstractionStarter]: For program point L2075-2(lines 2075 2085) no Hoare annotation was computed. [2019-11-15 21:37:26,743 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,743 INFO L443 ceAbstractionStarter]: For program point L2472(lines 2472 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,743 INFO L443 ceAbstractionStarter]: For program point L2340(lines 2340 2350) no Hoare annotation was computed. [2019-11-15 21:37:26,743 INFO L443 ceAbstractionStarter]: For program point L2340-2(lines 2340 2350) no Hoare annotation was computed. [2019-11-15 21:37:26,743 INFO L443 ceAbstractionStarter]: For program point L94-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,744 INFO L443 ceAbstractionStarter]: For program point L1812(lines 1812 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,744 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,744 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,744 INFO L443 ceAbstractionStarter]: For program point L2209(lines 2209 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,744 INFO L443 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-11-15 21:37:26,744 INFO L443 ceAbstractionStarter]: For program point L1945(lines 1945 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,744 INFO L443 ceAbstractionStarter]: For program point L360(lines 360 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,744 INFO L443 ceAbstractionStarter]: For program point L228(lines 228 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,745 INFO L443 ceAbstractionStarter]: For program point L2210(lines 2210 2219) no Hoare annotation was computed. [2019-11-15 21:37:26,745 INFO L443 ceAbstractionStarter]: For program point L2210-2(lines 2210 2219) no Hoare annotation was computed. [2019-11-15 21:37:26,745 INFO L443 ceAbstractionStarter]: For program point L1682(lines 1682 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,745 INFO L443 ceAbstractionStarter]: For program point L625(lines 625 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,745 INFO L443 ceAbstractionStarter]: For program point L2475(lines 2475 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,745 INFO L443 ceAbstractionStarter]: For program point L97-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,745 INFO L443 ceAbstractionStarter]: For program point L1683(lines 1683 1693) no Hoare annotation was computed. [2019-11-15 21:37:26,745 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 633) no Hoare annotation was computed. [2019-11-15 21:37:26,746 INFO L443 ceAbstractionStarter]: For program point L1683-2(lines 1683 1693) no Hoare annotation was computed. [2019-11-15 21:37:26,746 INFO L443 ceAbstractionStarter]: For program point L626-2(lines 626 633) no Hoare annotation was computed. [2019-11-15 21:37:26,746 INFO L443 ceAbstractionStarter]: For program point L1551(lines 1551 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,746 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-11-15 21:37:26,746 INFO L443 ceAbstractionStarter]: For program point L891(lines 891 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,746 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,746 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 24 1644) no Hoare annotation was computed. [2019-11-15 21:37:26,747 INFO L443 ceAbstractionStarter]: For program point L1950(lines 1950 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,747 INFO L443 ceAbstractionStarter]: For program point L1818(lines 1818 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,747 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,747 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1642) no Hoare annotation was computed. [2019-11-15 21:37:26,747 INFO L443 ceAbstractionStarter]: For program point L2479(lines 2479 2570) no Hoare annotation was computed. [2019-11-15 21:37:26,747 INFO L443 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-11-15 21:37:26,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,761 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,763 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,764 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,767 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,806 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,819 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,819 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,824 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,824 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,824 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,825 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,826 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,827 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,827 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,827 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,827 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,828 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,832 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,833 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,834 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:26,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:26,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:37:26 BoogieIcfgContainer [2019-11-15 21:37:26,849 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:37:26,849 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:37:26,849 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:37:26,849 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:37:26,850 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:28:29" (3/4) ... [2019-11-15 21:37:26,853 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:37:26,893 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-15 21:37:26,898 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 21:37:26,929 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((a28 <= 134 && 37 < a28) && a14 + 182 <= 0) && a24 == 3) && a26 <= 217) && a21 <= 124) || (a24 <= 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || ((((a24 == 2 && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124) && 0 < a14 + 182)) || ((((a24 == 3 && a14 + 84 <= 0) && a21 <= 124) && 0 < a14 + 114) && a26 <= 124)) || (((((124 < a26 && a26 <= 222) && a28 <= 134) && 37 < a28) && a24 == 2) && a21 <= 124)) || (((a26 + 68 <= 0 && a24 == 2) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || ((((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)) && a26 <= 217)) || ((((124 < a26 && a24 == 2) && a26 <= 217) && a21 <= 124) && 37 < a28)) || (217 < a26 && a26 <= 460652 && ((124 < a26 && a14 + 183 <= 0) && a24 == 2) && a21 <= 124)) || ((a28 <= 37 || a14 + 84 <= 0) && (((a24 == 2 && a14 <= 364756) && 222 <= a26) && 0 <= a14 + 79) && a21 <= 124)) || (((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((((217 < a26 && a14 + 183 <= 0) && a24 == 3) && 37 < a28) && a21 <= 124) && a26 <= 599553)) || (((a24 <= 1 && a14 <= 364756) && a26 == 222) && a21 <= 124)) || (((a24 == 2 && a21 <= 124) && a26 <= 124) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || (((a24 == 2 && a21 <= 124) && (134 < a28 || a14 + 182 <= 0)) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || (0 <= (a14 + 459561) / 5 + 113 && (a24 == 2 && (a28 <= 134 && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || ((((((124 < a26 && a14 + 183 <= 0) && a24 == 2) && a21 <= 124) && a28 <= 134) && 0 <= (a14 + 459561) / 5 + 113) && a26 <= 599553)) || (((301 <= a28 && a24 == 2) && a26 <= 599553) && a21 <= 124)) || (((a28 <= 279 && 0 <= (a14 + 459561) / 5 + 113) && (a24 == 2 && 183 <= a28) && a21 <= 124) && a14 + 182 <= 0)) || (((a24 == 3 && a26 + 68 <= 0 && a14 + 183 <= 0) && a21 <= 124) && a28 + 599901 <= 0)) || ((((301 <= a28 && a14 + 183 <= 0) && a24 == 3) && a26 <= 599553) && a21 <= 124)) || ((((a28 <= 134 && 37 < a28) && a24 == 2) && a21 <= 124) && a26 + 600 <= 0)) || (((a28 <= 279 && (a24 == 2 && 183 <= a28) && a21 <= 124) && a26 <= 599553) && a14 + 182 <= 0)) || (((((217 < a26 && a24 == 2) && a26 <= 222) && a14 + 114 <= 0) && 37 < a28) && a21 <= 124)) || (((((124 < a26 && a28 <= 134) && 37 < a28) && 0 <= a14 + 79) && a24 == 2) && a21 <= 124)) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a14 + 84 <= 0)) || ((((((124 < a26 && a24 == 3) && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && (!(2 == input) || 134 < a28)) && 0 < a14 + 182)) || (((\exists v_~a14~0_1230 : int :: (((v_~a14~0_1230 + 182 <= 0 && 9 * v_~a14~0_1230 < 0) && 0 <= (v_~a14~0_1230 + 459561) / 5 + 113) && !(v_~a14~0_1230 * 9 % 10 == 0)) && v_~a14~0_1230 * 9 / 10 + 588353 <= a14) && (a28 <= 134 && 37 < a28) && a24 == 2) && a21 <= 124)) || ((((((a24 == 2 && 0 <= (a14 + 459561) / 5 + 113) && 222 <= a26) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a14 + 84 <= 0) && 37 < a28)) || ((((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)) && (a28 <= 37 || a14 + 84 <= 0))) || (217 < a26 && (((a26 <= 460652 && a24 == 2) && a14 <= 364756) && 0 <= a14 + 79) && a21 <= 124)) || (((a14 + 114 <= 0 && 37 < a28) && a24 <= 1) && a21 <= 124)) || (((((a28 <= 134 && 37 < a28) && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 182) && 222 <= a26) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a14 + 84 <= 0)) || ((((a24 == 3 && 37 < a28) && a26 <= 124) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || ((((a24 == 2 && 222 <= a26) && a21 <= 124) && a26 <= 460652) && 37 < a28)) || (((((a28 <= 134 && 37 < a28) && 222 <= a26) && a24 == 2) && a21 <= 124) && a26 <= 599553)) || ((a28 <= 134 && (a14 + 183 <= 0 && a24 == 2) && a21 <= 124) && a26 <= 124)) || ((((((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a14 <= 364756) && a21 <= 124) || ((((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)) && a26 <= 466645)) && (-a26 + 557256) / -20 <= 124) && (134 < a28 || a14 + 182 <= 0)) [2019-11-15 21:37:26,933 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((a28 <= 134 && 37 < a28) && a14 + 182 <= 0) && a24 == 3) && a26 <= 217) && a21 <= 124) || (a24 <= 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || ((((a24 == 2 && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124) && 0 < a14 + 182)) || ((((a24 == 3 && a14 + 84 <= 0) && a21 <= 124) && 0 < a14 + 114) && a26 <= 124)) || (((((124 < a26 && a26 <= 222) && a28 <= 134) && 37 < a28) && a24 == 2) && a21 <= 124)) || (((a26 + 68 <= 0 && a24 == 2) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || ((((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)) && a26 <= 217)) || ((((124 < a26 && a24 == 2) && a26 <= 217) && a21 <= 124) && 37 < a28)) || (217 < a26 && a26 <= 460652 && ((124 < a26 && a14 + 183 <= 0) && a24 == 2) && a21 <= 124)) || ((a28 <= 37 || a14 + 84 <= 0) && (((a24 == 2 && a14 <= 364756) && 222 <= a26) && 0 <= a14 + 79) && a21 <= 124)) || (((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((((217 < a26 && a14 + 183 <= 0) && a24 == 3) && 37 < a28) && a21 <= 124) && a26 <= 599553)) || (((a24 == 2 && a21 <= 124) && a26 <= 124) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || (((a24 == 2 && a21 <= 124) && (134 < a28 || a14 + 182 <= 0)) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || (0 <= (a14 + 459561) / 5 + 113 && (a24 == 2 && (a28 <= 134 && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || ((((((124 < a26 && a14 + 183 <= 0) && a24 == 2) && a21 <= 124) && a28 <= 134) && 0 <= (a14 + 459561) / 5 + 113) && a26 <= 599553)) || (((301 <= a28 && a24 == 2) && a26 <= 599553) && a21 <= 124)) || (((a24 <= 1 && a14 <= 364756) && a26 == 222) && a21 <= 124)) || (((a28 <= 279 && 0 <= (a14 + 459561) / 5 + 113) && (a24 == 2 && 183 <= a28) && a21 <= 124) && a14 + 182 <= 0)) || (((a24 == 3 && a26 + 68 <= 0 && a14 + 183 <= 0) && a21 <= 124) && a28 + 599901 <= 0)) || ((((301 <= a28 && a14 + 183 <= 0) && a24 == 3) && a26 <= 599553) && a21 <= 124)) || ((((a28 <= 134 && 37 < a28) && a24 == 2) && a21 <= 124) && a26 + 600 <= 0)) || (((a28 <= 279 && (a24 == 2 && 183 <= a28) && a21 <= 124) && a26 <= 599553) && a14 + 182 <= 0)) || (((((217 < a26 && a24 == 2) && a26 <= 222) && a14 + 114 <= 0) && 37 < a28) && a21 <= 124)) || (((((124 < a26 && a28 <= 134) && 37 < a28) && 0 <= a14 + 79) && a24 == 2) && a21 <= 124)) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a14 + 84 <= 0)) || ((((((124 < a26 && a24 == 3) && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && (!(2 == input) || 134 < a28)) && 0 < a14 + 182)) || (((\exists v_~a14~0_1230 : int :: (((v_~a14~0_1230 + 182 <= 0 && 9 * v_~a14~0_1230 < 0) && 0 <= (v_~a14~0_1230 + 459561) / 5 + 113) && !(v_~a14~0_1230 * 9 % 10 == 0)) && v_~a14~0_1230 * 9 / 10 + 588353 <= a14) && (a28 <= 134 && 37 < a28) && a24 == 2) && a21 <= 124)) || ((((((a24 == 2 && 0 <= (a14 + 459561) / 5 + 113) && 222 <= a26) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a14 + 84 <= 0) && 37 < a28)) || ((((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)) && (a28 <= 37 || a14 + 84 <= 0))) || (217 < a26 && (((a26 <= 460652 && a24 == 2) && a14 <= 364756) && 0 <= a14 + 79) && a21 <= 124)) || (((a14 + 114 <= 0 && 37 < a28) && a24 <= 1) && a21 <= 124)) || (((((a28 <= 134 && 37 < a28) && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 182) && 222 <= a26) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a14 + 84 <= 0)) || ((((a24 == 3 && 37 < a28) && a26 <= 124) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || ((((a24 == 2 && 222 <= a26) && a21 <= 124) && a26 <= 460652) && 37 < a28)) || (((((a28 <= 134 && 37 < a28) && 222 <= a26) && a24 == 2) && a21 <= 124) && a26 <= 599553)) || ((a28 <= 134 && (a14 + 183 <= 0 && a24 == 2) && a21 <= 124) && a26 <= 124)) || ((((((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a14 <= 364756) && a21 <= 124) || ((((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)) && a26 <= 466645)) && (-a26 + 557256) / -20 <= 124) && (134 < a28 || a14 + 182 <= 0)) [2019-11-15 21:37:26,943 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((a28 <= 134 && 37 < a28) && a14 + 182 <= 0) && a24 == 3) && a26 <= 217) && a21 <= 124) || (a24 <= 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || ((((a24 == 2 && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124) && 0 < a14 + 182)) || ((((a24 == 2 && 222 <= a26) && a21 <= 124) && a26 <= 460652) && 37 < a28)) || ((((a24 == 3 && a14 + 84 <= 0) && a21 <= 124) && 0 < a14 + 114) && a26 <= 124)) || (((((124 < a26 && a26 <= 222) && a28 <= 134) && 37 < a28) && a24 == 2) && a21 <= 124)) || (((a26 + 68 <= 0 && a24 == 2) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || (a28 + 599901 <= 0 && (a24 == 3 && a26 + 68 <= 0 && a14 + 183 <= 0) && a21 <= 124)) || ((((124 < a26 && a24 == 2) && a26 <= 217) && a21 <= 124) && 37 < a28)) || ((a28 <= 37 || a14 + 84 <= 0) && (((a24 == 2 && a14 <= 364756) && 222 <= a26) && 0 <= a14 + 79) && a21 <= 124)) || (((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((((217 < a26 && a14 + 183 <= 0) && a24 == 3) && 37 < a28) && a21 <= 124) && a26 <= 599553)) || (((a24 == 2 && a21 <= 124) && a26 <= 124) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || (((a24 == 2 && (134 < a28 || a14 + 182 <= 0)) && a21 <= 124) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || ((((((124 < a26 && a14 + 183 <= 0) && a24 == 2) && a21 <= 124) && a28 <= 134) && 0 <= (a14 + 459561) / 5 + 113) && a26 <= 599553)) || (((301 <= a28 && a24 == 2) && a26 <= 599553) && a21 <= 124)) || ((((((124 < a26 && a26 <= 222) && a24 <= 1) || ((a26 <= 222 && 0 < a14 + 114) && a24 <= 1)) && a14 <= 364756) && a26 == 222) && a21 <= 124)) || (((a28 <= 279 && 0 <= (a14 + 459561) / 5 + 113) && (a24 == 2 && 183 <= a28) && a21 <= 124) && a14 + 182 <= 0)) || ((((301 <= a28 && a14 + 183 <= 0) && a24 == 3) && a26 <= 599553) && a21 <= 124)) || ((((a28 <= 134 && 37 < a28) && a24 == 2) && a21 <= 124) && a26 + 600 <= 0)) || ((a28 <= 37 || a14 + 84 <= 0) && (((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)))) || (((a28 <= 279 && (a24 == 2 && 183 <= a28) && a21 <= 124) && a26 <= 599553) && a14 + 182 <= 0)) || (((((217 < a26 && a24 == 2) && a26 <= 222) && a14 + 114 <= 0) && 37 < a28) && a21 <= 124)) || (((((124 < a26 && a28 <= 134) && 37 < a28) && 0 <= a14 + 79) && a24 == 2) && a21 <= 124)) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a14 + 84 <= 0)) || ((((((124 < a26 && a24 == 3) && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && (!(2 == input) || 134 < a28)) && 0 < a14 + 182)) || ((((((a24 == 2 && 0 <= (a14 + 459561) / 5 + 113) && 222 <= a26) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a14 + 84 <= 0) && 37 < a28)) || (217 < a26 && (((a26 <= 460652 && a24 == 2) && a14 <= 364756) && 0 <= a14 + 79) && a21 <= 124)) || (((((124 < a26 && a26 <= 222) && a24 <= 1) || ((a26 <= 222 && 0 < a14 + 114) && a24 <= 1)) && a21 <= 124) && a26 <= 217)) || (((a14 + 114 <= 0 && 37 < a28) && a24 <= 1) && a21 <= 124)) || (((((a28 <= 134 && 37 < a28) && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124)) || (217 < a26 && a26 <= 460652 && ((124 < a26 && a14 + 183 <= 0) && a24 == 2) && a21 <= 124)) || (((\exists v_~a14~0_1230 : int :: (((v_~a14~0_1230 + 182 <= 0 && 9 * v_~a14~0_1230 < 0) && 0 <= (v_~a14~0_1230 + 459561) / 5 + 113) && !(v_~a14~0_1230 * 9 % 10 == 0)) && v_~a14~0_1230 * 9 / 10 + 588353 <= a14) && (a28 <= 134 && 37 < a28) && a24 == 2) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 182) && 222 <= a26) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a14 + 84 <= 0)) || ((((a24 == 3 && 37 < a28) && a26 <= 124) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || (((((a28 <= 134 && 37 < a28) && 222 <= a26) && a24 == 2) && a21 <= 124) && a26 <= 599553)) || ((a28 <= 134 && (a14 + 183 <= 0 && a24 == 2) && a21 <= 124) && a26 <= 124)) || ((((((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a14 <= 364756) && a21 <= 124) || ((((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)) && a26 <= 466645)) && (-a26 + 557256) / -20 <= 124) && (134 < a28 || a14 + 182 <= 0))) || (((((a24 == 2 && 37 < a28) && a21 <= 124) && a28 <= 134) && 0 <= (a14 + 459561) / 5 + 113) && a14 + 182 <= 0) [2019-11-15 21:37:27,251 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_41f7494b-0991-4529-909a-e0a8a7fa42e4/bin/uautomizer/witness.graphml [2019-11-15 21:37:27,251 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:37:27,252 INFO L168 Benchmark]: Toolchain (without parser) took 543968.69 ms. Allocated memory was 1.0 GB in the beginning and 5.9 GB in the end (delta: 4.9 GB). Free memory was 933.8 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-11-15 21:37:27,252 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:37:27,253 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1711.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 933.8 MB in the beginning and 1.0 GB in the end (delta: -86.2 MB). Peak memory consumption was 75.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:37:27,253 INFO L168 Benchmark]: Boogie Procedure Inliner took 292.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 959.4 MB in the end (delta: 60.7 MB). Peak memory consumption was 60.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:37:27,253 INFO L168 Benchmark]: Boogie Preprocessor took 287.04 ms. Allocated memory is still 1.2 GB. Free memory was 959.4 MB in the beginning and 927.1 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:37:27,254 INFO L168 Benchmark]: RCFGBuilder took 4381.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 101.7 MB). Free memory was 927.1 MB in the beginning and 1.0 GB in the end (delta: -100.0 MB). Peak memory consumption was 111.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:37:27,254 INFO L168 Benchmark]: TraceAbstraction took 536886.57 ms. Allocated memory was 1.3 GB in the beginning and 5.9 GB in the end (delta: 4.6 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.7 GB. Max. memory is 11.5 GB. [2019-11-15 21:37:27,255 INFO L168 Benchmark]: Witness Printer took 401.86 ms. Allocated memory is still 5.9 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 107.3 MB). Peak memory consumption was 107.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:37:27,257 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1711.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 933.8 MB in the beginning and 1.0 GB in the end (delta: -86.2 MB). Peak memory consumption was 75.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 292.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 959.4 MB in the end (delta: 60.7 MB). Peak memory consumption was 60.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 287.04 ms. Allocated memory is still 1.2 GB. Free memory was 959.4 MB in the beginning and 927.1 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4381.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 101.7 MB). Free memory was 927.1 MB in the beginning and 1.0 GB in the end (delta: -100.0 MB). Peak memory consumption was 111.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 536886.57 ms. Allocated memory was 1.3 GB in the beginning and 5.9 GB in the end (delta: 4.6 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.7 GB. Max. memory is 11.5 GB. * Witness Printer took 401.86 ms. Allocated memory is still 5.9 GB. Free memory was 3.1 GB in the beginning and 3.0 GB in the end (delta: 107.3 MB). Peak memory consumption was 107.3 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_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 134]: 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: 2574]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2580]: Loop Invariant [2019-11-15 21:37:27,274 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,275 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,275 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,275 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,276 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,277 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,278 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,279 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,279 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,279 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,286 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,286 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,286 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,286 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((a28 <= 134 && 37 < a28) && a14 + 182 <= 0) && a24 == 3) && a26 <= 217) && a21 <= 124) || (a24 <= 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || ((((a24 == 2 && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124) && 0 < a14 + 182)) || ((((a24 == 3 && a14 + 84 <= 0) && a21 <= 124) && 0 < a14 + 114) && a26 <= 124)) || (((((124 < a26 && a26 <= 222) && a28 <= 134) && 37 < a28) && a24 == 2) && a21 <= 124)) || (((a26 + 68 <= 0 && a24 == 2) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || ((((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)) && a26 <= 217)) || ((((124 < a26 && a24 == 2) && a26 <= 217) && a21 <= 124) && 37 < a28)) || (217 < a26 && a26 <= 460652 && ((124 < a26 && a14 + 183 <= 0) && a24 == 2) && a21 <= 124)) || ((a28 <= 37 || a14 + 84 <= 0) && (((a24 == 2 && a14 <= 364756) && 222 <= a26) && 0 <= a14 + 79) && a21 <= 124)) || (((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((((217 < a26 && a14 + 183 <= 0) && a24 == 3) && 37 < a28) && a21 <= 124) && a26 <= 599553)) || (((a24 <= 1 && a14 <= 364756) && a26 == 222) && a21 <= 124)) || (((a24 == 2 && a21 <= 124) && a26 <= 124) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || (((a24 == 2 && a21 <= 124) && (134 < a28 || a14 + 182 <= 0)) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || (0 <= (a14 + 459561) / 5 + 113 && (a24 == 2 && (a28 <= 134 && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || ((((((124 < a26 && a14 + 183 <= 0) && a24 == 2) && a21 <= 124) && a28 <= 134) && 0 <= (a14 + 459561) / 5 + 113) && a26 <= 599553)) || (((301 <= a28 && a24 == 2) && a26 <= 599553) && a21 <= 124)) || (((a28 <= 279 && 0 <= (a14 + 459561) / 5 + 113) && (a24 == 2 && 183 <= a28) && a21 <= 124) && a14 + 182 <= 0)) || (((a24 == 3 && a26 + 68 <= 0 && a14 + 183 <= 0) && a21 <= 124) && a28 + 599901 <= 0)) || ((((301 <= a28 && a14 + 183 <= 0) && a24 == 3) && a26 <= 599553) && a21 <= 124)) || ((((a28 <= 134 && 37 < a28) && a24 == 2) && a21 <= 124) && a26 + 600 <= 0)) || (((a28 <= 279 && (a24 == 2 && 183 <= a28) && a21 <= 124) && a26 <= 599553) && a14 + 182 <= 0)) || (((((217 < a26 && a24 == 2) && a26 <= 222) && a14 + 114 <= 0) && 37 < a28) && a21 <= 124)) || (((((124 < a26 && a28 <= 134) && 37 < a28) && 0 <= a14 + 79) && a24 == 2) && a21 <= 124)) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a14 + 84 <= 0)) || ((((((124 < a26 && a24 == 3) && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && (!(2 == input) || 134 < a28)) && 0 < a14 + 182)) || (((\exists v_~a14~0_1230 : int :: (((v_~a14~0_1230 + 182 <= 0 && 9 * v_~a14~0_1230 < 0) && 0 <= (v_~a14~0_1230 + 459561) / 5 + 113) && !(v_~a14~0_1230 * 9 % 10 == 0)) && v_~a14~0_1230 * 9 / 10 + 588353 <= a14) && (a28 <= 134 && 37 < a28) && a24 == 2) && a21 <= 124)) || ((((((a24 == 2 && 0 <= (a14 + 459561) / 5 + 113) && 222 <= a26) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a14 + 84 <= 0) && 37 < a28)) || ((((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)) && (a28 <= 37 || a14 + 84 <= 0))) || (217 < a26 && (((a26 <= 460652 && a24 == 2) && a14 <= 364756) && 0 <= a14 + 79) && a21 <= 124)) || (((a14 + 114 <= 0 && 37 < a28) && a24 <= 1) && a21 <= 124)) || (((((a28 <= 134 && 37 < a28) && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 182) && 222 <= a26) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a14 + 84 <= 0)) || ((((a24 == 3 && 37 < a28) && a26 <= 124) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || ((((a24 == 2 && 222 <= a26) && a21 <= 124) && a26 <= 460652) && 37 < a28)) || (((((a28 <= 134 && 37 < a28) && 222 <= a26) && a24 == 2) && a21 <= 124) && a26 <= 599553)) || ((a28 <= 134 && (a14 + 183 <= 0 && a24 == 2) && a21 <= 124) && a26 <= 124)) || ((((((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a14 <= 364756) && a21 <= 124) || ((((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)) && a26 <= 466645)) && (-a26 + 557256) / -20 <= 124) && (134 < a28 || a14 + 182 <= 0)) - InvariantResult [Line: 1646]: Loop Invariant [2019-11-15 21:37:27,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,292 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,292 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,292 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,293 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,293 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,293 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,294 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,294 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,294 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,299 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,299 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,299 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((a28 <= 134 && 37 < a28) && a14 + 182 <= 0) && a24 == 3) && a26 <= 217) && a21 <= 124) || (a24 <= 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || ((((a24 == 2 && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124) && 0 < a14 + 182)) || ((((a24 == 2 && 222 <= a26) && a21 <= 124) && a26 <= 460652) && 37 < a28)) || ((((a24 == 3 && a14 + 84 <= 0) && a21 <= 124) && 0 < a14 + 114) && a26 <= 124)) || (((((124 < a26 && a26 <= 222) && a28 <= 134) && 37 < a28) && a24 == 2) && a21 <= 124)) || (((a26 + 68 <= 0 && a24 == 2) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || (a28 + 599901 <= 0 && (a24 == 3 && a26 + 68 <= 0 && a14 + 183 <= 0) && a21 <= 124)) || ((((124 < a26 && a24 == 2) && a26 <= 217) && a21 <= 124) && 37 < a28)) || ((a28 <= 37 || a14 + 84 <= 0) && (((a24 == 2 && a14 <= 364756) && 222 <= a26) && 0 <= a14 + 79) && a21 <= 124)) || (((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((((217 < a26 && a14 + 183 <= 0) && a24 == 3) && 37 < a28) && a21 <= 124) && a26 <= 599553)) || (((a24 == 2 && a21 <= 124) && a26 <= 124) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || (((a24 == 2 && (134 < a28 || a14 + 182 <= 0)) && a21 <= 124) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || ((((((124 < a26 && a14 + 183 <= 0) && a24 == 2) && a21 <= 124) && a28 <= 134) && 0 <= (a14 + 459561) / 5 + 113) && a26 <= 599553)) || (((301 <= a28 && a24 == 2) && a26 <= 599553) && a21 <= 124)) || ((((((124 < a26 && a26 <= 222) && a24 <= 1) || ((a26 <= 222 && 0 < a14 + 114) && a24 <= 1)) && a14 <= 364756) && a26 == 222) && a21 <= 124)) || (((a28 <= 279 && 0 <= (a14 + 459561) / 5 + 113) && (a24 == 2 && 183 <= a28) && a21 <= 124) && a14 + 182 <= 0)) || ((((301 <= a28 && a14 + 183 <= 0) && a24 == 3) && a26 <= 599553) && a21 <= 124)) || ((((a28 <= 134 && 37 < a28) && a24 == 2) && a21 <= 124) && a26 + 600 <= 0)) || ((a28 <= 37 || a14 + 84 <= 0) && (((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)))) || (((a28 <= 279 && (a24 == 2 && 183 <= a28) && a21 <= 124) && a26 <= 599553) && a14 + 182 <= 0)) || (((((217 < a26 && a24 == 2) && a26 <= 222) && a14 + 114 <= 0) && 37 < a28) && a21 <= 124)) || (((((124 < a26 && a28 <= 134) && 37 < a28) && 0 <= a14 + 79) && a24 == 2) && a21 <= 124)) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a14 + 84 <= 0)) || ((((((124 < a26 && a24 == 3) && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && (!(2 == input) || 134 < a28)) && 0 < a14 + 182)) || ((((((a24 == 2 && 0 <= (a14 + 459561) / 5 + 113) && 222 <= a26) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a14 + 84 <= 0) && 37 < a28)) || (217 < a26 && (((a26 <= 460652 && a24 == 2) && a14 <= 364756) && 0 <= a14 + 79) && a21 <= 124)) || (((((124 < a26 && a26 <= 222) && a24 <= 1) || ((a26 <= 222 && 0 < a14 + 114) && a24 <= 1)) && a21 <= 124) && a26 <= 217)) || (((a14 + 114 <= 0 && 37 < a28) && a24 <= 1) && a21 <= 124)) || (((((a28 <= 134 && 37 < a28) && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124)) || (217 < a26 && a26 <= 460652 && ((124 < a26 && a14 + 183 <= 0) && a24 == 2) && a21 <= 124)) || (((\exists v_~a14~0_1230 : int :: (((v_~a14~0_1230 + 182 <= 0 && 9 * v_~a14~0_1230 < 0) && 0 <= (v_~a14~0_1230 + 459561) / 5 + 113) && !(v_~a14~0_1230 * 9 % 10 == 0)) && v_~a14~0_1230 * 9 / 10 + 588353 <= a14) && (a28 <= 134 && 37 < a28) && a24 == 2) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 182) && 222 <= a26) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a14 + 84 <= 0)) || ((((a24 == 3 && 37 < a28) && a26 <= 124) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || (((((a28 <= 134 && 37 < a28) && 222 <= a26) && a24 == 2) && a21 <= 124) && a26 <= 599553)) || ((a28 <= 134 && (a14 + 183 <= 0 && a24 == 2) && a21 <= 124) && a26 <= 124)) || ((((((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a14 <= 364756) && a21 <= 124) || ((((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)) && a26 <= 466645)) && (-a26 + 557256) / -20 <= 124) && (134 < a28 || a14 + 182 <= 0))) || (((((a24 == 2 && 37 < a28) && a21 <= 124) && a28 <= 134) && 0 <= (a14 + 459561) / 5 + 113) && a14 + 182 <= 0) - InvariantResult [Line: 24]: Loop Invariant [2019-11-15 21:37:27,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,313 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,313 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,313 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,314 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,314 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,314 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-11-15 21:37:27,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-11-15 21:37:27,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((a28 <= 134 && 37 < a28) && a14 + 182 <= 0) && a24 == 3) && a26 <= 217) && a21 <= 124) || (a24 <= 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || ((((a24 == 2 && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124) && 0 < a14 + 182)) || ((((a24 == 3 && a14 + 84 <= 0) && a21 <= 124) && 0 < a14 + 114) && a26 <= 124)) || (((((124 < a26 && a26 <= 222) && a28 <= 134) && 37 < a28) && a24 == 2) && a21 <= 124)) || (((a26 + 68 <= 0 && a24 == 2) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || ((((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)) && a26 <= 217)) || ((((124 < a26 && a24 == 2) && a26 <= 217) && a21 <= 124) && 37 < a28)) || (217 < a26 && a26 <= 460652 && ((124 < a26 && a14 + 183 <= 0) && a24 == 2) && a21 <= 124)) || ((a28 <= 37 || a14 + 84 <= 0) && (((a24 == 2 && a14 <= 364756) && 222 <= a26) && 0 <= a14 + 79) && a21 <= 124)) || (((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((((217 < a26 && a14 + 183 <= 0) && a24 == 3) && 37 < a28) && a21 <= 124) && a26 <= 599553)) || (((a24 == 2 && a21 <= 124) && a26 <= 124) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || (((a24 == 2 && a21 <= 124) && (134 < a28 || a14 + 182 <= 0)) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || (0 <= (a14 + 459561) / 5 + 113 && (a24 == 2 && (a28 <= 134 && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || ((((((124 < a26 && a14 + 183 <= 0) && a24 == 2) && a21 <= 124) && a28 <= 134) && 0 <= (a14 + 459561) / 5 + 113) && a26 <= 599553)) || (((301 <= a28 && a24 == 2) && a26 <= 599553) && a21 <= 124)) || (((a24 <= 1 && a14 <= 364756) && a26 == 222) && a21 <= 124)) || (((a28 <= 279 && 0 <= (a14 + 459561) / 5 + 113) && (a24 == 2 && 183 <= a28) && a21 <= 124) && a14 + 182 <= 0)) || (((a24 == 3 && a26 + 68 <= 0 && a14 + 183 <= 0) && a21 <= 124) && a28 + 599901 <= 0)) || ((((301 <= a28 && a14 + 183 <= 0) && a24 == 3) && a26 <= 599553) && a21 <= 124)) || ((((a28 <= 134 && 37 < a28) && a24 == 2) && a21 <= 124) && a26 + 600 <= 0)) || (((a28 <= 279 && (a24 == 2 && 183 <= a28) && a21 <= 124) && a26 <= 599553) && a14 + 182 <= 0)) || (((((217 < a26 && a24 == 2) && a26 <= 222) && a14 + 114 <= 0) && 37 < a28) && a21 <= 124)) || (((((124 < a26 && a28 <= 134) && 37 < a28) && 0 <= a14 + 79) && a24 == 2) && a21 <= 124)) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a14 + 84 <= 0)) || ((((((124 < a26 && a24 == 3) && a14 + 114 <= 0) && a26 <= 217) && a21 <= 124) && (!(2 == input) || 134 < a28)) && 0 < a14 + 182)) || (((\exists v_~a14~0_1230 : int :: (((v_~a14~0_1230 + 182 <= 0 && 9 * v_~a14~0_1230 < 0) && 0 <= (v_~a14~0_1230 + 459561) / 5 + 113) && !(v_~a14~0_1230 * 9 % 10 == 0)) && v_~a14~0_1230 * 9 / 10 + 588353 <= a14) && (a28 <= 134 && 37 < a28) && a24 == 2) && a21 <= 124)) || ((((((a24 == 2 && 0 <= (a14 + 459561) / 5 + 113) && 222 <= a26) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a14 + 84 <= 0) && 37 < a28)) || ((((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)) && (a28 <= 37 || a14 + 84 <= 0))) || (217 < a26 && (((a26 <= 460652 && a24 == 2) && a14 <= 364756) && 0 <= a14 + 79) && a21 <= 124)) || (((a14 + 114 <= 0 && 37 < a28) && a24 <= 1) && a21 <= 124)) || (((((a28 <= 134 && 37 < a28) && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 182) && 222 <= a26) && (-a26 + 596057) / -5 <= 124) && a21 <= 124) && a14 + 84 <= 0)) || ((((a24 == 3 && 37 < a28) && a26 <= 124) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || ((((a24 == 2 && 222 <= a26) && a21 <= 124) && a26 <= 460652) && 37 < a28)) || (((((a28 <= 134 && 37 < a28) && 222 <= a26) && a24 == 2) && a21 <= 124) && a26 <= 599553)) || ((a28 <= 134 && (a14 + 183 <= 0 && a24 == 2) && a21 <= 124) && a26 <= 124)) || ((((((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a14 <= 364756) && a21 <= 124) || ((((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)) && a26 <= 466645)) && (-a26 + 557256) / -20 <= 124) && (134 < a28 || a14 + 182 <= 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 590 locations, 1 error locations. Result: SAFE, OverallTime: 536.7s, OverallIterations: 29, TraceHistogramMax: 11, AutomataDifference: 201.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 167.7s, HoareTripleCheckerStatistics: 9979 SDtfs, 33257 SDslu, 2992 SDs, 0 SdLazy, 92279 SolverSat, 13412 SolverUnsat, 25 SolverUnknown, 0 SolverNotchecked, 168.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22519 GetRequests, 22293 SyntacticMatches, 17 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131544occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 242755 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 1051 NumberOfFragments, 3334 HoareAnnotationTreeSize, 4 FomulaSimplifications, 28657869 FormulaSimplificationTreeSizeReduction, 33.7s HoareSimplificationTime, 4 FomulaSimplificationsInter, 20634663 FormulaSimplificationTreeSizeReductionInter, 133.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.5s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 70.5s InterpolantComputationTime, 53213 NumberOfCodeBlocks, 53213 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 53167 ConstructedInterpolants, 3111 QuantifiedInterpolants, 486629093 SizeOfPredicates, 11 NumberOfNonLiveVariables, 25754 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 46 InterpolantComputations, 26 PerfectInterpolantSequences, 100377/126185 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...