./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label12.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23cec877a36776c7adc8d7c2f2f1f13375e9850d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:28:14,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:28:14,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:28:14,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:28:14,864 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:28:14,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:28:14,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:28:14,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:28:14,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:28:14,870 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:28:14,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:28:14,872 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:28:14,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:28:14,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:28:14,873 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:28:14,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:28:14,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:28:14,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:28:14,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:28:14,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:28:14,879 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:28:14,880 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:28:14,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:28:14,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:28:14,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:28:14,883 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:28:14,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:28:14,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:28:14,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:28:14,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:28:14,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:28:14,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:28:14,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:28:14,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:28:14,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:28:14,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:28:14,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:28:14,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:28:14,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:28:14,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:28:14,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:28:14,890 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:28:14,902 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:28:14,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:28:14,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:28:14,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:28:14,903 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:28:14,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:28:14,904 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:28:14,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:28:14,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:28:14,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:28:14,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:28:14,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:28:14,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:28:14,905 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:28:14,905 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:28:14,906 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:28:14,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:28:14,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:28:14,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:28:14,906 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:28:14,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:28:14,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:28:14,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:28:14,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:28:14,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:28:14,907 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:28:14,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:28:14,908 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:28:14,908 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:28:14,908 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_b546ec7c-b964-4f8a-b061-9bbeefe78896/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 23cec877a36776c7adc8d7c2f2f1f13375e9850d [2019-12-07 16:28:15,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:28:15,023 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:28:15,025 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:28:15,026 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:28:15,027 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:28:15,027 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label12.c [2019-12-07 16:28:15,064 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/bin/uautomizer/data/c6fd1f4cb/4d256f20f8ee4bb7ba71bfacb105eb41/FLAG10017c0e3 [2019-12-07 16:28:15,504 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:28:15,504 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/sv-benchmarks/c/eca-rers2012/Problem15_label12.c [2019-12-07 16:28:15,517 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/bin/uautomizer/data/c6fd1f4cb/4d256f20f8ee4bb7ba71bfacb105eb41/FLAG10017c0e3 [2019-12-07 16:28:15,526 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/bin/uautomizer/data/c6fd1f4cb/4d256f20f8ee4bb7ba71bfacb105eb41 [2019-12-07 16:28:15,528 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:28:15,529 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:28:15,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:28:15,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:28:15,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:28:15,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:28:15" (1/1) ... [2019-12-07 16:28:15,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ad0b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:15, skipping insertion in model container [2019-12-07 16:28:15,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:28:15" (1/1) ... [2019-12-07 16:28:15,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:28:15,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:28:16,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:28:16,032 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:28:16,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:28:16,200 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:28:16,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:16 WrapperNode [2019-12-07 16:28:16,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:28:16,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:28:16,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:28:16,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:28:16,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:16" (1/1) ... [2019-12-07 16:28:16,233 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:16" (1/1) ... [2019-12-07 16:28:16,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:28:16,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:28:16,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:28:16,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:28:16,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:16" (1/1) ... [2019-12-07 16:28:16,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:16" (1/1) ... [2019-12-07 16:28:16,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:16" (1/1) ... [2019-12-07 16:28:16,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:16" (1/1) ... [2019-12-07 16:28:16,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:16" (1/1) ... [2019-12-07 16:28:16,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:16" (1/1) ... [2019-12-07 16:28:16,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:16" (1/1) ... [2019-12-07 16:28:16,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:28:16,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:28:16,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:28:16,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:28:16,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:28:16,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:28:16,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:28:18,101 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:28:18,101 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 16:28:18,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:28:18 BoogieIcfgContainer [2019-12-07 16:28:18,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:28:18,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:28:18,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:28:18,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:28:18,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:28:15" (1/3) ... [2019-12-07 16:28:18,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119b35c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:28:18, skipping insertion in model container [2019-12-07 16:28:18,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:28:16" (2/3) ... [2019-12-07 16:28:18,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119b35c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:28:18, skipping insertion in model container [2019-12-07 16:28:18,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:28:18" (3/3) ... [2019-12-07 16:28:18,106 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label12.c [2019-12-07 16:28:18,113 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:28:18,118 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:28:18,125 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:28:18,145 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:28:18,145 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:28:18,145 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:28:18,145 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:28:18,145 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:28:18,146 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:28:18,146 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:28:18,146 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:28:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-12-07 16:28:18,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 16:28:18,169 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:28:18,169 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:28:18,170 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:28:18,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:28:18,173 INFO L82 PathProgramCache]: Analyzing trace with hash 118092897, now seen corresponding path program 1 times [2019-12-07 16:28:18,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:28:18,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655638862] [2019-12-07 16:28:18,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:28:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:28:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:28:18,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655638862] [2019-12-07 16:28:18,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:28:18,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:28:18,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060124780] [2019-12-07 16:28:18,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:28:18,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:28:18,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:28:18,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:28:18,373 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-12-07 16:28:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:28:21,342 INFO L93 Difference]: Finished difference Result 1470 states and 2719 transitions. [2019-12-07 16:28:21,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:28:21,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 16:28:21,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:28:21,358 INFO L225 Difference]: With dead ends: 1470 [2019-12-07 16:28:21,358 INFO L226 Difference]: Without dead ends: 978 [2019-12-07 16:28:21,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:28:21,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-12-07 16:28:21,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2019-12-07 16:28:21,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-12-07 16:28:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1472 transitions. [2019-12-07 16:28:21,422 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1472 transitions. Word has length 59 [2019-12-07 16:28:21,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:28:21,423 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 1472 transitions. [2019-12-07 16:28:21,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:28:21,423 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1472 transitions. [2019-12-07 16:28:21,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-07 16:28:21,427 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:28:21,427 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:28:21,427 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:28:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:28:21,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1794665063, now seen corresponding path program 1 times [2019-12-07 16:28:21,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:28:21,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336782212] [2019-12-07 16:28:21,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:28:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:28:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:28:21,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336782212] [2019-12-07 16:28:21,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:28:21,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:28:21,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013239998] [2019-12-07 16:28:21,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:28:21,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:28:21,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:28:21,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:28:21,551 INFO L87 Difference]: Start difference. First operand 976 states and 1472 transitions. Second operand 4 states. [2019-12-07 16:28:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:28:24,128 INFO L93 Difference]: Finished difference Result 3752 states and 5684 transitions. [2019-12-07 16:28:24,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:28:24,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-12-07 16:28:24,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:28:24,139 INFO L225 Difference]: With dead ends: 3752 [2019-12-07 16:28:24,139 INFO L226 Difference]: Without dead ends: 2778 [2019-12-07 16:28:24,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:28:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2019-12-07 16:28:24,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2776. [2019-12-07 16:28:24,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2776 states. [2019-12-07 16:28:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2776 states to 2776 states and 3767 transitions. [2019-12-07 16:28:24,183 INFO L78 Accepts]: Start accepts. Automaton has 2776 states and 3767 transitions. Word has length 124 [2019-12-07 16:28:24,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:28:24,184 INFO L462 AbstractCegarLoop]: Abstraction has 2776 states and 3767 transitions. [2019-12-07 16:28:24,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:28:24,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2776 states and 3767 transitions. [2019-12-07 16:28:24,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-12-07 16:28:24,190 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:28:24,191 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:28:24,191 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:28:24,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:28:24,191 INFO L82 PathProgramCache]: Analyzing trace with hash 97405590, now seen corresponding path program 1 times [2019-12-07 16:28:24,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:28:24,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21141269] [2019-12-07 16:28:24,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:28:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:28:24,405 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 263 proven. 3 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-12-07 16:28:24,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21141269] [2019-12-07 16:28:24,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583421719] [2019-12-07 16:28:24,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:28:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:28:24,481 INFO L264 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:28:24,490 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:28:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 16:28:24,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:28:24,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-12-07 16:28:24,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748378933] [2019-12-07 16:28:24,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:28:24,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:28:24,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:28:24,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:28:24,602 INFO L87 Difference]: Start difference. First operand 2776 states and 3767 transitions. Second operand 3 states. [2019-12-07 16:28:26,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:28:26,037 INFO L93 Difference]: Finished difference Result 7943 states and 10844 transitions. [2019-12-07 16:28:26,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:28:26,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-12-07 16:28:26,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:28:26,061 INFO L225 Difference]: With dead ends: 7943 [2019-12-07 16:28:26,062 INFO L226 Difference]: Without dead ends: 5169 [2019-12-07 16:28:26,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:28:26,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5169 states. [2019-12-07 16:28:26,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5169 to 3074. [2019-12-07 16:28:26,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3074 states. [2019-12-07 16:28:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 4119 transitions. [2019-12-07 16:28:26,134 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 4119 transitions. Word has length 301 [2019-12-07 16:28:26,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:28:26,135 INFO L462 AbstractCegarLoop]: Abstraction has 3074 states and 4119 transitions. [2019-12-07 16:28:26,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:28:26,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 4119 transitions. [2019-12-07 16:28:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-12-07 16:28:26,138 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:28:26,139 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:28:26,339 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:28:26,339 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:28:26,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:28:26,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1064012372, now seen corresponding path program 1 times [2019-12-07 16:28:26,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:28:26,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748118727] [2019-12-07 16:28:26,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:28:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:28:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 16:28:26,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748118727] [2019-12-07 16:28:26,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:28:26,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:28:26,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806224102] [2019-12-07 16:28:26,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:28:26,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:28:26,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:28:26,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:28:26,721 INFO L87 Difference]: Start difference. First operand 3074 states and 4119 transitions. Second operand 5 states. [2019-12-07 16:28:29,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:28:29,649 INFO L93 Difference]: Finished difference Result 7344 states and 9550 transitions. [2019-12-07 16:28:29,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:28:29,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 331 [2019-12-07 16:28:29,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:28:29,664 INFO L225 Difference]: With dead ends: 7344 [2019-12-07 16:28:29,664 INFO L226 Difference]: Without dead ends: 4272 [2019-12-07 16:28:29,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:28:29,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2019-12-07 16:28:29,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 3972. [2019-12-07 16:28:29,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3972 states. [2019-12-07 16:28:29,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 3972 states and 5083 transitions. [2019-12-07 16:28:29,714 INFO L78 Accepts]: Start accepts. Automaton has 3972 states and 5083 transitions. Word has length 331 [2019-12-07 16:28:29,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:28:29,714 INFO L462 AbstractCegarLoop]: Abstraction has 3972 states and 5083 transitions. [2019-12-07 16:28:29,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:28:29,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 5083 transitions. [2019-12-07 16:28:29,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-12-07 16:28:29,720 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:28:29,720 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:28:29,720 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:28:29,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:28:29,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1130119938, now seen corresponding path program 1 times [2019-12-07 16:28:29,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:28:29,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148777322] [2019-12-07 16:28:29,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:28:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:28:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 113 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:28:30,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148777322] [2019-12-07 16:28:30,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943237291] [2019-12-07 16:28:30,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:28:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:28:30,464 INFO L264 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:28:30,473 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:28:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:28:30,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:28:30,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-12-07 16:28:30,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864631120] [2019-12-07 16:28:30,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:28:30,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:28:30,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:28:30,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:28:30,572 INFO L87 Difference]: Start difference. First operand 3972 states and 5083 transitions. Second operand 3 states. [2019-12-07 16:28:32,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:28:32,060 INFO L93 Difference]: Finished difference Result 8842 states and 11462 transitions. [2019-12-07 16:28:32,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:28:32,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 405 [2019-12-07 16:28:32,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:28:32,077 INFO L225 Difference]: With dead ends: 8842 [2019-12-07 16:28:32,078 INFO L226 Difference]: Without dead ends: 4872 [2019-12-07 16:28:32,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 405 SyntacticMatches, 9 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:28:32,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4872 states. [2019-12-07 16:28:32,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4872 to 4870. [2019-12-07 16:28:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4870 states. [2019-12-07 16:28:32,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4870 states to 4870 states and 6178 transitions. [2019-12-07 16:28:32,130 INFO L78 Accepts]: Start accepts. Automaton has 4870 states and 6178 transitions. Word has length 405 [2019-12-07 16:28:32,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:28:32,131 INFO L462 AbstractCegarLoop]: Abstraction has 4870 states and 6178 transitions. [2019-12-07 16:28:32,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:28:32,131 INFO L276 IsEmpty]: Start isEmpty. Operand 4870 states and 6178 transitions. [2019-12-07 16:28:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-12-07 16:28:32,133 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:28:32,133 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:28:32,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:28:32,335 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:28:32,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:28:32,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1682645463, now seen corresponding path program 1 times [2019-12-07 16:28:32,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:28:32,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092981277] [2019-12-07 16:28:32,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:28:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:28:33,046 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 351 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 16:28:33,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092981277] [2019-12-07 16:28:33,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044029428] [2019-12-07 16:28:33,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/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-12-07 16:28:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:28:33,136 INFO L264 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:28:33,140 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:28:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-12-07 16:28:33,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:28:33,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-12-07 16:28:33,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68651103] [2019-12-07 16:28:33,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:28:33,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:28:33,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:28:33,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:28:33,266 INFO L87 Difference]: Start difference. First operand 4870 states and 6178 transitions. Second operand 3 states. [2019-12-07 16:28:35,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:28:35,193 INFO L93 Difference]: Finished difference Result 10635 states and 13647 transitions. [2019-12-07 16:28:35,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:28:35,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 422 [2019-12-07 16:28:35,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:28:35,212 INFO L225 Difference]: With dead ends: 10635 [2019-12-07 16:28:35,212 INFO L226 Difference]: Without dead ends: 5767 [2019-12-07 16:28:35,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 421 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:28:35,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2019-12-07 16:28:35,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5767. [2019-12-07 16:28:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5767 states. [2019-12-07 16:28:35,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 7357 transitions. [2019-12-07 16:28:35,272 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 7357 transitions. Word has length 422 [2019-12-07 16:28:35,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:28:35,273 INFO L462 AbstractCegarLoop]: Abstraction has 5767 states and 7357 transitions. [2019-12-07 16:28:35,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:28:35,273 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 7357 transitions. [2019-12-07 16:28:35,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2019-12-07 16:28:35,279 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:28:35,279 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:28:35,480 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:28:35,480 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:28:35,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:28:35,481 INFO L82 PathProgramCache]: Analyzing trace with hash 862817601, now seen corresponding path program 1 times [2019-12-07 16:28:35,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:28:35,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837001330] [2019-12-07 16:28:35,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:28:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:28:36,430 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 605 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-12-07 16:28:36,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837001330] [2019-12-07 16:28:36,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066382383] [2019-12-07 16:28:36,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/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-12-07 16:28:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:28:36,540 INFO L264 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 16:28:36,545 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:28:36,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:28:36,958 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 569 proven. 39 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-12-07 16:28:36,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:28:36,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-12-07 16:28:36,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107302017] [2019-12-07 16:28:36,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:28:36,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:28:36,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:28:36,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:28:36,959 INFO L87 Difference]: Start difference. First operand 5767 states and 7357 transitions. Second operand 9 states. [2019-12-07 16:28:41,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:28:41,944 INFO L93 Difference]: Finished difference Result 16470 states and 20299 transitions. [2019-12-07 16:28:41,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 16:28:41,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 586 [2019-12-07 16:28:41,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:28:41,981 INFO L225 Difference]: With dead ends: 16470 [2019-12-07 16:28:41,981 INFO L226 Difference]: Without dead ends: 7559 [2019-12-07 16:28:41,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 584 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:28:41,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7559 states. [2019-12-07 16:28:42,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7559 to 7260. [2019-12-07 16:28:42,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7260 states. [2019-12-07 16:28:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7260 states to 7260 states and 7970 transitions. [2019-12-07 16:28:42,053 INFO L78 Accepts]: Start accepts. Automaton has 7260 states and 7970 transitions. Word has length 586 [2019-12-07 16:28:42,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:28:42,053 INFO L462 AbstractCegarLoop]: Abstraction has 7260 states and 7970 transitions. [2019-12-07 16:28:42,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:28:42,053 INFO L276 IsEmpty]: Start isEmpty. Operand 7260 states and 7970 transitions. [2019-12-07 16:28:42,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2019-12-07 16:28:42,058 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:28:42,059 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:28:42,259 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:28:42,260 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:28:42,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:28:42,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1867245461, now seen corresponding path program 1 times [2019-12-07 16:28:42,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:28:42,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614037814] [2019-12-07 16:28:42,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:28:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:28:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 151 proven. 358 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:28:44,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614037814] [2019-12-07 16:28:44,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493717848] [2019-12-07 16:28:44,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/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-12-07 16:28:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:28:44,119 INFO L264 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:28:44,124 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:28:44,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:28:44,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:44,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:44,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:44,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:44,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:44,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:28:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 264 proven. 57 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-12-07 16:28:44,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:28:44,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 13 [2019-12-07 16:28:44,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472782376] [2019-12-07 16:28:44,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 16:28:44,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:28:44,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 16:28:44,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:28:44,544 INFO L87 Difference]: Start difference. First operand 7260 states and 7970 transitions. Second operand 13 states. [2019-12-07 16:29:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:29:04,173 INFO L93 Difference]: Finished difference Result 27732 states and 30487 transitions. [2019-12-07 16:29:04,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 16:29:04,173 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 594 [2019-12-07 16:29:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:29:04,197 INFO L225 Difference]: With dead ends: 27732 [2019-12-07 16:29:04,197 INFO L226 Difference]: Without dead ends: 20175 [2019-12-07 16:29:04,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 611 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=245, Invalid=945, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 16:29:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20175 states. [2019-12-07 16:29:04,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20175 to 15650. [2019-12-07 16:29:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15650 states. [2019-12-07 16:29:04,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15650 states to 15650 states and 16759 transitions. [2019-12-07 16:29:04,376 INFO L78 Accepts]: Start accepts. Automaton has 15650 states and 16759 transitions. Word has length 594 [2019-12-07 16:29:04,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:29:04,376 INFO L462 AbstractCegarLoop]: Abstraction has 15650 states and 16759 transitions. [2019-12-07 16:29:04,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 16:29:04,376 INFO L276 IsEmpty]: Start isEmpty. Operand 15650 states and 16759 transitions. [2019-12-07 16:29:04,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2019-12-07 16:29:04,384 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:29:04,385 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:29:04,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:29:04,586 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:29:04,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:29:04,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1667893228, now seen corresponding path program 1 times [2019-12-07 16:29:04,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:29:04,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462309020] [2019-12-07 16:29:04,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:29:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:29:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 871 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-12-07 16:29:04,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462309020] [2019-12-07 16:29:04,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:29:04,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:29:04,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781395577] [2019-12-07 16:29:04,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:29:04,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:29:04,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:29:04,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:29:04,938 INFO L87 Difference]: Start difference. First operand 15650 states and 16759 transitions. Second operand 3 states. [2019-12-07 16:29:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:29:05,780 INFO L93 Difference]: Finished difference Result 28899 states and 31071 transitions. [2019-12-07 16:29:05,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:29:05,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 695 [2019-12-07 16:29:05,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:29:05,805 INFO L225 Difference]: With dead ends: 28899 [2019-12-07 16:29:05,805 INFO L226 Difference]: Without dead ends: 15946 [2019-12-07 16:29:05,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:29:05,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15946 states. [2019-12-07 16:29:05,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15946 to 15646. [2019-12-07 16:29:05,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15646 states. [2019-12-07 16:29:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15646 states to 15646 states and 16752 transitions. [2019-12-07 16:29:05,949 INFO L78 Accepts]: Start accepts. Automaton has 15646 states and 16752 transitions. Word has length 695 [2019-12-07 16:29:05,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:29:05,950 INFO L462 AbstractCegarLoop]: Abstraction has 15646 states and 16752 transitions. [2019-12-07 16:29:05,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:29:05,950 INFO L276 IsEmpty]: Start isEmpty. Operand 15646 states and 16752 transitions. [2019-12-07 16:29:05,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2019-12-07 16:29:05,958 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:29:05,958 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:29:05,958 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:29:05,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:29:05,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1883826705, now seen corresponding path program 1 times [2019-12-07 16:29:05,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:29:05,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977017790] [2019-12-07 16:29:05,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:29:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:29:06,933 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 255 proven. 456 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-12-07 16:29:06,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977017790] [2019-12-07 16:29:06,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594083735] [2019-12-07 16:29:06,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/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-12-07 16:29:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:29:07,063 INFO L264 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:29:07,067 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:29:07,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:29:07,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:29:07,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:29:07,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:29:07,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 16:29:07,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:29:07,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:29:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 451 proven. 190 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-12-07 16:29:07,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:29:07,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 15 [2019-12-07 16:29:07,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189522224] [2019-12-07 16:29:07,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 16:29:07,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:29:07,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 16:29:07,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:29:07,645 INFO L87 Difference]: Start difference. First operand 15646 states and 16752 transitions. Second operand 15 states. [2019-12-07 16:29:42,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:29:42,076 INFO L93 Difference]: Finished difference Result 38937 states and 42003 transitions. [2019-12-07 16:29:42,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-07 16:29:42,077 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 700 [2019-12-07 16:29:42,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:29:42,093 INFO L225 Difference]: With dead ends: 38937 [2019-12-07 16:29:42,094 INFO L226 Difference]: Without dead ends: 23592 [2019-12-07 16:29:42,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 796 GetRequests, 736 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=575, Invalid=2395, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 16:29:42,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23592 states. [2019-12-07 16:29:42,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23592 to 16809. [2019-12-07 16:29:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16809 states. [2019-12-07 16:29:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16809 states to 16809 states and 17407 transitions. [2019-12-07 16:29:42,264 INFO L78 Accepts]: Start accepts. Automaton has 16809 states and 17407 transitions. Word has length 700 [2019-12-07 16:29:42,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:29:42,265 INFO L462 AbstractCegarLoop]: Abstraction has 16809 states and 17407 transitions. [2019-12-07 16:29:42,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 16:29:42,265 INFO L276 IsEmpty]: Start isEmpty. Operand 16809 states and 17407 transitions. [2019-12-07 16:29:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2019-12-07 16:29:42,275 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:29:42,276 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:29:42,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:29:42,477 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:29:42,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:29:42,478 INFO L82 PathProgramCache]: Analyzing trace with hash -516004015, now seen corresponding path program 1 times [2019-12-07 16:29:42,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:29:42,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308661074] [2019-12-07 16:29:42,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:29:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:29:43,047 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-12-07 16:29:43,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308661074] [2019-12-07 16:29:43,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:29:43,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:29:43,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940394850] [2019-12-07 16:29:43,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:29:43,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:29:43,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:29:43,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:29:43,048 INFO L87 Difference]: Start difference. First operand 16809 states and 17407 transitions. Second operand 5 states. [2019-12-07 16:29:44,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:29:44,830 INFO L93 Difference]: Finished difference Result 23112 states and 23909 transitions. [2019-12-07 16:29:44,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:29:44,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 762 [2019-12-07 16:29:44,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:29:44,855 INFO L225 Difference]: With dead ends: 23112 [2019-12-07 16:29:44,855 INFO L226 Difference]: Without dead ends: 23110 [2019-12-07 16:29:44,860 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:29:44,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23110 states. [2019-12-07 16:29:45,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23110 to 19511. [2019-12-07 16:29:45,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19511 states. [2019-12-07 16:29:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19511 states to 19511 states and 20213 transitions. [2019-12-07 16:29:45,023 INFO L78 Accepts]: Start accepts. Automaton has 19511 states and 20213 transitions. Word has length 762 [2019-12-07 16:29:45,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:29:45,024 INFO L462 AbstractCegarLoop]: Abstraction has 19511 states and 20213 transitions. [2019-12-07 16:29:45,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:29:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 19511 states and 20213 transitions. [2019-12-07 16:29:45,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 804 [2019-12-07 16:29:45,036 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:29:45,037 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:29:45,037 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:29:45,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:29:45,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1187580303, now seen corresponding path program 1 times [2019-12-07 16:29:45,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:29:45,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454455496] [2019-12-07 16:29:45,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:29:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:29:46,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 507 proven. 311 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-12-07 16:29:46,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454455496] [2019-12-07 16:29:46,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835647291] [2019-12-07 16:29:46,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/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-12-07 16:29:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:29:46,301 INFO L264 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 16:29:46,306 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:29:46,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:29:46,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:29:46,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 16:29:46,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 16:29:46,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 16:29:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1033 backedges. 629 proven. 57 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-12-07 16:29:46,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:29:46,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-12-07 16:29:46,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124292804] [2019-12-07 16:29:46,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 16:29:46,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:29:46,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 16:29:46,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:29:46,953 INFO L87 Difference]: Start difference. First operand 19511 states and 20213 transitions. Second operand 13 states. [2019-12-07 16:29:56,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:29:56,764 INFO L93 Difference]: Finished difference Result 43698 states and 45411 transitions. [2019-12-07 16:29:56,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 16:29:56,765 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 803 [2019-12-07 16:29:56,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:29:56,780 INFO L225 Difference]: With dead ends: 43698 [2019-12-07 16:29:56,780 INFO L226 Difference]: Without dead ends: 23890 [2019-12-07 16:29:56,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 847 GetRequests, 816 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2019-12-07 16:29:56,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23890 states. [2019-12-07 16:29:56,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23890 to 20393. [2019-12-07 16:29:56,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20393 states. [2019-12-07 16:29:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20393 states to 20393 states and 20930 transitions. [2019-12-07 16:29:56,970 INFO L78 Accepts]: Start accepts. Automaton has 20393 states and 20930 transitions. Word has length 803 [2019-12-07 16:29:56,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:29:56,970 INFO L462 AbstractCegarLoop]: Abstraction has 20393 states and 20930 transitions. [2019-12-07 16:29:56,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 16:29:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand 20393 states and 20930 transitions. [2019-12-07 16:29:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2019-12-07 16:29:56,981 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:29:56,981 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:29:57,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:29:57,183 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:29:57,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:29:57,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1577381507, now seen corresponding path program 1 times [2019-12-07 16:29:57,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:29:57,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182349346] [2019-12-07 16:29:57,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:29:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:29:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2019-12-07 16:29:57,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182349346] [2019-12-07 16:29:57,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:29:57,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:29:57,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041316206] [2019-12-07 16:29:57,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:29:57,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:29:57,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:29:57,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:29:57,809 INFO L87 Difference]: Start difference. First operand 20393 states and 20930 transitions. Second operand 5 states. [2019-12-07 16:29:59,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:29:59,571 INFO L93 Difference]: Finished difference Result 42003 states and 43174 transitions. [2019-12-07 16:29:59,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:29:59,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 809 [2019-12-07 16:29:59,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:29:59,589 INFO L225 Difference]: With dead ends: 42003 [2019-12-07 16:29:59,589 INFO L226 Difference]: Without dead ends: 24307 [2019-12-07 16:29:59,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:29:59,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24307 states. [2019-12-07 16:29:59,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24307 to 21590. [2019-12-07 16:29:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21590 states. [2019-12-07 16:29:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21590 states to 21590 states and 22148 transitions. [2019-12-07 16:29:59,775 INFO L78 Accepts]: Start accepts. Automaton has 21590 states and 22148 transitions. Word has length 809 [2019-12-07 16:29:59,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:29:59,776 INFO L462 AbstractCegarLoop]: Abstraction has 21590 states and 22148 transitions. [2019-12-07 16:29:59,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:29:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 21590 states and 22148 transitions. [2019-12-07 16:29:59,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1138 [2019-12-07 16:29:59,802 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:29:59,803 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:29:59,803 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:29:59,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:29:59,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1697872981, now seen corresponding path program 1 times [2019-12-07 16:29:59,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:29:59,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860804281] [2019-12-07 16:29:59,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:29:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2454 backedges. 114 proven. 1161 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2019-12-07 16:30:02,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860804281] [2019-12-07 16:30:02,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708275094] [2019-12-07 16:30:02,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/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-12-07 16:30:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:02,323 INFO L264 TraceCheckSpWp]: Trace formula consists of 1307 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:30:02,331 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:30:02,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:30:02,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:30:02,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:30:02,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:30:02,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:30:02,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:30:02,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:30:02,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:30:02,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:30:02,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:30:03,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2454 backedges. 740 proven. 619 refuted. 0 times theorem prover too weak. 1095 trivial. 0 not checked. [2019-12-07 16:30:03,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:30:03,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-07 16:30:03,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071604983] [2019-12-07 16:30:03,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:30:03,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:30:03,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:30:03,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:30:03,954 INFO L87 Difference]: Start difference. First operand 21590 states and 22148 transitions. Second operand 8 states. [2019-12-07 16:30:06,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:30:06,321 INFO L93 Difference]: Finished difference Result 52180 states and 53530 transitions. [2019-12-07 16:30:06,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:30:06,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1137 [2019-12-07 16:30:06,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:30:06,345 INFO L225 Difference]: With dead ends: 52180 [2019-12-07 16:30:06,345 INFO L226 Difference]: Without dead ends: 33586 [2019-12-07 16:30:06,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1142 GetRequests, 1133 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:30:06,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33586 states. [2019-12-07 16:30:06,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33586 to 22486. [2019-12-07 16:30:06,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22486 states. [2019-12-07 16:30:06,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22486 states to 22486 states and 23013 transitions. [2019-12-07 16:30:06,576 INFO L78 Accepts]: Start accepts. Automaton has 22486 states and 23013 transitions. Word has length 1137 [2019-12-07 16:30:06,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:30:06,577 INFO L462 AbstractCegarLoop]: Abstraction has 22486 states and 23013 transitions. [2019-12-07 16:30:06,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:30:06,577 INFO L276 IsEmpty]: Start isEmpty. Operand 22486 states and 23013 transitions. [2019-12-07 16:30:06,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1216 [2019-12-07 16:30:06,596 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:30:06,597 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:30:06,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:30:06,798 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:30:06,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:30:06,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1387578807, now seen corresponding path program 1 times [2019-12-07 16:30:06,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:30:06,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37249748] [2019-12-07 16:30:06,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:30:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2461 backedges. 1889 proven. 187 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-12-07 16:30:07,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37249748] [2019-12-07 16:30:07,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411235548] [2019-12-07 16:30:07,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/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-12-07 16:30:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:08,203 INFO L264 TraceCheckSpWp]: Trace formula consists of 1388 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:30:08,210 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:30:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2461 backedges. 1723 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2019-12-07 16:30:08,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:30:08,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-12-07 16:30:08,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167501555] [2019-12-07 16:30:08,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:30:08,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:30:08,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:30:08,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:30:08,908 INFO L87 Difference]: Start difference. First operand 22486 states and 23013 transitions. Second operand 3 states. [2019-12-07 16:30:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:30:09,681 INFO L93 Difference]: Finished difference Result 41982 states and 43003 transitions. [2019-12-07 16:30:09,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:30:09,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1215 [2019-12-07 16:30:09,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:30:09,697 INFO L225 Difference]: With dead ends: 41982 [2019-12-07 16:30:09,697 INFO L226 Difference]: Without dead ends: 24588 [2019-12-07 16:30:09,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1221 GetRequests, 1216 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:30:09,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24588 states. [2019-12-07 16:30:09,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24588 to 23985. [2019-12-07 16:30:09,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23985 states. [2019-12-07 16:30:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23985 states to 23985 states and 24533 transitions. [2019-12-07 16:30:09,894 INFO L78 Accepts]: Start accepts. Automaton has 23985 states and 24533 transitions. Word has length 1215 [2019-12-07 16:30:09,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:30:09,894 INFO L462 AbstractCegarLoop]: Abstraction has 23985 states and 24533 transitions. [2019-12-07 16:30:09,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:30:09,894 INFO L276 IsEmpty]: Start isEmpty. Operand 23985 states and 24533 transitions. [2019-12-07 16:30:09,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1218 [2019-12-07 16:30:09,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:30:09,913 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:30:10,113 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:30:10,114 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:30:10,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:30:10,115 INFO L82 PathProgramCache]: Analyzing trace with hash 741181811, now seen corresponding path program 1 times [2019-12-07 16:30:10,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:30:10,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427303668] [2019-12-07 16:30:10,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:30:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2903 backedges. 1243 proven. 0 refuted. 0 times theorem prover too weak. 1660 trivial. 0 not checked. [2019-12-07 16:30:11,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427303668] [2019-12-07 16:30:11,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:30:11,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:30:11,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119149671] [2019-12-07 16:30:11,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:30:11,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:30:11,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:30:11,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:30:11,205 INFO L87 Difference]: Start difference. First operand 23985 states and 24533 transitions. Second operand 5 states. [2019-12-07 16:30:13,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:30:13,041 INFO L93 Difference]: Finished difference Result 49782 states and 50942 transitions. [2019-12-07 16:30:13,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:30:13,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1217 [2019-12-07 16:30:13,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:30:13,062 INFO L225 Difference]: With dead ends: 49782 [2019-12-07 16:30:13,062 INFO L226 Difference]: Without dead ends: 28195 [2019-12-07 16:30:13,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:30:13,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28195 states. [2019-12-07 16:30:13,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28195 to 24286. [2019-12-07 16:30:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24286 states. [2019-12-07 16:30:13,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24286 states to 24286 states and 24850 transitions. [2019-12-07 16:30:13,285 INFO L78 Accepts]: Start accepts. Automaton has 24286 states and 24850 transitions. Word has length 1217 [2019-12-07 16:30:13,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:30:13,286 INFO L462 AbstractCegarLoop]: Abstraction has 24286 states and 24850 transitions. [2019-12-07 16:30:13,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:30:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 24286 states and 24850 transitions. [2019-12-07 16:30:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1406 [2019-12-07 16:30:13,308 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:30:13,308 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:30:13,309 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:30:13,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:30:13,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1039295211, now seen corresponding path program 1 times [2019-12-07 16:30:13,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:30:13,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130113841] [2019-12-07 16:30:13,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:30:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 2841 proven. 104 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2019-12-07 16:30:14,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130113841] [2019-12-07 16:30:14,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702305329] [2019-12-07 16:30:14,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/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-12-07 16:30:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:15,011 INFO L264 TraceCheckSpWp]: Trace formula consists of 1603 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:30:15,018 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:30:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3591 backedges. 2688 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-12-07 16:30:15,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:30:15,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-12-07 16:30:15,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270686293] [2019-12-07 16:30:15,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:30:15,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:30:15,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:30:15,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:30:15,977 INFO L87 Difference]: Start difference. First operand 24286 states and 24850 transitions. Second operand 3 states. [2019-12-07 16:30:16,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:30:16,678 INFO L93 Difference]: Finished difference Result 47972 states and 49097 transitions. [2019-12-07 16:30:16,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:30:16,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1405 [2019-12-07 16:30:16,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:30:16,694 INFO L225 Difference]: With dead ends: 47972 [2019-12-07 16:30:16,695 INFO L226 Difference]: Without dead ends: 23987 [2019-12-07 16:30:16,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1412 GetRequests, 1405 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:30:16,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23987 states. [2019-12-07 16:30:16,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23987 to 22786. [2019-12-07 16:30:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22786 states. [2019-12-07 16:30:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22786 states to 22786 states and 23191 transitions. [2019-12-07 16:30:16,889 INFO L78 Accepts]: Start accepts. Automaton has 22786 states and 23191 transitions. Word has length 1405 [2019-12-07 16:30:16,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:30:16,890 INFO L462 AbstractCegarLoop]: Abstraction has 22786 states and 23191 transitions. [2019-12-07 16:30:16,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:30:16,890 INFO L276 IsEmpty]: Start isEmpty. Operand 22786 states and 23191 transitions. [2019-12-07 16:30:16,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2019-12-07 16:30:16,914 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:30:16,915 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:30:17,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:30:17,116 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:30:17,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:30:17,117 INFO L82 PathProgramCache]: Analyzing trace with hash -424946053, now seen corresponding path program 1 times [2019-12-07 16:30:17,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:30:17,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510532481] [2019-12-07 16:30:17,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:30:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5606 backedges. 1619 proven. 0 refuted. 0 times theorem prover too weak. 3987 trivial. 0 not checked. [2019-12-07 16:30:18,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510532481] [2019-12-07 16:30:18,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:30:18,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:30:18,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469485829] [2019-12-07 16:30:18,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:30:18,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:30:18,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:30:18,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:30:18,686 INFO L87 Difference]: Start difference. First operand 22786 states and 23191 transitions. Second operand 3 states. [2019-12-07 16:30:19,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:30:19,452 INFO L93 Difference]: Finished difference Result 47072 states and 47905 transitions. [2019-12-07 16:30:19,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:30:19,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1621 [2019-12-07 16:30:19,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:30:19,469 INFO L225 Difference]: With dead ends: 47072 [2019-12-07 16:30:19,469 INFO L226 Difference]: Without dead ends: 24587 [2019-12-07 16:30:19,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:30:19,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24587 states. [2019-12-07 16:30:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24587 to 19792. [2019-12-07 16:30:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19792 states. [2019-12-07 16:30:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19792 states to 19792 states and 20136 transitions. [2019-12-07 16:30:19,652 INFO L78 Accepts]: Start accepts. Automaton has 19792 states and 20136 transitions. Word has length 1621 [2019-12-07 16:30:19,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:30:19,653 INFO L462 AbstractCegarLoop]: Abstraction has 19792 states and 20136 transitions. [2019-12-07 16:30:19,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:30:19,653 INFO L276 IsEmpty]: Start isEmpty. Operand 19792 states and 20136 transitions. [2019-12-07 16:30:19,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1706 [2019-12-07 16:30:19,676 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:30:19,677 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:30:19,677 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:30:19,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:30:19,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1975256122, now seen corresponding path program 1 times [2019-12-07 16:30:19,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:30:19,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759399146] [2019-12-07 16:30:19,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:30:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6410 backedges. 4062 proven. 269 refuted. 0 times theorem prover too weak. 2079 trivial. 0 not checked. [2019-12-07 16:30:21,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759399146] [2019-12-07 16:30:21,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145530545] [2019-12-07 16:30:21,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/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-12-07 16:30:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:22,049 INFO L264 TraceCheckSpWp]: Trace formula consists of 1967 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:30:22,056 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:30:23,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6410 backedges. 4066 proven. 0 refuted. 0 times theorem prover too weak. 2344 trivial. 0 not checked. [2019-12-07 16:30:23,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:30:23,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-12-07 16:30:23,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850960160] [2019-12-07 16:30:23,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:30:23,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:30:23,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:30:23,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:30:23,290 INFO L87 Difference]: Start difference. First operand 19792 states and 20136 transitions. Second operand 3 states. [2019-12-07 16:30:24,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:30:24,247 INFO L93 Difference]: Finished difference Result 35986 states and 36613 transitions. [2019-12-07 16:30:24,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:30:24,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1705 [2019-12-07 16:30:24,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:30:24,260 INFO L225 Difference]: With dead ends: 35986 [2019-12-07 16:30:24,260 INFO L226 Difference]: Without dead ends: 19485 [2019-12-07 16:30:24,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1716 GetRequests, 1709 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:30:24,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19485 states. [2019-12-07 16:30:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19485 to 18289. [2019-12-07 16:30:24,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18289 states. [2019-12-07 16:30:24,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18289 states to 18289 states and 18550 transitions. [2019-12-07 16:30:24,415 INFO L78 Accepts]: Start accepts. Automaton has 18289 states and 18550 transitions. Word has length 1705 [2019-12-07 16:30:24,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:30:24,416 INFO L462 AbstractCegarLoop]: Abstraction has 18289 states and 18550 transitions. [2019-12-07 16:30:24,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:30:24,417 INFO L276 IsEmpty]: Start isEmpty. Operand 18289 states and 18550 transitions. [2019-12-07 16:30:24,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1743 [2019-12-07 16:30:24,439 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:30:24,440 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:30:24,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:30:24,641 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:30:24,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:30:24,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1751744778, now seen corresponding path program 1 times [2019-12-07 16:30:24,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:30:24,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101005047] [2019-12-07 16:30:24,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:30:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6951 backedges. 4503 proven. 0 refuted. 0 times theorem prover too weak. 2448 trivial. 0 not checked. [2019-12-07 16:30:27,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101005047] [2019-12-07 16:30:27,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:30:27,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:30:27,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935512318] [2019-12-07 16:30:27,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:30:27,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:30:27,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:30:27,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:30:27,035 INFO L87 Difference]: Start difference. First operand 18289 states and 18550 transitions. Second operand 5 states. [2019-12-07 16:30:28,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:30:28,397 INFO L93 Difference]: Finished difference Result 36296 states and 36818 transitions. [2019-12-07 16:30:28,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:30:28,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1742 [2019-12-07 16:30:28,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:30:28,409 INFO L225 Difference]: With dead ends: 36296 [2019-12-07 16:30:28,409 INFO L226 Difference]: Without dead ends: 18607 [2019-12-07 16:30:28,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:30:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18607 states. [2019-12-07 16:30:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18607 to 16192. [2019-12-07 16:30:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16192 states. [2019-12-07 16:30:28,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16192 states to 16192 states and 16401 transitions. [2019-12-07 16:30:28,557 INFO L78 Accepts]: Start accepts. Automaton has 16192 states and 16401 transitions. Word has length 1742 [2019-12-07 16:30:28,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:30:28,558 INFO L462 AbstractCegarLoop]: Abstraction has 16192 states and 16401 transitions. [2019-12-07 16:30:28,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:30:28,558 INFO L276 IsEmpty]: Start isEmpty. Operand 16192 states and 16401 transitions. [2019-12-07 16:30:28,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1800 [2019-12-07 16:30:28,581 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:30:28,582 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:30:28,582 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:30:28,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:30:28,583 INFO L82 PathProgramCache]: Analyzing trace with hash -429079952, now seen corresponding path program 1 times [2019-12-07 16:30:28,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:30:28,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001695036] [2019-12-07 16:30:28,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:30:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:30,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6264 backedges. 4081 proven. 0 refuted. 0 times theorem prover too weak. 2183 trivial. 0 not checked. [2019-12-07 16:30:30,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001695036] [2019-12-07 16:30:30,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:30:30,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:30:30,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698570262] [2019-12-07 16:30:30,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:30:30,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:30:30,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:30:30,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:30:30,838 INFO L87 Difference]: Start difference. First operand 16192 states and 16401 transitions. Second operand 3 states. [2019-12-07 16:30:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:30:31,535 INFO L93 Difference]: Finished difference Result 31190 states and 31589 transitions. [2019-12-07 16:30:31,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:30:31,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1799 [2019-12-07 16:30:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:30:31,548 INFO L225 Difference]: With dead ends: 31190 [2019-12-07 16:30:31,548 INFO L226 Difference]: Without dead ends: 17691 [2019-12-07 16:30:31,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:30:31,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17691 states. [2019-12-07 16:30:31,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17691 to 15292. [2019-12-07 16:30:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15292 states. [2019-12-07 16:30:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15292 states to 15292 states and 15485 transitions. [2019-12-07 16:30:31,688 INFO L78 Accepts]: Start accepts. Automaton has 15292 states and 15485 transitions. Word has length 1799 [2019-12-07 16:30:31,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:30:31,689 INFO L462 AbstractCegarLoop]: Abstraction has 15292 states and 15485 transitions. [2019-12-07 16:30:31,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:30:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 15292 states and 15485 transitions. [2019-12-07 16:30:31,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1896 [2019-12-07 16:30:31,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:30:31,714 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:30:31,714 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:30:31,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:30:31,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1762588739, now seen corresponding path program 1 times [2019-12-07 16:30:31,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:30:31,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453899610] [2019-12-07 16:30:31,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:30:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6537 backedges. 114 proven. 5084 refuted. 0 times theorem prover too weak. 1339 trivial. 0 not checked. [2019-12-07 16:30:38,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453899610] [2019-12-07 16:30:38,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616854134] [2019-12-07 16:30:38,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/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-12-07 16:30:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:30:38,640 INFO L264 TraceCheckSpWp]: Trace formula consists of 2139 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 16:30:38,649 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:30:38,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:30:38,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:30:38,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:30:38,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:30:38,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:30:38,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:30:38,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:30:38,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:30:38,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:30:38,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:30:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6537 backedges. 4045 proven. 480 refuted. 0 times theorem prover too weak. 2012 trivial. 0 not checked. [2019-12-07 16:30:43,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:30:43,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2019-12-07 16:30:43,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620354142] [2019-12-07 16:30:43,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 16:30:43,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:30:43,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 16:30:43,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:30:43,970 INFO L87 Difference]: Start difference. First operand 15292 states and 15485 transitions. Second operand 12 states. [2019-12-07 16:30:52,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:30:52,182 INFO L93 Difference]: Finished difference Result 44373 states and 44916 transitions. [2019-12-07 16:30:52,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 16:30:52,183 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1895 [2019-12-07 16:30:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:30:52,184 INFO L225 Difference]: With dead ends: 44373 [2019-12-07 16:30:52,184 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 16:30:52,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1911 GetRequests, 1896 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-12-07 16:30:52,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 16:30:52,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 16:30:52,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 16:30:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 16:30:52,196 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1895 [2019-12-07 16:30:52,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:30:52,196 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 16:30:52,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 16:30:52,196 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 16:30:52,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 16:30:52,397 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:30:52,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 16:30:53,813 WARN L192 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 978 DAG size of output: 741 [2019-12-07 16:30:55,085 WARN L192 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 978 DAG size of output: 741 [2019-12-07 16:30:55,789 WARN L192 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 725 DAG size of output: 579 [2019-12-07 16:31:04,987 WARN L192 SmtUtils]: Spent 9.19 s on a formula simplification. DAG size of input: 676 DAG size of output: 205 [2019-12-07 16:31:16,348 WARN L192 SmtUtils]: Spent 11.35 s on a formula simplification. DAG size of input: 676 DAG size of output: 205 [2019-12-07 16:31:23,917 WARN L192 SmtUtils]: Spent 7.57 s on a formula simplification. DAG size of input: 546 DAG size of output: 204 [2019-12-07 16:31:23,920 INFO L246 CegarLoopResult]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,920 INFO L246 CegarLoopResult]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,920 INFO L246 CegarLoopResult]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,920 INFO L246 CegarLoopResult]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,920 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-12-07 16:31:23,921 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,921 INFO L246 CegarLoopResult]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,921 INFO L246 CegarLoopResult]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,921 INFO L246 CegarLoopResult]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,921 INFO L246 CegarLoopResult]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,921 INFO L246 CegarLoopResult]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,921 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 16:31:23,921 INFO L246 CegarLoopResult]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,921 INFO L246 CegarLoopResult]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,921 INFO L246 CegarLoopResult]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,921 INFO L246 CegarLoopResult]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-12-07 16:31:23,921 INFO L246 CegarLoopResult]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,921 INFO L246 CegarLoopResult]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,921 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-12-07 16:31:23,921 INFO L246 CegarLoopResult]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,921 INFO L246 CegarLoopResult]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,921 INFO L246 CegarLoopResult]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,921 INFO L246 CegarLoopResult]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,921 INFO L246 CegarLoopResult]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,921 INFO L246 CegarLoopResult]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,922 INFO L246 CegarLoopResult]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 16:31:23,923 INFO L246 CegarLoopResult]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-12-07 16:31:23,924 INFO L246 CegarLoopResult]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-12-07 16:31:23,924 INFO L246 CegarLoopResult]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-12-07 16:31:23,924 INFO L246 CegarLoopResult]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 16:31:23,924 INFO L246 CegarLoopResult]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-12-07 16:31:23,924 INFO L246 CegarLoopResult]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,924 INFO L246 CegarLoopResult]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,924 INFO L246 CegarLoopResult]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,924 INFO L246 CegarLoopResult]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,924 INFO L246 CegarLoopResult]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-12-07 16:31:23,924 INFO L246 CegarLoopResult]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-12-07 16:31:23,924 INFO L246 CegarLoopResult]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,924 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-12-07 16:31:23,924 INFO L246 CegarLoopResult]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,924 INFO L246 CegarLoopResult]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,924 INFO L246 CegarLoopResult]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,924 INFO L246 CegarLoopResult]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,924 INFO L246 CegarLoopResult]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,924 INFO L246 CegarLoopResult]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,924 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-12-07 16:31:23,924 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 16:31:23,925 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-12-07 16:31:23,925 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,925 INFO L246 CegarLoopResult]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,925 INFO L246 CegarLoopResult]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,925 INFO L246 CegarLoopResult]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,925 INFO L246 CegarLoopResult]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,925 INFO L246 CegarLoopResult]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 16:31:23,925 INFO L246 CegarLoopResult]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-12-07 16:31:23,925 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,925 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-12-07 16:31:23,925 INFO L246 CegarLoopResult]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-12-07 16:31:23,925 INFO L246 CegarLoopResult]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-12-07 16:31:23,925 INFO L246 CegarLoopResult]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,925 INFO L246 CegarLoopResult]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-12-07 16:31:23,925 INFO L246 CegarLoopResult]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-12-07 16:31:23,925 INFO L246 CegarLoopResult]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,925 INFO L246 CegarLoopResult]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,925 INFO L246 CegarLoopResult]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,925 INFO L246 CegarLoopResult]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,925 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 16:31:23,926 INFO L246 CegarLoopResult]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-12-07 16:31:23,926 INFO L246 CegarLoopResult]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,926 INFO L246 CegarLoopResult]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,926 INFO L246 CegarLoopResult]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,926 INFO L246 CegarLoopResult]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 16:31:23,926 INFO L246 CegarLoopResult]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-12-07 16:31:23,926 INFO L246 CegarLoopResult]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,926 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-12-07 16:31:23,926 INFO L246 CegarLoopResult]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,926 INFO L246 CegarLoopResult]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,926 INFO L246 CegarLoopResult]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,926 INFO L246 CegarLoopResult]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,926 INFO L246 CegarLoopResult]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,926 INFO L246 CegarLoopResult]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,926 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-12-07 16:31:23,926 INFO L246 CegarLoopResult]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,926 INFO L246 CegarLoopResult]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,926 INFO L246 CegarLoopResult]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-12-07 16:31:23,926 INFO L246 CegarLoopResult]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,926 INFO L246 CegarLoopResult]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,927 INFO L246 CegarLoopResult]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,928 INFO L246 CegarLoopResult]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,929 INFO L246 CegarLoopResult]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,929 INFO L246 CegarLoopResult]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,929 INFO L246 CegarLoopResult]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,929 INFO L246 CegarLoopResult]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 16:31:23,929 INFO L246 CegarLoopResult]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-12-07 16:31:23,929 INFO L246 CegarLoopResult]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,929 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 16:31:23,929 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 16:31:23,929 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-12-07 16:31:23,929 INFO L246 CegarLoopResult]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,929 INFO L246 CegarLoopResult]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,929 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,929 INFO L246 CegarLoopResult]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,929 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,929 INFO L246 CegarLoopResult]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-12-07 16:31:23,929 INFO L246 CegarLoopResult]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-12-07 16:31:23,929 INFO L246 CegarLoopResult]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 16:31:23,929 INFO L246 CegarLoopResult]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-12-07 16:31:23,929 INFO L246 CegarLoopResult]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,929 INFO L246 CegarLoopResult]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,930 INFO L246 CegarLoopResult]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,931 INFO L246 CegarLoopResult]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,931 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-12-07 16:31:23,931 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 16:31:23,931 INFO L246 CegarLoopResult]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-12-07 16:31:23,931 INFO L246 CegarLoopResult]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-12-07 16:31:23,931 INFO L246 CegarLoopResult]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,931 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,931 INFO L246 CegarLoopResult]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,931 INFO L246 CegarLoopResult]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,931 INFO L242 CegarLoopResult]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse37 (+ ~a29~0 16))) (let ((.cse34 (= 4 ~a2~0)) (.cse38 (+ ~a4~0 42)) (.cse19 (< 0 .cse37)) (.cse41 (+ ~a4~0 86)) (.cse40 (+ ~a0~0 147))) (let ((.cse26 (<= 0 (+ ~a0~0 384412))) (.cse27 (<= .cse40 0)) (.cse32 (or .cse19 (< 0 .cse41))) (.cse15 (<= (+ ~a0~0 149) 0)) (.cse30 (<= ~a2~0 2)) (.cse2 (<= .cse41 0)) (.cse18 (< 0 .cse40)) (.cse13 (<= 0 (+ ~a0~0 599998))) (.cse14 (<= (+ ~a0~0 98) 0)) (.cse8 (<= .cse38 0)) (.cse36 (<= 340371 ~a29~0)) (.cse25 (not .cse34))) (let ((.cse10 (<= ~a2~0 4)) (.cse21 (or (and .cse13 .cse14 .cse8 (<= 38461 (+ ~a4~0 ~a29~0)) .cse25) (and .cse13 .cse14 .cse8 .cse36 .cse25))) (.cse3 (<= 220362 ~a29~0)) (.cse0 (or (and .cse2 .cse18) (<= 0 (+ ~a0~0 44)))) (.cse33 (<= ~a29~0 42)) (.cse22 (< 43 ~a29~0)) (.cse23 (exists ((v_~a0~0_828 Int)) (let ((.cse39 (div v_~a0~0_828 5))) (and (<= 0 (+ (* 10 .cse39) 3459790)) (<= 0 v_~a0~0_828) (<= v_~a0~0_828 599970) (<= (div (+ (* .cse39 10) 3459790) (- 9)) ~a0~0))))) (.cse31 (<= 0 (+ ~a0~0 385464))) (.cse35 (or (and .cse32 .cse26 .cse30 .cse27) (and .cse13 .cse32 .cse15 .cse30))) (.cse17 (= 3 ~a2~0)) (.cse29 (or .cse2 .cse18 (< 0 .cse38) (not (= 4 ULTIMATE.start_calculate_output_~input)))) (.cse4 (<= ~a0~0 599970)) (.cse6 (<= 0 (+ ~a29~0 599999))) (.cse16 (<= (+ ~a29~0 144) 0)) (.cse24 (= 1 ~a2~0)) (.cse12 (<= .cse37 0)) (.cse1 (<= (+ ~a0~0 61) 0)) (.cse20 (= 2 ~a2~0)) (.cse7 (<= 0 (+ ~a29~0 142))) (.cse28 (<= ~a29~0 43)) (.cse11 (<= 4 ~a2~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse1) (and .cse4 (let ((.cse5 (let ((.cse9 (<= 13 ~a0~0))) (or (and .cse8 .cse9 (<= (+ ~a29~0 196) 0) .cse10) (and .cse2 .cse9 .cse10))))) (or (and (<= 43131 ~a0~0) .cse5 .cse6) (and .cse5 .cse7))) .cse11 .cse12) (and .cse13 .cse14 .cse8 .cse11 (exists ((v_~a29~0_896 Int)) (and (<= (+ (mod v_~a29~0_896 299978) 300022) ~a29~0) (< 43 v_~a29~0_896) (<= 0 v_~a29~0_896)))) (and .cse13 .cse8 .cse15 .cse16 .cse17) (and .cse14 .cse8 .cse11 .cse18 .cse10) (and .cse14 .cse8 .cse19 .cse18 .cse17) (and .cse13 .cse19 .cse15 .cse20) (and .cse11 .cse3 .cse21) (and .cse8 .cse15 .cse17 .cse22 .cse23) (and .cse8 .cse15 .cse24 .cse7 .cse23) (and .cse4 .cse2 .cse11 .cse25 .cse22) (and .cse8 .cse19 .cse26 .cse27 .cse28 .cse29 .cse17) (and .cse4 .cse2 .cse30 .cse12 .cse7) (and .cse13 .cse8 .cse15 .cse11 .cse25) (and (<= 5 ~a2~0) .cse27 .cse21) (and .cse31 (or (and (<= 280404 ~a29~0) .cse8 .cse15) (and .cse8 .cse26 .cse15 .cse3) (and .cse32 .cse8 .cse15 .cse26 .cse33 .cse34 .cse7))) (and .cse13 .cse4 .cse8 .cse19 .cse24 .cse28) (and .cse14 .cse8 .cse26 .cse27 .cse16 .cse17 .cse29) (and .cse14 .cse8 .cse28 .cse18 .cse11 .cse7) (and .cse2 .cse25 .cse1) (and .cse13 .cse8 .cse15 .cse12 .cse17 .cse29) (and .cse13 .cse14 .cse8 .cse12 .cse29 .cse17 .cse7) (and .cse8 .cse19 .cse0 .cse33 .cse34) (and .cse35 .cse22 .cse23) (and .cse2 .cse32 (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse20) (and .cse14 .cse8 (<= 43 ~a29~0) .cse18 .cse20) (and .cse14 .cse8 .cse24 .cse18 .cse6) (and .cse31 .cse19 .cse35) (and .cse4 .cse2 .cse19 .cse17) (and .cse13 .cse14 .cse8 .cse6 .cse16 .cse17 .cse29) (and .cse4 .cse2 .cse6 .cse16 (<= ~a2~0 3)) (and .cse32 .cse8 .cse26 .cse15 .cse6 .cse16 .cse34) (and .cse8 .cse24 .cse18 .cse12 .cse1 .cse7) (and .cse13 .cse14 .cse19 .cse28 .cse20) (and .cse13 .cse14 .cse36 .cse20) (and .cse8 .cse26 .cse27 .cse28 .cse11 .cse25 .cse7) (and .cse2 .cse19 .cse28 .cse11 .cse25)))))) [2019-12-07 16:31:23,932 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-12-07 16:31:23,932 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-12-07 16:31:23,932 INFO L246 CegarLoopResult]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,932 INFO L246 CegarLoopResult]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,932 INFO L246 CegarLoopResult]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,932 INFO L246 CegarLoopResult]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,932 INFO L246 CegarLoopResult]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,932 INFO L246 CegarLoopResult]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,932 INFO L246 CegarLoopResult]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,932 INFO L246 CegarLoopResult]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 16:31:23,932 INFO L246 CegarLoopResult]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,932 INFO L246 CegarLoopResult]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-12-07 16:31:23,932 INFO L249 CegarLoopResult]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-12-07 16:31:23,932 INFO L246 CegarLoopResult]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,932 INFO L246 CegarLoopResult]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-12-07 16:31:23,932 INFO L246 CegarLoopResult]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-12-07 16:31:23,932 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 16:31:23,932 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-12-07 16:31:23,932 INFO L246 CegarLoopResult]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,932 INFO L246 CegarLoopResult]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,933 INFO L246 CegarLoopResult]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,933 INFO L246 CegarLoopResult]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,933 INFO L246 CegarLoopResult]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,933 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-12-07 16:31:23,933 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-12-07 16:31:23,933 INFO L246 CegarLoopResult]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,933 INFO L246 CegarLoopResult]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-12-07 16:31:23,933 INFO L246 CegarLoopResult]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-12-07 16:31:23,933 INFO L246 CegarLoopResult]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,933 INFO L246 CegarLoopResult]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,933 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,933 INFO L246 CegarLoopResult]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,933 INFO L246 CegarLoopResult]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,934 INFO L246 CegarLoopResult]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,934 INFO L242 CegarLoopResult]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse39 (+ ~a4~0 86)) (.cse38 (+ ~a29~0 16)) (.cse41 (+ ~a0~0 147))) (let ((.cse17 (<= 0 (+ ~a0~0 599998))) (.cse25 (<= (+ ~a0~0 149) 0)) (.cse27 (<= 0 (+ ~a0~0 384412))) (.cse31 (<= ~a2~0 2)) (.cse21 (<= .cse41 0)) (.cse3 (< 0 .cse38)) (.cse35 (= 4 ~a2~0)) (.cse6 (<= .cse39 0)) (.cse23 (< 0 .cse41)) (.cse37 (+ ~a4~0 42))) (let ((.cse4 (< 43 ~a29~0)) (.cse5 (exists ((v_~a0~0_828 Int)) (let ((.cse40 (div v_~a0~0_828 5))) (and (<= 0 (+ (* 10 .cse40) 3459790)) (<= 0 v_~a0~0_828) (<= v_~a0~0_828 599970) (<= (div (+ (* .cse40 10) 3459790) (- 9)) ~a0~0))))) (.cse20 (<= 38461 (+ ~a4~0 ~a29~0))) (.cse7 (<= 220362 ~a29~0)) (.cse36 (or .cse6 .cse23 (< 0 .cse37) (not (= 4 ULTIMATE.start_calculate_output_~input)))) (.cse19 (<= 5 ~a2~0)) (.cse22 (not .cse35)) (.cse33 (or .cse3 (< 0 .cse39))) (.cse29 (= 1 ~a2~0)) (.cse16 (<= .cse38 0)) (.cse1 (<= (+ ~a0~0 61) 0)) (.cse11 (<= 0 (+ ~a29~0 142))) (.cse8 (<= ~a0~0 599970)) (.cse0 (or (and .cse6 .cse23) (<= 0 (+ ~a0~0 44)))) (.cse34 (<= ~a29~0 42)) (.cse15 (<= 4 ~a2~0)) (.cse14 (<= ~a2~0 4)) (.cse28 (<= ~a29~0 43)) (.cse32 (<= 0 (+ ~a0~0 385464))) (.cse2 (or (and .cse17 .cse25 .cse31) (and .cse27 .cse31 .cse21))) (.cse26 (= 2 ~a2~0)) (.cse18 (<= (+ ~a0~0 98) 0)) (.cse12 (<= .cse37 0)) (.cse10 (<= 0 (+ ~a29~0 599999))) (.cse30 (<= (+ ~a29~0 144) 0)) (.cse24 (= 3 ~a2~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse1) (and .cse8 (let ((.cse9 (let ((.cse13 (<= 13 ~a0~0))) (or (and .cse12 .cse13 (<= (+ ~a29~0 196) 0) .cse14) (and .cse6 .cse13 .cse14))))) (or (and (<= 43131 ~a0~0) .cse9 .cse10) (and .cse9 .cse11))) .cse15 .cse16) (and .cse17 .cse18 .cse12 .cse15 (exists ((v_~a29~0_896 Int)) (and (<= (+ (mod v_~a29~0_896 299978) 300022) ~a29~0) (< 43 v_~a29~0_896) (<= 0 v_~a29~0_896)))) (and .cse17 .cse19 .cse18 .cse12 .cse20 .cse21 .cse22) (and .cse18 .cse12 .cse15 .cse23 .cse14) (and .cse18 .cse12 .cse3 .cse23 .cse24) (and .cse17 .cse3 .cse25 .cse26) (and .cse12 .cse3 .cse27 .cse21 .cse28 .cse24) (and .cse17 .cse19 .cse12 .cse25) (and .cse12 .cse25 .cse24 .cse4 .cse5) (and .cse12 .cse25 .cse29 .cse11 .cse5) (and .cse17 .cse18 .cse12 .cse21 .cse30 .cse24) (and .cse17 .cse18 .cse12 .cse20 .cse15 .cse7 .cse22) (and .cse8 .cse6 .cse31 .cse16 .cse11) (and .cse6 .cse29 .cse30) (and .cse18 .cse12 .cse27 .cse28 .cse15 .cse22 .cse11) (and .cse6 .cse22 .cse1) (and .cse32 (or (and .cse12 (<= 280404 ~a29~0) .cse25) (and .cse12 .cse27 .cse25 .cse7) (and .cse33 .cse12 .cse25 .cse27 .cse34 .cse35 .cse11))) (and .cse17 .cse12 .cse25 .cse16 .cse24 .cse36) (and .cse17 .cse18 .cse12 .cse16 .cse36 .cse24 .cse11) (and .cse8 .cse6 .cse33 .cse15 .cse22) (and .cse6 .cse33 (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse26) (and .cse18 .cse12 (<= 43 ~a29~0) .cse23 .cse26) (and .cse6 .cse19 .cse33 .cse28 .cse22) (and .cse8 .cse17 .cse12 .cse3 .cse29 .cse28) (and .cse18 .cse12 .cse29 .cse23 .cse10) (and .cse8 .cse6 .cse3 .cse24) (and .cse33 .cse12 .cse27 .cse25 .cse10 .cse30 .cse35) (and .cse12 .cse29 .cse23 .cse16 .cse1 .cse11) (and .cse8 .cse6 .cse10 .cse30 (<= ~a2~0 3)) (and .cse12 .cse0 .cse3 .cse34 .cse15 .cse14) (and .cse17 .cse18 .cse3 .cse28 .cse26) (and .cse32 .cse2 .cse3) (and .cse17 .cse18 (<= 340371 ~a29~0) .cse26) (and .cse17 .cse18 .cse12 .cse10 .cse30 .cse24))))) [2019-12-07 16:31:23,934 INFO L246 CegarLoopResult]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,934 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 16:31:23,934 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-12-07 16:31:23,934 INFO L246 CegarLoopResult]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,935 INFO L246 CegarLoopResult]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,935 INFO L246 CegarLoopResult]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,935 INFO L246 CegarLoopResult]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,935 INFO L246 CegarLoopResult]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,935 INFO L246 CegarLoopResult]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,935 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-12-07 16:31:23,935 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-12-07 16:31:23,935 INFO L246 CegarLoopResult]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,935 INFO L246 CegarLoopResult]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,935 INFO L246 CegarLoopResult]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-12-07 16:31:23,935 INFO L246 CegarLoopResult]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,935 INFO L246 CegarLoopResult]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,936 INFO L246 CegarLoopResult]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,936 INFO L246 CegarLoopResult]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,936 INFO L246 CegarLoopResult]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,936 INFO L246 CegarLoopResult]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,936 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-12-07 16:31:23,936 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-12-07 16:31:23,936 INFO L246 CegarLoopResult]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,936 INFO L246 CegarLoopResult]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,936 INFO L246 CegarLoopResult]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,936 INFO L246 CegarLoopResult]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,936 INFO L246 CegarLoopResult]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,936 INFO L246 CegarLoopResult]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,936 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 16:31:23,936 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 16:31:23,936 INFO L246 CegarLoopResult]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,936 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-12-07 16:31:23,936 INFO L246 CegarLoopResult]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,936 INFO L246 CegarLoopResult]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,937 INFO L246 CegarLoopResult]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,938 INFO L246 CegarLoopResult]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,938 INFO L246 CegarLoopResult]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-12-07 16:31:23,938 INFO L246 CegarLoopResult]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-12-07 16:31:23,938 INFO L246 CegarLoopResult]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,938 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-12-07 16:31:23,938 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-12-07 16:31:23,938 INFO L246 CegarLoopResult]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,938 INFO L246 CegarLoopResult]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,938 INFO L246 CegarLoopResult]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,938 INFO L246 CegarLoopResult]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,938 INFO L246 CegarLoopResult]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,938 INFO L246 CegarLoopResult]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,938 INFO L242 CegarLoopResult]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse39 (+ ~a4~0 86)) (.cse38 (+ ~a29~0 16)) (.cse41 (+ ~a0~0 147))) (let ((.cse17 (<= 0 (+ ~a0~0 599998))) (.cse25 (<= (+ ~a0~0 149) 0)) (.cse27 (<= 0 (+ ~a0~0 384412))) (.cse31 (<= ~a2~0 2)) (.cse21 (<= .cse41 0)) (.cse3 (< 0 .cse38)) (.cse35 (= 4 ~a2~0)) (.cse6 (<= .cse39 0)) (.cse23 (< 0 .cse41)) (.cse37 (+ ~a4~0 42))) (let ((.cse4 (< 43 ~a29~0)) (.cse5 (exists ((v_~a0~0_828 Int)) (let ((.cse40 (div v_~a0~0_828 5))) (and (<= 0 (+ (* 10 .cse40) 3459790)) (<= 0 v_~a0~0_828) (<= v_~a0~0_828 599970) (<= (div (+ (* .cse40 10) 3459790) (- 9)) ~a0~0))))) (.cse20 (<= 38461 (+ ~a4~0 ~a29~0))) (.cse7 (<= 220362 ~a29~0)) (.cse36 (or .cse6 .cse23 (< 0 .cse37) (not (= 4 ULTIMATE.start_calculate_output_~input)))) (.cse19 (<= 5 ~a2~0)) (.cse22 (not .cse35)) (.cse33 (or .cse3 (< 0 .cse39))) (.cse29 (= 1 ~a2~0)) (.cse16 (<= .cse38 0)) (.cse1 (<= (+ ~a0~0 61) 0)) (.cse11 (<= 0 (+ ~a29~0 142))) (.cse8 (<= ~a0~0 599970)) (.cse0 (or (and .cse6 .cse23) (<= 0 (+ ~a0~0 44)))) (.cse34 (<= ~a29~0 42)) (.cse15 (<= 4 ~a2~0)) (.cse14 (<= ~a2~0 4)) (.cse28 (<= ~a29~0 43)) (.cse32 (<= 0 (+ ~a0~0 385464))) (.cse2 (or (and .cse17 .cse25 .cse31) (and .cse27 .cse31 .cse21))) (.cse26 (= 2 ~a2~0)) (.cse18 (<= (+ ~a0~0 98) 0)) (.cse12 (<= .cse37 0)) (.cse10 (<= 0 (+ ~a29~0 599999))) (.cse30 (<= (+ ~a29~0 144) 0)) (.cse24 (= 3 ~a2~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse1) (and .cse8 (let ((.cse9 (let ((.cse13 (<= 13 ~a0~0))) (or (and .cse12 .cse13 (<= (+ ~a29~0 196) 0) .cse14) (and .cse6 .cse13 .cse14))))) (or (and (<= 43131 ~a0~0) .cse9 .cse10) (and .cse9 .cse11))) .cse15 .cse16) (and .cse17 .cse18 .cse12 .cse15 (exists ((v_~a29~0_896 Int)) (and (<= (+ (mod v_~a29~0_896 299978) 300022) ~a29~0) (< 43 v_~a29~0_896) (<= 0 v_~a29~0_896)))) (and .cse17 .cse19 .cse18 .cse12 .cse20 .cse21 .cse22) (and .cse18 .cse12 .cse15 .cse23 .cse14) (and .cse18 .cse12 .cse3 .cse23 .cse24) (and .cse17 .cse3 .cse25 .cse26) (and .cse12 .cse3 .cse27 .cse21 .cse28 .cse24) (and .cse17 .cse19 .cse12 .cse25) (and .cse12 .cse25 .cse24 .cse4 .cse5) (and .cse12 .cse25 .cse29 .cse11 .cse5) (and .cse17 .cse18 .cse12 .cse21 .cse30 .cse24) (and .cse17 .cse18 .cse12 .cse20 .cse15 .cse7 .cse22) (and .cse8 .cse6 .cse31 .cse16 .cse11) (and .cse6 .cse29 .cse30) (and .cse18 .cse12 .cse27 .cse28 .cse15 .cse22 .cse11) (and .cse6 .cse22 .cse1) (and .cse32 (or (and .cse12 (<= 280404 ~a29~0) .cse25) (and .cse12 .cse27 .cse25 .cse7) (and .cse33 .cse12 .cse25 .cse27 .cse34 .cse35 .cse11))) (and .cse17 .cse12 .cse25 .cse16 .cse24 .cse36) (and .cse17 .cse18 .cse12 .cse16 .cse36 .cse24 .cse11) (and .cse8 .cse6 .cse33 .cse15 .cse22) (and .cse6 .cse33 (not (= 6 ULTIMATE.start_calculate_output_~input)) .cse26) (and .cse18 .cse12 (<= 43 ~a29~0) .cse23 .cse26) (and .cse6 .cse19 .cse33 .cse28 .cse22) (and .cse8 .cse17 .cse12 .cse3 .cse29 .cse28) (and .cse18 .cse12 .cse29 .cse23 .cse10) (and .cse8 .cse6 .cse3 .cse24) (and .cse33 .cse12 .cse27 .cse25 .cse10 .cse30 .cse35) (and .cse12 .cse29 .cse23 .cse16 .cse1 .cse11) (and .cse8 .cse6 .cse10 .cse30 (<= ~a2~0 3)) (and .cse12 .cse0 .cse3 .cse34 .cse15 .cse14) (and .cse17 .cse18 .cse3 .cse28 .cse26) (and .cse32 .cse2 .cse3) (and .cse17 .cse18 (<= 340371 ~a29~0) .cse26) (and .cse17 .cse18 .cse12 .cse10 .cse30 .cse24))))) [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L205(line 205) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-12-07 16:31:23,939 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,940 INFO L246 CegarLoopResult]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,941 INFO L246 CegarLoopResult]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-12-07 16:31:23,942 INFO L246 CegarLoopResult]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,943 INFO L246 CegarLoopResult]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-12-07 16:31:23,943 INFO L246 CegarLoopResult]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-12-07 16:31:23,943 INFO L246 CegarLoopResult]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,943 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-12-07 16:31:23,943 INFO L246 CegarLoopResult]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,943 INFO L246 CegarLoopResult]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 16:31:23,943 INFO L246 CegarLoopResult]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-12-07 16:31:23,943 INFO L246 CegarLoopResult]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,943 INFO L246 CegarLoopResult]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,943 INFO L246 CegarLoopResult]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 16:31:23,943 INFO L246 CegarLoopResult]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-12-07 16:31:23,943 INFO L246 CegarLoopResult]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-12-07 16:31:23,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:23,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:23,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:23,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:23,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:23,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:23,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,980 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,980 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,986 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,986 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,986 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:23,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:23,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:23,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,992 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,992 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,992 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,992 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,993 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:23,993 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:23,993 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:23,993 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,993 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,993 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:23,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:23,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:23,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,999 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,999 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,999 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,999 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,999 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:23,999 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,000 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,000 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,000 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,000 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,001 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,003 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,006 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,006 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,006 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,006 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:31:24 BoogieIcfgContainer [2019-12-07 16:31:24,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:31:24,011 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:31:24,011 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:31:24,011 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:31:24,011 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:28:18" (3/4) ... [2019-12-07 16:31:24,014 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 16:31:24,043 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 16:31:24,046 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 16:31:24,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44) && a0 + 61 <= 0) || ((((((0 <= a0 + 599998 && a0 + 149 <= 0) && a2 <= 2) || ((0 <= a0 + 384412 && a2 <= 2) && a0 + 147 <= 0)) && 0 < a29 + 16) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || ((a4 + 86 <= 0 && 220362 <= a29) && a0 + 61 <= 0)) || (((a0 <= 599970 && (((43131 <= a0 && ((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4))) && 0 <= a29 + 599999) || (((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4)) && 0 <= a29 + 142))) && 4 <= a2) && a29 + 16 <= 0)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 4 <= a2) && (\exists v_~a29~0_896 : int :: (v_~a29~0_896 % 299978 + 300022 <= a29 && 43 < v_~a29~0_896) && 0 <= v_~a29~0_896))) || ((((((0 <= a0 + 599998 && 5 <= a2) && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && a0 + 147 <= 0) && !(4 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147) && a2 <= 4)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 0 < a0 + 147) && 3 == a2)) || (((0 <= a0 + 599998 && 0 < a29 + 16) && a0 + 149 <= 0) && 2 == a2)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 <= a0 + 384412) && a0 + 147 <= 0) && a29 <= 43) && 3 == a2)) || (((0 <= a0 + 599998 && 5 <= a2) && a4 + 42 <= 0) && a0 + 149 <= 0)) || ((((a4 + 42 <= 0 && a0 + 149 <= 0) && 3 == a2) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || ((((a4 + 42 <= 0 && a0 + 149 <= 0) && 1 == a2) && 0 <= a29 + 142) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || (((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && a0 + 147 <= 0) && a29 + 144 <= 0) && 3 == a2)) || ((((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && 4 <= a2) && 220362 <= a29) && !(4 == a2))) || ((((a0 <= 599970 && a4 + 86 <= 0) && a2 <= 2) && a29 + 16 <= 0) && 0 <= a29 + 142)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || ((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a0 + 384412) && a29 <= 43) && 4 <= a2) && !(4 == a2)) && 0 <= a29 + 142)) || ((a4 + 86 <= 0 && !(4 == a2)) && a0 + 61 <= 0)) || (0 <= a0 + 385464 && ((((a4 + 42 <= 0 && 280404 <= a29) && a0 + 149 <= 0) || (((a4 + 42 <= 0 && 0 <= a0 + 384412) && a0 + 149 <= 0) && 220362 <= a29)) || (((((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && a0 + 149 <= 0) && 0 <= a0 + 384412) && a29 <= 42) && 4 == a2) && 0 <= a29 + 142)))) || (((((0 <= a0 + 599998 && a4 + 42 <= 0) && a0 + 149 <= 0) && a29 + 16 <= 0) && 3 == a2) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input)))) || ((((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && a29 + 16 <= 0) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) && 3 == a2) && 0 <= a29 + 142)) || ((((a0 <= 599970 && a4 + 86 <= 0) && (0 < a29 + 16 || 0 < a4 + 86)) && 4 <= a2) && !(4 == a2))) || (((a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && !(6 == input)) && 2 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 43 <= a29) && 0 < a0 + 147) && 2 == a2)) || ((((a4 + 86 <= 0 && 5 <= a2) && (0 < a29 + 16 || 0 < a4 + 86)) && a29 <= 43) && !(4 == a2))) || (((((a0 <= 599970 && 0 <= a0 + 599998) && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && a29 <= 43)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 599999)) || (((a0 <= 599970 && a4 + 86 <= 0) && 0 < a29 + 16) && 3 == a2)) || (((((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && 0 <= a0 + 384412) && a0 + 149 <= 0) && 0 <= a29 + 599999) && a29 + 144 <= 0) && 4 == a2)) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a0 + 147) && a29 + 16 <= 0) && a0 + 61 <= 0) && 0 <= a29 + 142)) || ((((a0 <= 599970 && a4 + 86 <= 0) && 0 <= a29 + 599999) && a29 + 144 <= 0) && a2 <= 3)) || (((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44)) && 0 < a29 + 16) && a29 <= 42) && 4 <= a2) && a2 <= 4)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && 0 < a29 + 16) && a29 <= 43) && 2 == a2)) || ((0 <= a0 + 385464 && (((0 <= a0 + 599998 && a0 + 149 <= 0) && a2 <= 2) || ((0 <= a0 + 384412 && a2 <= 2) && a0 + 147 <= 0))) && 0 < a29 + 16)) || (((0 <= a0 + 599998 && a0 + 98 <= 0) && 340371 <= a29) && 2 == a2)) || (((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 <= a29 + 599999) && a29 + 144 <= 0) && 3 == a2) [2019-12-07 16:31:24,072 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44) && a0 + 61 <= 0) || ((((((0 <= a0 + 599998 && a0 + 149 <= 0) && a2 <= 2) || ((0 <= a0 + 384412 && a2 <= 2) && a0 + 147 <= 0)) && 0 < a29 + 16) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || ((a4 + 86 <= 0 && 220362 <= a29) && a0 + 61 <= 0)) || (((a0 <= 599970 && (((43131 <= a0 && ((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4))) && 0 <= a29 + 599999) || (((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4)) && 0 <= a29 + 142))) && 4 <= a2) && a29 + 16 <= 0)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 4 <= a2) && (\exists v_~a29~0_896 : int :: (v_~a29~0_896 % 299978 + 300022 <= a29 && 43 < v_~a29~0_896) && 0 <= v_~a29~0_896))) || ((((((0 <= a0 + 599998 && 5 <= a2) && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && a0 + 147 <= 0) && !(4 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147) && a2 <= 4)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 0 < a0 + 147) && 3 == a2)) || (((0 <= a0 + 599998 && 0 < a29 + 16) && a0 + 149 <= 0) && 2 == a2)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 <= a0 + 384412) && a0 + 147 <= 0) && a29 <= 43) && 3 == a2)) || (((0 <= a0 + 599998 && 5 <= a2) && a4 + 42 <= 0) && a0 + 149 <= 0)) || ((((a4 + 42 <= 0 && a0 + 149 <= 0) && 3 == a2) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || ((((a4 + 42 <= 0 && a0 + 149 <= 0) && 1 == a2) && 0 <= a29 + 142) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || (((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && a0 + 147 <= 0) && a29 + 144 <= 0) && 3 == a2)) || ((((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && 4 <= a2) && 220362 <= a29) && !(4 == a2))) || ((((a0 <= 599970 && a4 + 86 <= 0) && a2 <= 2) && a29 + 16 <= 0) && 0 <= a29 + 142)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || ((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a0 + 384412) && a29 <= 43) && 4 <= a2) && !(4 == a2)) && 0 <= a29 + 142)) || ((a4 + 86 <= 0 && !(4 == a2)) && a0 + 61 <= 0)) || (0 <= a0 + 385464 && ((((a4 + 42 <= 0 && 280404 <= a29) && a0 + 149 <= 0) || (((a4 + 42 <= 0 && 0 <= a0 + 384412) && a0 + 149 <= 0) && 220362 <= a29)) || (((((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && a0 + 149 <= 0) && 0 <= a0 + 384412) && a29 <= 42) && 4 == a2) && 0 <= a29 + 142)))) || (((((0 <= a0 + 599998 && a4 + 42 <= 0) && a0 + 149 <= 0) && a29 + 16 <= 0) && 3 == a2) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input)))) || ((((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && a29 + 16 <= 0) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) && 3 == a2) && 0 <= a29 + 142)) || ((((a0 <= 599970 && a4 + 86 <= 0) && (0 < a29 + 16 || 0 < a4 + 86)) && 4 <= a2) && !(4 == a2))) || (((a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && !(6 == input)) && 2 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 43 <= a29) && 0 < a0 + 147) && 2 == a2)) || ((((a4 + 86 <= 0 && 5 <= a2) && (0 < a29 + 16 || 0 < a4 + 86)) && a29 <= 43) && !(4 == a2))) || (((((a0 <= 599970 && 0 <= a0 + 599998) && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && a29 <= 43)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 599999)) || (((a0 <= 599970 && a4 + 86 <= 0) && 0 < a29 + 16) && 3 == a2)) || (((((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && 0 <= a0 + 384412) && a0 + 149 <= 0) && 0 <= a29 + 599999) && a29 + 144 <= 0) && 4 == a2)) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a0 + 147) && a29 + 16 <= 0) && a0 + 61 <= 0) && 0 <= a29 + 142)) || ((((a0 <= 599970 && a4 + 86 <= 0) && 0 <= a29 + 599999) && a29 + 144 <= 0) && a2 <= 3)) || (((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44)) && 0 < a29 + 16) && a29 <= 42) && 4 <= a2) && a2 <= 4)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && 0 < a29 + 16) && a29 <= 43) && 2 == a2)) || ((0 <= a0 + 385464 && (((0 <= a0 + 599998 && a0 + 149 <= 0) && a2 <= 2) || ((0 <= a0 + 384412 && a2 <= 2) && a0 + 147 <= 0))) && 0 < a29 + 16)) || (((0 <= a0 + 599998 && a0 + 98 <= 0) && 340371 <= a29) && 2 == a2)) || (((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 <= a29 + 599999) && a29 + 144 <= 0) && 3 == a2) [2019-12-07 16:31:24,083 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44) && a0 + 61 <= 0) || ((a4 + 86 <= 0 && 220362 <= a29) && a0 + 61 <= 0)) || (((a0 <= 599970 && (((43131 <= a0 && ((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4))) && 0 <= a29 + 599999) || (((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4)) && 0 <= a29 + 142))) && 4 <= a2) && a29 + 16 <= 0)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 4 <= a2) && (\exists v_~a29~0_896 : int :: (v_~a29~0_896 % 299978 + 300022 <= a29 && 43 < v_~a29~0_896) && 0 <= v_~a29~0_896))) || ((((0 <= a0 + 599998 && a4 + 42 <= 0) && a0 + 149 <= 0) && a29 + 144 <= 0) && 3 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147) && a2 <= 4)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 0 < a0 + 147) && 3 == a2)) || (((0 <= a0 + 599998 && 0 < a29 + 16) && a0 + 149 <= 0) && 2 == a2)) || ((4 <= a2 && 220362 <= a29) && (((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && !(4 == a2)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 340371 <= a29) && !(4 == a2))))) || ((((a4 + 42 <= 0 && a0 + 149 <= 0) && 3 == a2) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || ((((a4 + 42 <= 0 && a0 + 149 <= 0) && 1 == a2) && 0 <= a29 + 142) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || ((((a0 <= 599970 && a4 + 86 <= 0) && 4 <= a2) && !(4 == a2)) && 43 < a29)) || ((((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 <= a0 + 384412) && a0 + 147 <= 0) && a29 <= 43) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) && 3 == a2)) || ((((a0 <= 599970 && a4 + 86 <= 0) && a2 <= 2) && a29 + 16 <= 0) && 0 <= a29 + 142)) || ((((0 <= a0 + 599998 && a4 + 42 <= 0) && a0 + 149 <= 0) && 4 <= a2) && !(4 == a2))) || ((5 <= a2 && a0 + 147 <= 0) && (((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && !(4 == a2)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 340371 <= a29) && !(4 == a2))))) || (0 <= a0 + 385464 && ((((280404 <= a29 && a4 + 42 <= 0) && a0 + 149 <= 0) || (((a4 + 42 <= 0 && 0 <= a0 + 384412) && a0 + 149 <= 0) && 220362 <= a29)) || (((((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && a0 + 149 <= 0) && 0 <= a0 + 384412) && a29 <= 42) && 4 == a2) && 0 <= a29 + 142)))) || (((((0 <= a0 + 599998 && a0 <= 599970) && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && a29 <= 43)) || ((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a0 + 384412) && a0 + 147 <= 0) && a29 + 144 <= 0) && 3 == a2) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input)))) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 43) && 0 < a0 + 147) && 4 <= a2) && 0 <= a29 + 142)) || ((a4 + 86 <= 0 && !(4 == a2)) && a0 + 61 <= 0)) || (((((0 <= a0 + 599998 && a4 + 42 <= 0) && a0 + 149 <= 0) && a29 + 16 <= 0) && 3 == a2) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input)))) || ((((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && a29 + 16 <= 0) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) && 3 == a2) && 0 <= a29 + 142)) || ((((a4 + 42 <= 0 && 0 < a29 + 16) && ((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44)) && a29 <= 42) && 4 == a2)) || (((((((0 < a29 + 16 || 0 < a4 + 86) && 0 <= a0 + 384412) && a2 <= 2) && a0 + 147 <= 0) || (((0 <= a0 + 599998 && (0 < a29 + 16 || 0 < a4 + 86)) && a0 + 149 <= 0) && a2 <= 2)) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || (((a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && !(6 == input)) && 2 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 43 <= a29) && 0 < a0 + 147) && 2 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 599999)) || ((0 <= a0 + 385464 && 0 < a29 + 16) && (((((0 < a29 + 16 || 0 < a4 + 86) && 0 <= a0 + 384412) && a2 <= 2) && a0 + 147 <= 0) || (((0 <= a0 + 599998 && (0 < a29 + 16 || 0 < a4 + 86)) && a0 + 149 <= 0) && a2 <= 2)))) || (((a0 <= 599970 && a4 + 86 <= 0) && 0 < a29 + 16) && 3 == a2)) || ((((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 <= a29 + 599999) && a29 + 144 <= 0) && 3 == a2) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input)))) || ((((a0 <= 599970 && a4 + 86 <= 0) && 0 <= a29 + 599999) && a29 + 144 <= 0) && a2 <= 3)) || (((((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && 0 <= a0 + 384412) && a0 + 149 <= 0) && 0 <= a29 + 599999) && a29 + 144 <= 0) && 4 == a2)) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a0 + 147) && a29 + 16 <= 0) && a0 + 61 <= 0) && 0 <= a29 + 142)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && 0 < a29 + 16) && a29 <= 43) && 2 == a2)) || (((0 <= a0 + 599998 && a0 + 98 <= 0) && 340371 <= a29) && 2 == a2)) || ((((((a4 + 42 <= 0 && 0 <= a0 + 384412) && a0 + 147 <= 0) && a29 <= 43) && 4 <= a2) && !(4 == a2)) && 0 <= a29 + 142)) || ((((a4 + 86 <= 0 && 0 < a29 + 16) && a29 <= 43) && 4 <= a2) && !(4 == a2)) [2019-12-07 16:31:24,185 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b546ec7c-b964-4f8a-b061-9bbeefe78896/bin/uautomizer/witness.graphml [2019-12-07 16:31:24,186 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:31:24,187 INFO L168 Benchmark]: Toolchain (without parser) took 188658.31 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 932.6 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-12-07 16:31:24,187 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:31:24,187 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 932.6 MB in the beginning and 1.0 GB in the end (delta: -96.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:31:24,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 138.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 990.6 MB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:31:24,188 INFO L168 Benchmark]: Boogie Preprocessor took 141.49 ms. Allocated memory is still 1.1 GB. Free memory was 990.6 MB in the beginning and 962.2 MB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:31:24,188 INFO L168 Benchmark]: RCFGBuilder took 1621.03 ms. Allocated memory is still 1.1 GB. Free memory was 962.2 MB in the beginning and 896.1 MB in the end (delta: 66.1 MB). Peak memory consumption was 152.8 MB. Max. memory is 11.5 GB. [2019-12-07 16:31:24,188 INFO L168 Benchmark]: TraceAbstraction took 185908.08 ms. Allocated memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 896.1 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2019-12-07 16:31:24,188 INFO L168 Benchmark]: Witness Printer took 174.83 ms. Allocated memory is still 4.5 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 94.6 MB). Peak memory consumption was 94.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:31:24,190 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 671.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 932.6 MB in the beginning and 1.0 GB in the end (delta: -96.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 138.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 990.6 MB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 141.49 ms. Allocated memory is still 1.1 GB. Free memory was 990.6 MB in the beginning and 962.2 MB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1621.03 ms. Allocated memory is still 1.1 GB. Free memory was 962.2 MB in the beginning and 896.1 MB in the end (delta: 66.1 MB). Peak memory consumption was 152.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 185908.08 ms. Allocated memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 896.1 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. * Witness Printer took 174.83 ms. Allocated memory is still 4.5 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 94.6 MB). Peak memory consumption was 94.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1766]: Loop Invariant [2019-12-07 16:31:24,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,196 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,196 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,196 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,197 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,197 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,197 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,197 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,197 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,197 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,198 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,198 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,200 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,201 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,202 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44) && a0 + 61 <= 0) || ((((((0 <= a0 + 599998 && a0 + 149 <= 0) && a2 <= 2) || ((0 <= a0 + 384412 && a2 <= 2) && a0 + 147 <= 0)) && 0 < a29 + 16) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || ((a4 + 86 <= 0 && 220362 <= a29) && a0 + 61 <= 0)) || (((a0 <= 599970 && (((43131 <= a0 && ((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4))) && 0 <= a29 + 599999) || (((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4)) && 0 <= a29 + 142))) && 4 <= a2) && a29 + 16 <= 0)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 4 <= a2) && (\exists v_~a29~0_896 : int :: (v_~a29~0_896 % 299978 + 300022 <= a29 && 43 < v_~a29~0_896) && 0 <= v_~a29~0_896))) || ((((((0 <= a0 + 599998 && 5 <= a2) && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && a0 + 147 <= 0) && !(4 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147) && a2 <= 4)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 0 < a0 + 147) && 3 == a2)) || (((0 <= a0 + 599998 && 0 < a29 + 16) && a0 + 149 <= 0) && 2 == a2)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 <= a0 + 384412) && a0 + 147 <= 0) && a29 <= 43) && 3 == a2)) || (((0 <= a0 + 599998 && 5 <= a2) && a4 + 42 <= 0) && a0 + 149 <= 0)) || ((((a4 + 42 <= 0 && a0 + 149 <= 0) && 3 == a2) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || ((((a4 + 42 <= 0 && a0 + 149 <= 0) && 1 == a2) && 0 <= a29 + 142) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || (((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && a0 + 147 <= 0) && a29 + 144 <= 0) && 3 == a2)) || ((((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && 4 <= a2) && 220362 <= a29) && !(4 == a2))) || ((((a0 <= 599970 && a4 + 86 <= 0) && a2 <= 2) && a29 + 16 <= 0) && 0 <= a29 + 142)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || ((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a0 + 384412) && a29 <= 43) && 4 <= a2) && !(4 == a2)) && 0 <= a29 + 142)) || ((a4 + 86 <= 0 && !(4 == a2)) && a0 + 61 <= 0)) || (0 <= a0 + 385464 && ((((a4 + 42 <= 0 && 280404 <= a29) && a0 + 149 <= 0) || (((a4 + 42 <= 0 && 0 <= a0 + 384412) && a0 + 149 <= 0) && 220362 <= a29)) || (((((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && a0 + 149 <= 0) && 0 <= a0 + 384412) && a29 <= 42) && 4 == a2) && 0 <= a29 + 142)))) || (((((0 <= a0 + 599998 && a4 + 42 <= 0) && a0 + 149 <= 0) && a29 + 16 <= 0) && 3 == a2) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input)))) || ((((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && a29 + 16 <= 0) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) && 3 == a2) && 0 <= a29 + 142)) || ((((a0 <= 599970 && a4 + 86 <= 0) && (0 < a29 + 16 || 0 < a4 + 86)) && 4 <= a2) && !(4 == a2))) || (((a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && !(6 == input)) && 2 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 43 <= a29) && 0 < a0 + 147) && 2 == a2)) || ((((a4 + 86 <= 0 && 5 <= a2) && (0 < a29 + 16 || 0 < a4 + 86)) && a29 <= 43) && !(4 == a2))) || (((((a0 <= 599970 && 0 <= a0 + 599998) && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && a29 <= 43)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 599999)) || (((a0 <= 599970 && a4 + 86 <= 0) && 0 < a29 + 16) && 3 == a2)) || (((((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && 0 <= a0 + 384412) && a0 + 149 <= 0) && 0 <= a29 + 599999) && a29 + 144 <= 0) && 4 == a2)) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a0 + 147) && a29 + 16 <= 0) && a0 + 61 <= 0) && 0 <= a29 + 142)) || ((((a0 <= 599970 && a4 + 86 <= 0) && 0 <= a29 + 599999) && a29 + 144 <= 0) && a2 <= 3)) || (((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44)) && 0 < a29 + 16) && a29 <= 42) && 4 <= a2) && a2 <= 4)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && 0 < a29 + 16) && a29 <= 43) && 2 == a2)) || ((0 <= a0 + 385464 && (((0 <= a0 + 599998 && a0 + 149 <= 0) && a2 <= 2) || ((0 <= a0 + 384412 && a2 <= 2) && a0 + 147 <= 0))) && 0 < a29 + 16)) || (((0 <= a0 + 599998 && a0 + 98 <= 0) && 340371 <= a29) && 2 == a2)) || (((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 <= a29 + 599999) && a29 + 144 <= 0) && 3 == a2) - InvariantResult [Line: 23]: Loop Invariant [2019-12-07 16:31:24,206 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,206 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,209 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,215 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,215 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,215 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44) && a0 + 61 <= 0) || ((((((0 <= a0 + 599998 && a0 + 149 <= 0) && a2 <= 2) || ((0 <= a0 + 384412 && a2 <= 2) && a0 + 147 <= 0)) && 0 < a29 + 16) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || ((a4 + 86 <= 0 && 220362 <= a29) && a0 + 61 <= 0)) || (((a0 <= 599970 && (((43131 <= a0 && ((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4))) && 0 <= a29 + 599999) || (((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4)) && 0 <= a29 + 142))) && 4 <= a2) && a29 + 16 <= 0)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 4 <= a2) && (\exists v_~a29~0_896 : int :: (v_~a29~0_896 % 299978 + 300022 <= a29 && 43 < v_~a29~0_896) && 0 <= v_~a29~0_896))) || ((((((0 <= a0 + 599998 && 5 <= a2) && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && a0 + 147 <= 0) && !(4 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147) && a2 <= 4)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 0 < a0 + 147) && 3 == a2)) || (((0 <= a0 + 599998 && 0 < a29 + 16) && a0 + 149 <= 0) && 2 == a2)) || (((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 <= a0 + 384412) && a0 + 147 <= 0) && a29 <= 43) && 3 == a2)) || (((0 <= a0 + 599998 && 5 <= a2) && a4 + 42 <= 0) && a0 + 149 <= 0)) || ((((a4 + 42 <= 0 && a0 + 149 <= 0) && 3 == a2) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || ((((a4 + 42 <= 0 && a0 + 149 <= 0) && 1 == a2) && 0 <= a29 + 142) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || (((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && a0 + 147 <= 0) && a29 + 144 <= 0) && 3 == a2)) || ((((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && 4 <= a2) && 220362 <= a29) && !(4 == a2))) || ((((a0 <= 599970 && a4 + 86 <= 0) && a2 <= 2) && a29 + 16 <= 0) && 0 <= a29 + 142)) || ((a4 + 86 <= 0 && 1 == a2) && a29 + 144 <= 0)) || ((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a0 + 384412) && a29 <= 43) && 4 <= a2) && !(4 == a2)) && 0 <= a29 + 142)) || ((a4 + 86 <= 0 && !(4 == a2)) && a0 + 61 <= 0)) || (0 <= a0 + 385464 && ((((a4 + 42 <= 0 && 280404 <= a29) && a0 + 149 <= 0) || (((a4 + 42 <= 0 && 0 <= a0 + 384412) && a0 + 149 <= 0) && 220362 <= a29)) || (((((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && a0 + 149 <= 0) && 0 <= a0 + 384412) && a29 <= 42) && 4 == a2) && 0 <= a29 + 142)))) || (((((0 <= a0 + 599998 && a4 + 42 <= 0) && a0 + 149 <= 0) && a29 + 16 <= 0) && 3 == a2) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input)))) || ((((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && a29 + 16 <= 0) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) && 3 == a2) && 0 <= a29 + 142)) || ((((a0 <= 599970 && a4 + 86 <= 0) && (0 < a29 + 16 || 0 < a4 + 86)) && 4 <= a2) && !(4 == a2))) || (((a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && !(6 == input)) && 2 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 43 <= a29) && 0 < a0 + 147) && 2 == a2)) || ((((a4 + 86 <= 0 && 5 <= a2) && (0 < a29 + 16 || 0 < a4 + 86)) && a29 <= 43) && !(4 == a2))) || (((((a0 <= 599970 && 0 <= a0 + 599998) && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && a29 <= 43)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 599999)) || (((a0 <= 599970 && a4 + 86 <= 0) && 0 < a29 + 16) && 3 == a2)) || (((((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && 0 <= a0 + 384412) && a0 + 149 <= 0) && 0 <= a29 + 599999) && a29 + 144 <= 0) && 4 == a2)) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a0 + 147) && a29 + 16 <= 0) && a0 + 61 <= 0) && 0 <= a29 + 142)) || ((((a0 <= 599970 && a4 + 86 <= 0) && 0 <= a29 + 599999) && a29 + 144 <= 0) && a2 <= 3)) || (((((a4 + 42 <= 0 && ((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44)) && 0 < a29 + 16) && a29 <= 42) && 4 <= a2) && a2 <= 4)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && 0 < a29 + 16) && a29 <= 43) && 2 == a2)) || ((0 <= a0 + 385464 && (((0 <= a0 + 599998 && a0 + 149 <= 0) && a2 <= 2) || ((0 <= a0 + 384412 && a2 <= 2) && a0 + 147 <= 0))) && 0 < a29 + 16)) || (((0 <= a0 + 599998 && a0 + 98 <= 0) && 340371 <= a29) && 2 == a2)) || (((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 <= a29 + 599999) && a29 + 144 <= 0) && 3 == a2) - InvariantResult [Line: 1658]: Loop Invariant [2019-12-07 16:31:24,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,219 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,220 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_896,QUANTIFIED] [2019-12-07 16:31:24,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,225 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] [2019-12-07 16:31:24,226 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_828,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44) && a0 + 61 <= 0) || ((a4 + 86 <= 0 && 220362 <= a29) && a0 + 61 <= 0)) || (((a0 <= 599970 && (((43131 <= a0 && ((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4))) && 0 <= a29 + 599999) || (((((a4 + 42 <= 0 && 13 <= a0) && a29 + 196 <= 0) && a2 <= 4) || ((a4 + 86 <= 0 && 13 <= a0) && a2 <= 4)) && 0 <= a29 + 142))) && 4 <= a2) && a29 + 16 <= 0)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 4 <= a2) && (\exists v_~a29~0_896 : int :: (v_~a29~0_896 % 299978 + 300022 <= a29 && 43 < v_~a29~0_896) && 0 <= v_~a29~0_896))) || ((((0 <= a0 + 599998 && a4 + 42 <= 0) && a0 + 149 <= 0) && a29 + 144 <= 0) && 3 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 4 <= a2) && 0 < a0 + 147) && a2 <= 4)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && 0 < a0 + 147) && 3 == a2)) || (((0 <= a0 + 599998 && 0 < a29 + 16) && a0 + 149 <= 0) && 2 == a2)) || ((4 <= a2 && 220362 <= a29) && (((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && !(4 == a2)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 340371 <= a29) && !(4 == a2))))) || ((((a4 + 42 <= 0 && a0 + 149 <= 0) && 3 == a2) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || ((((a4 + 42 <= 0 && a0 + 149 <= 0) && 1 == a2) && 0 <= a29 + 142) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || ((((a0 <= 599970 && a4 + 86 <= 0) && 4 <= a2) && !(4 == a2)) && 43 < a29)) || ((((((a4 + 42 <= 0 && 0 < a29 + 16) && 0 <= a0 + 384412) && a0 + 147 <= 0) && a29 <= 43) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) && 3 == a2)) || ((((a0 <= 599970 && a4 + 86 <= 0) && a2 <= 2) && a29 + 16 <= 0) && 0 <= a29 + 142)) || ((((0 <= a0 + 599998 && a4 + 42 <= 0) && a0 + 149 <= 0) && 4 <= a2) && !(4 == a2))) || ((5 <= a2 && a0 + 147 <= 0) && (((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 38461 <= a4 + a29) && !(4 == a2)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 340371 <= a29) && !(4 == a2))))) || (0 <= a0 + 385464 && ((((280404 <= a29 && a4 + 42 <= 0) && a0 + 149 <= 0) || (((a4 + 42 <= 0 && 0 <= a0 + 384412) && a0 + 149 <= 0) && 220362 <= a29)) || (((((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && a0 + 149 <= 0) && 0 <= a0 + 384412) && a29 <= 42) && 4 == a2) && 0 <= a29 + 142)))) || (((((0 <= a0 + 599998 && a0 <= 599970) && a4 + 42 <= 0) && 0 < a29 + 16) && 1 == a2) && a29 <= 43)) || ((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 <= a0 + 384412) && a0 + 147 <= 0) && a29 + 144 <= 0) && 3 == a2) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input)))) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 43) && 0 < a0 + 147) && 4 <= a2) && 0 <= a29 + 142)) || ((a4 + 86 <= 0 && !(4 == a2)) && a0 + 61 <= 0)) || (((((0 <= a0 + 599998 && a4 + 42 <= 0) && a0 + 149 <= 0) && a29 + 16 <= 0) && 3 == a2) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input)))) || ((((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && a29 + 16 <= 0) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input))) && 3 == a2) && 0 <= a29 + 142)) || ((((a4 + 42 <= 0 && 0 < a29 + 16) && ((a4 + 86 <= 0 && 0 < a0 + 147) || 0 <= a0 + 44)) && a29 <= 42) && 4 == a2)) || (((((((0 < a29 + 16 || 0 < a4 + 86) && 0 <= a0 + 384412) && a2 <= 2) && a0 + 147 <= 0) || (((0 <= a0 + 599998 && (0 < a29 + 16 || 0 < a4 + 86)) && a0 + 149 <= 0) && a2 <= 2)) && 43 < a29) && (\exists v_~a0~0_828 : int :: ((0 <= 10 * (v_~a0~0_828 / 5) + 3459790 && 0 <= v_~a0~0_828) && v_~a0~0_828 <= 599970) && (v_~a0~0_828 / 5 * 10 + 3459790) / -9 <= a0))) || (((a4 + 86 <= 0 && (0 < a29 + 16 || 0 < a4 + 86)) && !(6 == input)) && 2 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 43 <= a29) && 0 < a0 + 147) && 2 == a2)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 599999)) || ((0 <= a0 + 385464 && 0 < a29 + 16) && (((((0 < a29 + 16 || 0 < a4 + 86) && 0 <= a0 + 384412) && a2 <= 2) && a0 + 147 <= 0) || (((0 <= a0 + 599998 && (0 < a29 + 16 || 0 < a4 + 86)) && a0 + 149 <= 0) && a2 <= 2)))) || (((a0 <= 599970 && a4 + 86 <= 0) && 0 < a29 + 16) && 3 == a2)) || ((((((0 <= a0 + 599998 && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 <= a29 + 599999) && a29 + 144 <= 0) && 3 == a2) && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(4 == input)))) || ((((a0 <= 599970 && a4 + 86 <= 0) && 0 <= a29 + 599999) && a29 + 144 <= 0) && a2 <= 3)) || (((((((0 < a29 + 16 || 0 < a4 + 86) && a4 + 42 <= 0) && 0 <= a0 + 384412) && a0 + 149 <= 0) && 0 <= a29 + 599999) && a29 + 144 <= 0) && 4 == a2)) || (((((a4 + 42 <= 0 && 1 == a2) && 0 < a0 + 147) && a29 + 16 <= 0) && a0 + 61 <= 0) && 0 <= a29 + 142)) || ((((0 <= a0 + 599998 && a0 + 98 <= 0) && 0 < a29 + 16) && a29 <= 43) && 2 == a2)) || (((0 <= a0 + 599998 && a0 + 98 <= 0) && 340371 <= a29) && 2 == a2)) || ((((((a4 + 42 <= 0 && 0 <= a0 + 384412) && a0 + 147 <= 0) && a29 <= 43) && 4 <= a2) && !(4 == a2)) && 0 <= a29 + 142)) || ((((a4 + 86 <= 0 && 0 < a29 + 16) && a29 <= 43) && 4 <= a2) && !(4 == a2)) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 154.2s, OverallIterations: 22, TraceHistogramMax: 12, AutomataDifference: 104.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 31.5s, HoareTripleCheckerStatistics: 4116 SDtfs, 27499 SDslu, 2443 SDs, 0 SdLazy, 105280 SolverSat, 6156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 82.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11492 GetRequests, 11254 SyntacticMatches, 36 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24286occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 51739 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 361 NumberOfFragments, 3705 HoareAnnotationTreeSize, 4 FomulaSimplifications, 1577048 FormulaSimplificationTreeSizeReduction, 3.3s HoareSimplificationTime, 4 FomulaSimplificationsInter, 453437 FormulaSimplificationTreeSizeReductionInter, 28.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 18.1s InterpolantComputationTime, 31495 NumberOfCodeBlocks, 31495 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 31461 ConstructedInterpolants, 499 QuantifiedInterpolants, 144827245 SizeOfPredicates, 12 NumberOfNonLiveVariables, 12971 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 34 InterpolantComputations, 16 PerfectInterpolantSequences, 66642/76098 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...