./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label19.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/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 edeea1f74999e0c407ee107c2e6c77e98295c642 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 21:53:37,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:53:37,216 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:53:37,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:53:37,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:53:37,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:53:37,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:53:37,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:53:37,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:53:37,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:53:37,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:53:37,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:53:37,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:53:37,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:53:37,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:53:37,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:53:37,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:53:37,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:53:37,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:53:37,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:53:37,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:53:37,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:53:37,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:53:37,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:53:37,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:53:37,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:53:37,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:53:37,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:53:37,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:53:37,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:53:37,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:53:37,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:53:37,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:53:37,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:53:37,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:53:37,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:53:37,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:53:37,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:53:37,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:53:37,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:53:37,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:53:37,269 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:53:37,287 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:53:37,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:53:37,289 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:53:37,289 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:53:37,289 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:53:37,289 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:53:37,290 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:53:37,290 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:53:37,290 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:53:37,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:53:37,291 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:53:37,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:53:37,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:53:37,292 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:53:37,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:53:37,292 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:53:37,292 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:53:37,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:53:37,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:53:37,293 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:53:37,294 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:53:37,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:53:37,294 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:53:37,294 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:53:37,295 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:53:37,295 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:53:37,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:53:37,295 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:53:37,295 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_e61d26fd-ecce-468c-af01-36b8172aa427/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 -> edeea1f74999e0c407ee107c2e6c77e98295c642 [2019-11-19 21:53:37,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:53:37,459 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:53:37,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:53:37,464 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:53:37,464 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:53:37,465 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label19.c [2019-11-19 21:53:37,537 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/data/0444dc910/8b3270417e4b4e68814eac40bebcef2f/FLAG55667c000 [2019-11-19 21:53:38,085 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:53:38,086 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/sv-benchmarks/c/eca-rers2012/Problem15_label19.c [2019-11-19 21:53:38,106 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/data/0444dc910/8b3270417e4b4e68814eac40bebcef2f/FLAG55667c000 [2019-11-19 21:53:38,264 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/data/0444dc910/8b3270417e4b4e68814eac40bebcef2f [2019-11-19 21:53:38,267 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:53:38,269 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:53:38,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:53:38,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:53:38,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:53:38,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:53:38" (1/1) ... [2019-11-19 21:53:38,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e0d11d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:38, skipping insertion in model container [2019-11-19 21:53:38,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:53:38" (1/1) ... [2019-11-19 21:53:38,286 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:53:38,359 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:53:39,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:53:39,311 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:53:39,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:53:39,767 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:53:39,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:39 WrapperNode [2019-11-19 21:53:39,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:53:39,769 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:53:39,769 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:53:39,769 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:53:39,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:39" (1/1) ... [2019-11-19 21:53:39,823 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:39" (1/1) ... [2019-11-19 21:53:39,982 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:53:39,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:53:39,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:53:39,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:53:39,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:39" (1/1) ... [2019-11-19 21:53:39,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:39" (1/1) ... [2019-11-19 21:53:40,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:39" (1/1) ... [2019-11-19 21:53:40,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:39" (1/1) ... [2019-11-19 21:53:40,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:39" (1/1) ... [2019-11-19 21:53:40,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:39" (1/1) ... [2019-11-19 21:53:40,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:39" (1/1) ... [2019-11-19 21:53:40,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:53:40,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:53:40,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:53:40,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:53:40,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:53:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:53:40,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:53:43,203 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:53:43,203 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-19 21:53:43,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:53:43 BoogieIcfgContainer [2019-11-19 21:53:43,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:53:43,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:53:43,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:53:43,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:53:43,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:53:38" (1/3) ... [2019-11-19 21:53:43,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c17b5db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:53:43, skipping insertion in model container [2019-11-19 21:53:43,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:53:39" (2/3) ... [2019-11-19 21:53:43,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c17b5db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:53:43, skipping insertion in model container [2019-11-19 21:53:43,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:53:43" (3/3) ... [2019-11-19 21:53:43,214 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label19.c [2019-11-19 21:53:43,223 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:53:43,233 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:53:43,243 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:53:43,277 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:53:43,278 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:53:43,278 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:53:43,278 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:53:43,278 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:53:43,278 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:53:43,278 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:53:43,279 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:53:43,309 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-19 21:53:43,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-19 21:53:43,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:53:43,318 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] [2019-11-19 21:53:43,319 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:53:43,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:53:43,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2068820151, now seen corresponding path program 1 times [2019-11-19 21:53:43,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:53:43,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398020583] [2019-11-19 21:53:43,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:53:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:53:43,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:53:43,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398020583] [2019-11-19 21:53:43,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:53:43,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:53:43,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479291296] [2019-11-19 21:53:43,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:53:43,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:53:43,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:53:43,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:53:43,684 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-19 21:53:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:53:47,612 INFO L93 Difference]: Finished difference Result 1514 states and 2790 transitions. [2019-11-19 21:53:47,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:53:47,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-19 21:53:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:53:47,642 INFO L225 Difference]: With dead ends: 1514 [2019-11-19 21:53:47,642 INFO L226 Difference]: Without dead ends: 1008 [2019-11-19 21:53:47,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:53:47,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-11-19 21:53:47,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 677. [2019-11-19 21:53:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-19 21:53:47,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1164 transitions. [2019-11-19 21:53:47,759 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1164 transitions. Word has length 45 [2019-11-19 21:53:47,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:53:47,759 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 1164 transitions. [2019-11-19 21:53:47,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:53:47,760 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1164 transitions. [2019-11-19 21:53:47,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-19 21:53:47,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:53:47,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:53:47,768 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:53:47,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:53:47,769 INFO L82 PathProgramCache]: Analyzing trace with hash 416619247, now seen corresponding path program 1 times [2019-11-19 21:53:47,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:53:47,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294005405] [2019-11-19 21:53:47,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:53:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:53:48,045 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:53:48,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294005405] [2019-11-19 21:53:48,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:53:48,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:53:48,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558786036] [2019-11-19 21:53:48,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:53:48,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:53:48,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:53:48,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:53:48,050 INFO L87 Difference]: Start difference. First operand 677 states and 1164 transitions. Second operand 5 states. [2019-11-19 21:53:53,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:53:53,447 INFO L93 Difference]: Finished difference Result 2303 states and 3981 transitions. [2019-11-19 21:53:53,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:53:53,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-11-19 21:53:53,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:53:53,458 INFO L225 Difference]: With dead ends: 2303 [2019-11-19 21:53:53,458 INFO L226 Difference]: Without dead ends: 1628 [2019-11-19 21:53:53,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:53:53,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2019-11-19 21:53:53,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 989. [2019-11-19 21:53:53,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-11-19 21:53:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1597 transitions. [2019-11-19 21:53:53,499 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1597 transitions. Word has length 110 [2019-11-19 21:53:53,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:53:53,501 INFO L462 AbstractCegarLoop]: Abstraction has 989 states and 1597 transitions. [2019-11-19 21:53:53,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:53:53,502 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1597 transitions. [2019-11-19 21:53:53,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-19 21:53:53,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:53:53,509 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:53:53,509 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:53:53,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:53:53,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1808654100, now seen corresponding path program 1 times [2019-11-19 21:53:53,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:53:53,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144248217] [2019-11-19 21:53:53,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:53:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:53:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:53:53,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144248217] [2019-11-19 21:53:53,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:53:53,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:53:53,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474816127] [2019-11-19 21:53:53,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:53:53,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:53:53,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:53:53,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:53:53,626 INFO L87 Difference]: Start difference. First operand 989 states and 1597 transitions. Second operand 4 states. [2019-11-19 21:53:56,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:53:56,359 INFO L93 Difference]: Finished difference Result 3777 states and 6149 transitions. [2019-11-19 21:53:56,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:53:56,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-19 21:53:56,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:53:56,375 INFO L225 Difference]: With dead ends: 3777 [2019-11-19 21:53:56,376 INFO L226 Difference]: Without dead ends: 2790 [2019-11-19 21:53:56,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:53:56,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2019-11-19 21:53:56,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 1886. [2019-11-19 21:53:56,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2019-11-19 21:53:56,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2633 transitions. [2019-11-19 21:53:56,423 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2633 transitions. Word has length 111 [2019-11-19 21:53:56,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:53:56,425 INFO L462 AbstractCegarLoop]: Abstraction has 1886 states and 2633 transitions. [2019-11-19 21:53:56,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:53:56,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2633 transitions. [2019-11-19 21:53:56,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-19 21:53:56,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:53:56,438 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:53:56,439 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:53:56,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:53:56,439 INFO L82 PathProgramCache]: Analyzing trace with hash 399406558, now seen corresponding path program 1 times [2019-11-19 21:53:56,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:53:56,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203062873] [2019-11-19 21:53:56,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:53:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:53:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:53:56,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203062873] [2019-11-19 21:53:56,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:53:56,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:53:56,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465289020] [2019-11-19 21:53:56,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:53:56,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:53:56,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:53:56,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:53:56,570 INFO L87 Difference]: Start difference. First operand 1886 states and 2633 transitions. Second operand 4 states. [2019-11-19 21:54:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:54:00,448 INFO L93 Difference]: Finished difference Result 7368 states and 10298 transitions. [2019-11-19 21:54:00,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:54:00,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-19 21:54:00,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:54:00,484 INFO L225 Difference]: With dead ends: 7368 [2019-11-19 21:54:00,484 INFO L226 Difference]: Without dead ends: 5484 [2019-11-19 21:54:00,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:54:00,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5484 states. [2019-11-19 21:54:00,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5484 to 5180. [2019-11-19 21:54:00,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5180 states. [2019-11-19 21:54:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 6692 transitions. [2019-11-19 21:54:00,601 INFO L78 Accepts]: Start accepts. Automaton has 5180 states and 6692 transitions. Word has length 115 [2019-11-19 21:54:00,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:54:00,602 INFO L462 AbstractCegarLoop]: Abstraction has 5180 states and 6692 transitions. [2019-11-19 21:54:00,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:54:00,602 INFO L276 IsEmpty]: Start isEmpty. Operand 5180 states and 6692 transitions. [2019-11-19 21:54:00,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-19 21:54:00,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:54:00,603 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:54:00,604 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:54:00,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:54:00,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1837727490, now seen corresponding path program 1 times [2019-11-19 21:54:00,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:54:00,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154218541] [2019-11-19 21:54:00,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:54:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:54:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:54:00,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154218541] [2019-11-19 21:54:00,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:54:00,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:54:00,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566961567] [2019-11-19 21:54:00,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:54:00,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:54:00,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:54:00,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:54:00,746 INFO L87 Difference]: Start difference. First operand 5180 states and 6692 transitions. Second operand 3 states. [2019-11-19 21:54:02,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:54:02,802 INFO L93 Difference]: Finished difference Result 14842 states and 19263 transitions. [2019-11-19 21:54:02,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:54:02,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-11-19 21:54:02,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:54:02,834 INFO L225 Difference]: With dead ends: 14842 [2019-11-19 21:54:02,834 INFO L226 Difference]: Without dead ends: 7571 [2019-11-19 21:54:02,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:54:02,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2019-11-19 21:54:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7571. [2019-11-19 21:54:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7571 states. [2019-11-19 21:54:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7571 states to 7571 states and 8705 transitions. [2019-11-19 21:54:02,972 INFO L78 Accepts]: Start accepts. Automaton has 7571 states and 8705 transitions. Word has length 136 [2019-11-19 21:54:02,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:54:02,973 INFO L462 AbstractCegarLoop]: Abstraction has 7571 states and 8705 transitions. [2019-11-19 21:54:02,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:54:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 7571 states and 8705 transitions. [2019-11-19 21:54:02,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-11-19 21:54:02,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:54:02,976 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:54:02,976 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:54:02,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:54:02,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1954499346, now seen corresponding path program 1 times [2019-11-19 21:54:02,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:54:02,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569866710] [2019-11-19 21:54:02,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:54:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:54:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:54:03,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569866710] [2019-11-19 21:54:03,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:54:03,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:54:03,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308016963] [2019-11-19 21:54:03,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:54:03,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:54:03,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:54:03,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:54:03,272 INFO L87 Difference]: Start difference. First operand 7571 states and 8705 transitions. Second operand 5 states. [2019-11-19 21:54:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:54:06,305 INFO L93 Difference]: Finished difference Result 22038 states and 25652 transitions. [2019-11-19 21:54:06,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:54:06,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 278 [2019-11-19 21:54:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:54:06,359 INFO L225 Difference]: With dead ends: 22038 [2019-11-19 21:54:06,359 INFO L226 Difference]: Without dead ends: 13871 [2019-11-19 21:54:06,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:54:06,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13871 states. [2019-11-19 21:54:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13871 to 10566. [2019-11-19 21:54:06,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10566 states. [2019-11-19 21:54:06,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10566 states to 10566 states and 12187 transitions. [2019-11-19 21:54:06,546 INFO L78 Accepts]: Start accepts. Automaton has 10566 states and 12187 transitions. Word has length 278 [2019-11-19 21:54:06,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:54:06,548 INFO L462 AbstractCegarLoop]: Abstraction has 10566 states and 12187 transitions. [2019-11-19 21:54:06,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:54:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 10566 states and 12187 transitions. [2019-11-19 21:54:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-11-19 21:54:06,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:54:06,553 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:54:06,553 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:54:06,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:54:06,553 INFO L82 PathProgramCache]: Analyzing trace with hash 81761830, now seen corresponding path program 1 times [2019-11-19 21:54:06,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:54:06,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170302206] [2019-11-19 21:54:06,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:54:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:54:07,383 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:54:07,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170302206] [2019-11-19 21:54:07,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449777421] [2019-11-19 21:54:07,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:54:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:54:07,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 21:54:07,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:54:07,749 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-19 21:54:07,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 21:54:07,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2019-11-19 21:54:07,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265294125] [2019-11-19 21:54:07,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:54:07,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:54:07,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:54:07,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:54:07,753 INFO L87 Difference]: Start difference. First operand 10566 states and 12187 transitions. Second operand 3 states. [2019-11-19 21:54:09,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:54:09,581 INFO L93 Difference]: Finished difference Result 23529 states and 26930 transitions. [2019-11-19 21:54:09,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:54:09,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-11-19 21:54:09,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:54:09,610 INFO L225 Difference]: With dead ends: 23529 [2019-11-19 21:54:09,610 INFO L226 Difference]: Without dead ends: 12965 [2019-11-19 21:54:09,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 315 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:54:09,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12965 states. [2019-11-19 21:54:09,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12965 to 12663. [2019-11-19 21:54:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12663 states. [2019-11-19 21:54:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12663 states to 12663 states and 14296 transitions. [2019-11-19 21:54:09,960 INFO L78 Accepts]: Start accepts. Automaton has 12663 states and 14296 transitions. Word has length 315 [2019-11-19 21:54:09,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:54:09,962 INFO L462 AbstractCegarLoop]: Abstraction has 12663 states and 14296 transitions. [2019-11-19 21:54:09,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:54:09,962 INFO L276 IsEmpty]: Start isEmpty. Operand 12663 states and 14296 transitions. [2019-11-19 21:54:09,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-11-19 21:54:09,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:54:09,970 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 21:54:10,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:54:10,182 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:54:10,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:54:10,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1938559075, now seen corresponding path program 1 times [2019-11-19 21:54:10,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:54:10,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797974575] [2019-11-19 21:54:10,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:54:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:54:10,759 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-19 21:54:10,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797974575] [2019-11-19 21:54:10,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:54:10,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:54:10,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250523772] [2019-11-19 21:54:10,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:54:10,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:54:10,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:54:10,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:54:10,762 INFO L87 Difference]: Start difference. First operand 12663 states and 14296 transitions. Second operand 5 states. [2019-11-19 21:54:12,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:54:12,877 INFO L93 Difference]: Finished difference Result 25924 states and 29231 transitions. [2019-11-19 21:54:12,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:54:12,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 363 [2019-11-19 21:54:12,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:54:12,900 INFO L225 Difference]: With dead ends: 25924 [2019-11-19 21:54:12,900 INFO L226 Difference]: Without dead ends: 13562 [2019-11-19 21:54:12,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:54:12,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13562 states. [2019-11-19 21:54:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13562 to 13560. [2019-11-19 21:54:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13560 states. [2019-11-19 21:54:13,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13560 states to 13560 states and 15200 transitions. [2019-11-19 21:54:13,225 INFO L78 Accepts]: Start accepts. Automaton has 13560 states and 15200 transitions. Word has length 363 [2019-11-19 21:54:13,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:54:13,226 INFO L462 AbstractCegarLoop]: Abstraction has 13560 states and 15200 transitions. [2019-11-19 21:54:13,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:54:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 13560 states and 15200 transitions. [2019-11-19 21:54:13,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-11-19 21:54:13,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:54:13,234 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:54:13,235 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:54:13,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:54:13,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1680735344, now seen corresponding path program 1 times [2019-11-19 21:54:13,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:54:13,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551334852] [2019-11-19 21:54:13,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:54:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:54:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-19 21:54:13,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551334852] [2019-11-19 21:54:13,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:54:13,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:54:13,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061563424] [2019-11-19 21:54:13,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:54:13,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:54:13,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:54:13,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:54:13,513 INFO L87 Difference]: Start difference. First operand 13560 states and 15200 transitions. Second operand 4 states. [2019-11-19 21:54:15,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:54:15,478 INFO L93 Difference]: Finished difference Result 26824 states and 30109 transitions. [2019-11-19 21:54:15,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:54:15,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 422 [2019-11-19 21:54:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:54:15,504 INFO L225 Difference]: With dead ends: 26824 [2019-11-19 21:54:15,504 INFO L226 Difference]: Without dead ends: 13565 [2019-11-19 21:54:15,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:54:15,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13565 states. [2019-11-19 21:54:15,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13565 to 9965. [2019-11-19 21:54:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9965 states. [2019-11-19 21:54:15,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9965 states to 9965 states and 10838 transitions. [2019-11-19 21:54:15,658 INFO L78 Accepts]: Start accepts. Automaton has 9965 states and 10838 transitions. Word has length 422 [2019-11-19 21:54:15,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:54:15,659 INFO L462 AbstractCegarLoop]: Abstraction has 9965 states and 10838 transitions. [2019-11-19 21:54:15,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:54:15,659 INFO L276 IsEmpty]: Start isEmpty. Operand 9965 states and 10838 transitions. [2019-11-19 21:54:15,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2019-11-19 21:54:15,666 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:54:15,666 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:54:15,667 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:54:15,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:54:15,667 INFO L82 PathProgramCache]: Analyzing trace with hash 81446721, now seen corresponding path program 1 times [2019-11-19 21:54:15,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:54:15,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434500661] [2019-11-19 21:54:15,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:54:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:54:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 285 proven. 70 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-19 21:54:17,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434500661] [2019-11-19 21:54:17,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625501739] [2019-11-19 21:54:17,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:54:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:54:17,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 21:54:17,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:54:17,641 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-11-19 21:54:17,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 21:54:17,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-19 21:54:17,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55384909] [2019-11-19 21:54:17,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:54:17,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:54:17,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:54:17,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:54:17,645 INFO L87 Difference]: Start difference. First operand 9965 states and 10838 transitions. Second operand 3 states. [2019-11-19 21:54:19,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:54:19,684 INFO L93 Difference]: Finished difference Result 22618 states and 24825 transitions. [2019-11-19 21:54:19,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:54:19,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 506 [2019-11-19 21:54:19,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:54:19,710 INFO L225 Difference]: With dead ends: 22618 [2019-11-19 21:54:19,711 INFO L226 Difference]: Without dead ends: 12655 [2019-11-19 21:54:19,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 506 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:54:19,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12655 states. [2019-11-19 21:54:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12655 to 10861. [2019-11-19 21:54:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10861 states. [2019-11-19 21:54:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11939 transitions. [2019-11-19 21:54:19,862 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11939 transitions. Word has length 506 [2019-11-19 21:54:19,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:54:19,863 INFO L462 AbstractCegarLoop]: Abstraction has 10861 states and 11939 transitions. [2019-11-19 21:54:19,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:54:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11939 transitions. [2019-11-19 21:54:19,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2019-11-19 21:54:19,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:54:19,874 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:54:20,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:54:20,078 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:54:20,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:54:20,079 INFO L82 PathProgramCache]: Analyzing trace with hash -459851816, now seen corresponding path program 1 times [2019-11-19 21:54:20,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:54:20,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673236878] [2019-11-19 21:54:20,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:54:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:54:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-19 21:54:20,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673236878] [2019-11-19 21:54:20,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:54:20,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:54:20,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398318428] [2019-11-19 21:54:20,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:54:20,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:54:20,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:54:20,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:54:20,551 INFO L87 Difference]: Start difference. First operand 10861 states and 11939 transitions. Second operand 4 states. [2019-11-19 21:54:23,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:54:23,127 INFO L93 Difference]: Finished difference Result 28299 states and 31302 transitions. [2019-11-19 21:54:23,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:54:23,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 551 [2019-11-19 21:54:23,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:54:23,164 INFO L225 Difference]: With dead ends: 28299 [2019-11-19 21:54:23,164 INFO L226 Difference]: Without dead ends: 17440 [2019-11-19 21:54:23,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:54:23,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17440 states. [2019-11-19 21:54:23,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17440 to 17141. [2019-11-19 21:54:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17141 states. [2019-11-19 21:54:23,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17141 states to 17141 states and 18393 transitions. [2019-11-19 21:54:23,371 INFO L78 Accepts]: Start accepts. Automaton has 17141 states and 18393 transitions. Word has length 551 [2019-11-19 21:54:23,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:54:23,372 INFO L462 AbstractCegarLoop]: Abstraction has 17141 states and 18393 transitions. [2019-11-19 21:54:23,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:54:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 17141 states and 18393 transitions. [2019-11-19 21:54:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2019-11-19 21:54:23,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:54:23,391 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, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 21:54:23,392 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:54:23,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:54:23,393 INFO L82 PathProgramCache]: Analyzing trace with hash -225226931, now seen corresponding path program 1 times [2019-11-19 21:54:23,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:54:23,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374049000] [2019-11-19 21:54:23,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:54:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:54:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 523 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-19 21:54:23,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374049000] [2019-11-19 21:54:23,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:54:23,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:54:23,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992031362] [2019-11-19 21:54:23,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:54:23,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:54:23,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:54:23,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:54:23,893 INFO L87 Difference]: Start difference. First operand 17141 states and 18393 transitions. Second operand 4 states. [2019-11-19 21:54:26,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:54:26,578 INFO L93 Difference]: Finished difference Result 34283 states and 36790 transitions. [2019-11-19 21:54:26,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:54:26,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 609 [2019-11-19 21:54:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:54:26,597 INFO L225 Difference]: With dead ends: 34283 [2019-11-19 21:54:26,598 INFO L226 Difference]: Without dead ends: 17144 [2019-11-19 21:54:26,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:54:26,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17144 states. [2019-11-19 21:54:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17144 to 16241. [2019-11-19 21:54:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16241 states. [2019-11-19 21:54:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16241 states to 16241 states and 17255 transitions. [2019-11-19 21:54:26,808 INFO L78 Accepts]: Start accepts. Automaton has 16241 states and 17255 transitions. Word has length 609 [2019-11-19 21:54:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:54:26,809 INFO L462 AbstractCegarLoop]: Abstraction has 16241 states and 17255 transitions. [2019-11-19 21:54:26,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:54:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 16241 states and 17255 transitions. [2019-11-19 21:54:26,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2019-11-19 21:54:26,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:54:26,822 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:54:26,822 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:54:26,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:54:26,822 INFO L82 PathProgramCache]: Analyzing trace with hash 335196122, now seen corresponding path program 1 times [2019-11-19 21:54:26,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:54:26,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638389868] [2019-11-19 21:54:26,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:54:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:54:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 516 proven. 173 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-19 21:54:28,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638389868] [2019-11-19 21:54:28,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010499949] [2019-11-19 21:54:28,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:54:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:54:28,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 21:54:28,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:54:28,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:54:28,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:28,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:28,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:28,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:28,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:28,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:29,306 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 602 proven. 87 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-19 21:54:29,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:54:29,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-11-19 21:54:29,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418907247] [2019-11-19 21:54:29,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 21:54:29,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:54:29,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 21:54:29,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:54:29,309 INFO L87 Difference]: Start difference. First operand 16241 states and 17255 transitions. Second operand 9 states. [2019-11-19 21:54:46,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:54:46,170 INFO L93 Difference]: Finished difference Result 53460 states and 56374 transitions. [2019-11-19 21:54:46,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-19 21:54:46,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 661 [2019-11-19 21:54:46,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:54:46,208 INFO L225 Difference]: With dead ends: 53460 [2019-11-19 21:54:46,208 INFO L226 Difference]: Without dead ends: 36623 [2019-11-19 21:54:46,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 680 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2019-11-19 21:54:46,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36623 states. [2019-11-19 21:54:46,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36623 to 22230. [2019-11-19 21:54:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22230 states. [2019-11-19 21:54:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22230 states to 22230 states and 23279 transitions. [2019-11-19 21:54:46,548 INFO L78 Accepts]: Start accepts. Automaton has 22230 states and 23279 transitions. Word has length 661 [2019-11-19 21:54:46,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:54:46,550 INFO L462 AbstractCegarLoop]: Abstraction has 22230 states and 23279 transitions. [2019-11-19 21:54:46,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 21:54:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 22230 states and 23279 transitions. [2019-11-19 21:54:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-11-19 21:54:46,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:54:46,565 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:54:46,777 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:54:46,777 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:54:46,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:54:46,777 INFO L82 PathProgramCache]: Analyzing trace with hash 378264636, now seen corresponding path program 1 times [2019-11-19 21:54:46,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:54:46,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945390921] [2019-11-19 21:54:46,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:54:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:54:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 107 proven. 500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:54:49,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945390921] [2019-11-19 21:54:49,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438214917] [2019-11-19 21:54:49,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:54:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:54:49,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 21:54:49,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:54:49,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:49,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:49,942 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2019-11-19 21:54:49,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 21:54:49,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2019-11-19 21:54:49,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944599472] [2019-11-19 21:54:49,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:54:49,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:54:49,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:54:49,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-19 21:54:49,944 INFO L87 Difference]: Start difference. First operand 22230 states and 23279 transitions. Second operand 3 states. [2019-11-19 21:54:52,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:54:52,952 INFO L93 Difference]: Finished difference Result 26418 states and 27562 transitions. [2019-11-19 21:54:52,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:54:52,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 689 [2019-11-19 21:54:52,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:54:52,972 INFO L225 Difference]: With dead ends: 26418 [2019-11-19 21:54:52,972 INFO L226 Difference]: Without dead ends: 26416 [2019-11-19 21:54:52,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 688 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-19 21:54:52,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26416 states. [2019-11-19 21:54:53,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26416 to 22529. [2019-11-19 21:54:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22529 states. [2019-11-19 21:54:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22529 states to 22529 states and 23580 transitions. [2019-11-19 21:54:53,188 INFO L78 Accepts]: Start accepts. Automaton has 22529 states and 23580 transitions. Word has length 689 [2019-11-19 21:54:53,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:54:53,190 INFO L462 AbstractCegarLoop]: Abstraction has 22529 states and 23580 transitions. [2019-11-19 21:54:53,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:54:53,190 INFO L276 IsEmpty]: Start isEmpty. Operand 22529 states and 23580 transitions. [2019-11-19 21:54:53,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2019-11-19 21:54:53,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:54:53,209 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-19 21:54:53,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:54:53,419 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:54:53,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:54:53,420 INFO L82 PathProgramCache]: Analyzing trace with hash 151347988, now seen corresponding path program 1 times [2019-11-19 21:54:53,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:54:53,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158269023] [2019-11-19 21:54:53,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:54:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:54:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 572 proven. 106 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-11-19 21:54:54,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158269023] [2019-11-19 21:54:54,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691213318] [2019-11-19 21:54:54,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:54:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:54:54,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 21:54:54,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:54:54,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:54,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:55,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:54:57,254 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_~a0~0_826 Int)) (let ((.cse1 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse0 (div .cse1 5))) (and (= (mod (+ .cse0 4) 5) 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse0 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse0 (- 278887)) 5)) (= 0 (mod .cse1 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse3 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse2 (div .cse3 5))) (and (<= 278886 .cse2) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse2 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse2 (- 278887)) 5)) (<= 0 .cse3))))) (exists ((v_~a0~0_826 Int)) (let ((.cse5 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse4 (div .cse5 5))) (and (< .cse4 278886) (not (= (mod (+ .cse4 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse4 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse4 (- 278887)) 5)) (<= 0 .cse5))))) (exists ((v_~a0~0_826 Int)) (let ((.cse7 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse6 (div .cse7 5))) (and (<= 278887 .cse6) (< .cse6 278886) (not (= (mod (+ .cse6 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse6 (- 278887)) 5)) (<= 0 .cse7))))) (exists ((v_~a0~0_826 Int)) (let ((.cse9 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse8 (div .cse9 5))) (and (<= 278886 .cse8) (<= 278887 .cse8) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse8 (- 278887)) 5)) (= 0 (mod .cse9 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse11 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse10 (div .cse11 5))) (and (<= 278886 .cse10) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse10 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse10 (- 278887)) 5)) (= 0 (mod .cse11 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse13 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse12 (div .cse13 5))) (and (<= 278886 .cse12) (not (= 0 (mod .cse13 5))) (not (= 0 (mod (+ .cse12 3) 5))) (< .cse13 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (< .cse12 278887) (<= c_~a0~0 (div (+ .cse12 (- 278886)) 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse15 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse14 (div .cse15 5))) (and (<= 278887 .cse14) (< .cse14 278886) (not (= (mod (+ .cse14 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse14 (- 278887)) 5)) (= 0 (mod .cse15 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse17 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse16 (div .cse17 5))) (and (not (= 0 (mod (+ .cse16 3) 5))) (< .cse16 278886) (not (= (mod (+ .cse16 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse16 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (= 0 (mod .cse17 5)) (< .cse16 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse19 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse18 (div .cse19 5))) (and (<= 278887 .cse18) (= (mod (+ .cse18 4) 5) 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse18 (- 278887)) 5)) (<= 0 .cse19))))) (exists ((v_~a0~0_826 Int)) (let ((.cse21 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse20 (div .cse21 5))) (and (<= 278886 .cse20) (<= 278887 .cse20) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse20 (- 278887)) 5)) (<= 0 .cse21))))) (exists ((v_~a0~0_826 Int)) (let ((.cse22 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse23 (div .cse22 5))) (and (not (= 0 (mod .cse22 5))) (< .cse23 278886) (not (= (mod (+ .cse23 4) 5) 0)) (< .cse22 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse23 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (+ (div (+ .cse23 (- 278886)) 5) 1)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse25 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse24 (div .cse25 5))) (and (< .cse24 278886) (not (= (mod (+ .cse24 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse24 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse24 (- 278887)) 5)) (= 0 (mod .cse25 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse26 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse27 (div .cse26 5))) (and (not (= 0 (mod .cse26 5))) (not (= 0 (mod (+ .cse27 3) 5))) (< .cse27 278886) (not (= (mod (+ .cse27 4) 5) 0)) (< .cse26 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (+ (div (+ .cse27 (- 278886)) 5) 1)) (< .cse27 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse29 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse28 (div .cse29 5))) (and (<= 278886 .cse28) (not (= 0 (mod .cse29 5))) (< .cse29 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse28 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse28 (- 278886)) 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse31 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse30 (div .cse31 5))) (and (= (mod (+ .cse30 4) 5) 0) (not (= 0 (mod (+ .cse30 3) 5))) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse30 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= 0 .cse31) (< .cse30 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse33 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse32 (div .cse33 5))) (and (<= 278887 .cse32) (not (= 0 (mod .cse33 5))) (= (mod (+ .cse32 4) 5) 0) (< .cse33 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse32 (- 278886)) 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse35 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse34 (div .cse35 5))) (and (<= 278886 .cse34) (<= 278887 .cse34) (not (= 0 (mod .cse35 5))) (< .cse35 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse34 (- 278886)) 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse37 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse36 (div .cse37 5))) (and (not (= 0 (mod (+ .cse36 3) 5))) (< .cse36 278886) (not (= (mod (+ .cse36 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse36 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= 0 .cse37) (< .cse36 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse39 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse38 (div .cse39 5))) (and (<= 278886 .cse38) (not (= 0 (mod (+ .cse38 3) 5))) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse38 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (= 0 (mod .cse39 5)) (< .cse38 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse41 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse40 (div .cse41 5))) (and (= (mod (+ .cse40 4) 5) 0) (not (= 0 (mod (+ .cse40 3) 5))) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse40 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (= 0 (mod .cse41 5)) (< .cse40 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse43 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse42 (div .cse43 5))) (and (<= 278887 .cse42) (= (mod (+ .cse42 4) 5) 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse42 (- 278887)) 5)) (= 0 (mod .cse43 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse45 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse44 (div .cse45 5))) (and (<= 278887 .cse44) (not (= 0 (mod .cse45 5))) (< .cse44 278886) (not (= (mod (+ .cse44 4) 5) 0)) (< .cse45 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (+ (div (+ .cse44 (- 278886)) 5) 1)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse47 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse46 (div .cse47 5))) (and (<= 278886 .cse46) (not (= 0 (mod (+ .cse46 3) 5))) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse46 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= 0 .cse47) (< .cse46 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse49 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse48 (div .cse49 5))) (and (= (mod (+ .cse48 4) 5) 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse48 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse48 (- 278887)) 5)) (<= 0 .cse49))))) (exists ((v_~a0~0_826 Int)) (let ((.cse50 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse51 (div .cse50 5))) (and (not (= 0 (mod .cse50 5))) (= (mod (+ .cse51 4) 5) 0) (not (= 0 (mod (+ .cse51 3) 5))) (< .cse50 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (< .cse51 278887) (<= c_~a0~0 (div (+ .cse51 (- 278886)) 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse52 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse53 (div .cse52 5))) (and (not (= 0 (mod .cse52 5))) (= (mod (+ .cse53 4) 5) 0) (< .cse52 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse53 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse53 (- 278886)) 5))))))) is different from false [2019-11-19 21:54:59,332 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_~a0~0_826 Int)) (let ((.cse1 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse0 (div .cse1 5))) (and (= (mod (+ .cse0 4) 5) 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse0 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse0 (- 278887)) 5)) (= 0 (mod .cse1 5)))))) (exists ((v_prenex_18 Int)) (let ((.cse3 (div (* v_prenex_18 (- 250)) 9))) (let ((.cse2 (div .cse3 5))) (and (< 0 (+ v_prenex_18 147)) (<= c_~a0~0 (+ (div (+ .cse2 (- 278887)) 5) 1)) (< .cse2 278887) (<= (* 250 v_prenex_18) 0) (not (= 0 (mod (+ .cse2 3) 5))) (not (= (mod (+ .cse2 4) 5) 0)) (<= 0 .cse3) (< .cse2 278886) (<= (+ v_prenex_18 98) 0))))) (exists ((v_prenex_8 Int)) (let ((.cse5 (div (* v_prenex_8 (- 250)) 9))) (let ((.cse4 (div .cse5 5))) (and (<= (* 250 v_prenex_8) 0) (< .cse4 278887) (= 0 (mod .cse5 5)) (< .cse4 278886) (not (= (mod (+ .cse4 4) 5) 0)) (<= (+ v_prenex_8 98) 0) (not (= 0 (mod (+ .cse4 3) 5))) (< 0 (+ v_prenex_8 147)) (<= c_~a0~0 (+ (div (+ .cse4 (- 278887)) 5) 1)))))) (exists ((v_prenex_11 Int)) (let ((.cse6 (div (* v_prenex_11 (- 250)) 9))) (let ((.cse7 (div .cse6 5))) (and (not (= 0 (mod .cse6 5))) (not (= (mod (+ .cse7 4) 5) 0)) (< 0 (+ v_prenex_11 147)) (<= (* 250 v_prenex_11) 0) (<= c_~a0~0 (+ (div (+ .cse7 (- 278886)) 5) 1)) (< .cse6 0) (< .cse7 278886) (<= (+ v_prenex_11 98) 0) (= 0 (mod (+ .cse7 3) 5)))))) (exists ((v_prenex_4 Int)) (let ((.cse9 (div (* v_prenex_4 (- 250)) 9))) (let ((.cse8 (div .cse9 5))) (and (<= c_~a0~0 (div (+ .cse8 (- 278887)) 5)) (< 0 (+ v_prenex_4 147)) (<= (+ v_prenex_4 98) 0) (<= 278886 .cse8) (= 0 (mod .cse9 5)) (<= 278887 .cse8) (<= (* 250 v_prenex_4) 0))))) (exists ((v_prenex_13 Int)) (let ((.cse11 (div (* v_prenex_13 (- 250)) 9))) (let ((.cse10 (div .cse11 5))) (and (< .cse10 278886) (<= c_~a0~0 (+ (div (+ .cse10 (- 278886)) 5) 1)) (<= (+ v_prenex_13 98) 0) (< 0 (+ v_prenex_13 147)) (< .cse10 278887) (not (= 0 (mod .cse11 5))) (not (= 0 (mod (+ .cse10 3) 5))) (<= (* 250 v_prenex_13) 0) (not (= (mod (+ .cse10 4) 5) 0)) (< .cse11 0))))) (exists ((v_prenex_23 Int)) (let ((.cse13 (div (* v_prenex_23 (- 250)) 9))) (let ((.cse12 (div .cse13 5))) (and (<= 278886 .cse12) (<= (* 250 v_prenex_23) 0) (not (= 0 (mod (+ .cse12 3) 5))) (<= (+ v_prenex_23 98) 0) (<= c_~a0~0 (+ (div (+ .cse12 (- 278887)) 5) 1)) (< 0 (+ v_prenex_23 147)) (< .cse12 278887) (<= 0 .cse13))))) (exists ((v_prenex_20 Int)) (let ((.cse15 (div (* v_prenex_20 (- 250)) 9))) (let ((.cse14 (div .cse15 5))) (and (<= (+ v_prenex_20 98) 0) (= (mod (+ .cse14 4) 5) 0) (< .cse14 278887) (< 0 (+ v_prenex_20 147)) (not (= 0 (mod (+ .cse14 3) 5))) (<= c_~a0~0 (+ (div (+ .cse14 (- 278887)) 5) 1)) (<= (* 250 v_prenex_20) 0) (= 0 (mod .cse15 5)))))) (exists ((v_prenex_19 Int)) (let ((.cse17 (div (* v_prenex_19 (- 250)) 9))) (let ((.cse16 (div .cse17 5))) (and (not (= 0 (mod (+ .cse16 3) 5))) (<= 278886 .cse16) (<= (+ v_prenex_19 98) 0) (<= c_~a0~0 (+ (div (+ .cse16 (- 278887)) 5) 1)) (< .cse16 278887) (= 0 (mod .cse17 5)) (<= (* 250 v_prenex_19) 0) (< 0 (+ v_prenex_19 147)))))) (exists ((v_prenex_25 Int)) (let ((.cse18 (div (* v_prenex_25 (- 250)) 9))) (let ((.cse19 (div .cse18 5))) (and (<= (+ v_prenex_25 98) 0) (not (= 0 (mod .cse18 5))) (<= c_~a0~0 (div (+ .cse19 (- 278886)) 5)) (< 0 (+ v_prenex_25 147)) (< .cse18 0) (< .cse19 278887) (not (= 0 (mod (+ .cse19 3) 5))) (= (mod (+ .cse19 4) 5) 0) (<= (* 250 v_prenex_25) 0))))) (exists ((v_prenex_3 Int)) (let ((.cse21 (div (* v_prenex_3 (- 250)) 9))) (let ((.cse20 (div .cse21 5))) (and (< .cse20 278886) (not (= (mod (+ .cse20 4) 5) 0)) (<= (* 250 v_prenex_3) 0) (<= 0 .cse21) (<= (+ v_prenex_3 98) 0) (<= 278887 .cse20) (< 0 (+ v_prenex_3 147)) (<= c_~a0~0 (div (+ .cse20 (- 278887)) 5)))))) (exists ((v_prenex_2 Int)) (let ((.cse23 (div (* v_prenex_2 (- 250)) 9))) (let ((.cse22 (div .cse23 5))) (and (< 0 (+ v_prenex_2 147)) (<= (+ v_prenex_2 98) 0) (<= (* 250 v_prenex_2) 0) (not (= (mod (+ .cse22 4) 5) 0)) (= 0 (mod (+ .cse22 3) 5)) (<= c_~a0~0 (div (+ .cse22 (- 278887)) 5)) (<= 0 .cse23) (< .cse22 278886))))) (exists ((v_prenex_22 Int)) (let ((.cse25 (div (* v_prenex_22 (- 250)) 9))) (let ((.cse24 (div .cse25 5))) (and (not (= (mod (+ .cse24 4) 5) 0)) (<= (* 250 v_prenex_22) 0) (< .cse25 0) (< .cse24 278886) (< 0 (+ v_prenex_22 147)) (<= 278887 .cse24) (<= (+ v_prenex_22 98) 0) (<= c_~a0~0 (+ (div (+ .cse24 (- 278886)) 5) 1)) (not (= 0 (mod .cse25 5))))))) (exists ((v_prenex_21 Int)) (let ((.cse26 (div (* v_prenex_21 (- 250)) 9))) (let ((.cse27 (div .cse26 5))) (and (<= (+ v_prenex_21 98) 0) (< 0 (+ v_prenex_21 147)) (= 0 (mod .cse26 5)) (<= c_~a0~0 (div (+ .cse27 (- 278887)) 5)) (= (mod (+ .cse27 4) 5) 0) (<= (* 250 v_prenex_21) 0) (<= 278887 .cse27))))) (exists ((v_prenex_26 Int)) (let ((.cse29 (div (* v_prenex_26 (- 250)) 9))) (let ((.cse28 (div .cse29 5))) (and (= 0 (mod (+ .cse28 3) 5)) (< 0 (+ v_prenex_26 147)) (not (= 0 (mod .cse29 5))) (= (mod (+ .cse28 4) 5) 0) (<= (+ v_prenex_26 98) 0) (< .cse29 0) (<= c_~a0~0 (div (+ .cse28 (- 278886)) 5)) (<= (* 250 v_prenex_26) 0))))) (exists ((v_prenex_10 Int)) (let ((.cse31 (div (* v_prenex_10 (- 250)) 9))) (let ((.cse30 (div .cse31 5))) (and (<= 278886 .cse30) (<= (* 250 v_prenex_10) 0) (<= 0 .cse31) (<= (+ v_prenex_10 98) 0) (< 0 (+ v_prenex_10 147)) (<= c_~a0~0 (div (+ .cse30 (- 278887)) 5)) (<= 278887 .cse30))))) (exists ((v_prenex_5 Int)) (let ((.cse33 (div (* v_prenex_5 (- 250)) 9))) (let ((.cse32 (div .cse33 5))) (and (<= 278886 .cse32) (= 0 (mod .cse33 5)) (<= (+ v_prenex_5 98) 0) (= 0 (mod (+ .cse32 3) 5)) (<= (* 250 v_prenex_5) 0) (< 0 (+ v_prenex_5 147)) (<= c_~a0~0 (div (+ .cse32 (- 278887)) 5)))))) (exists ((v_prenex_24 Int)) (let ((.cse34 (div (* v_prenex_24 (- 250)) 9))) (let ((.cse35 (div .cse34 5))) (and (<= 0 .cse34) (< 0 (+ v_prenex_24 147)) (<= c_~a0~0 (div (+ .cse35 (- 278887)) 5)) (= (mod (+ .cse35 4) 5) 0) (<= (+ v_prenex_24 98) 0) (<= (* 250 v_prenex_24) 0) (= 0 (mod (+ .cse35 3) 5)))))) (exists ((v_prenex_12 Int)) (let ((.cse37 (div (* v_prenex_12 (- 250)) 9))) (let ((.cse36 (div .cse37 5))) (and (<= (* 250 v_prenex_12) 0) (<= c_~a0~0 (div (+ .cse36 (- 278887)) 5)) (= 0 (mod .cse37 5)) (< 0 (+ v_prenex_12 147)) (< .cse36 278886) (= 0 (mod (+ .cse36 3) 5)) (not (= (mod (+ .cse36 4) 5) 0)) (<= (+ v_prenex_12 98) 0))))) (exists ((v_prenex_1 Int)) (let ((.cse39 (div (* v_prenex_1 (- 250)) 9))) (let ((.cse38 (div .cse39 5))) (and (<= (* 250 v_prenex_1) 0) (<= (+ v_prenex_1 98) 0) (< 0 (+ v_prenex_1 147)) (= 0 (mod (+ .cse38 3) 5)) (<= 278886 .cse38) (<= c_~a0~0 (div (+ .cse38 (- 278887)) 5)) (<= 0 .cse39))))) (exists ((v_prenex_17 Int)) (let ((.cse40 (div (* v_prenex_17 (- 250)) 9))) (let ((.cse41 (div .cse40 5))) (and (<= (+ v_prenex_17 98) 0) (< 0 (+ v_prenex_17 147)) (not (= 0 (mod .cse40 5))) (<= 278886 .cse41) (<= 278887 .cse41) (< .cse40 0) (<= c_~a0~0 (div (+ .cse41 (- 278886)) 5)) (<= (* 250 v_prenex_17) 0))))) (exists ((v_prenex_14 Int)) (let ((.cse43 (div (* v_prenex_14 (- 250)) 9))) (let ((.cse42 (div .cse43 5))) (and (<= 278886 .cse42) (not (= 0 (mod .cse43 5))) (<= (+ v_prenex_14 98) 0) (<= c_~a0~0 (div (+ .cse42 (- 278886)) 5)) (< 0 (+ v_prenex_14 147)) (<= (* 250 v_prenex_14) 0) (< .cse43 0) (= 0 (mod (+ .cse42 3) 5)))))) (exists ((v_prenex_15 Int)) (let ((.cse45 (div (* v_prenex_15 (- 250)) 9))) (let ((.cse44 (div .cse45 5))) (and (< .cse44 278887) (not (= 0 (mod (+ .cse44 3) 5))) (< 0 (+ v_prenex_15 147)) (<= 0 .cse45) (= (mod (+ .cse44 4) 5) 0) (<= c_~a0~0 (+ (div (+ .cse44 (- 278887)) 5) 1)) (<= (* 250 v_prenex_15) 0) (<= (+ v_prenex_15 98) 0))))) (exists ((v_prenex_9 Int)) (let ((.cse47 (div (* v_prenex_9 (- 250)) 9))) (let ((.cse46 (div .cse47 5))) (and (<= 278887 .cse46) (<= (+ v_prenex_9 98) 0) (<= c_~a0~0 (div (+ .cse46 (- 278887)) 5)) (<= (* 250 v_prenex_9) 0) (<= 0 .cse47) (= (mod (+ .cse46 4) 5) 0) (< 0 (+ v_prenex_9 147)))))) (exists ((v_prenex_6 Int)) (let ((.cse49 (div (* v_prenex_6 (- 250)) 9))) (let ((.cse48 (div .cse49 5))) (and (< 0 (+ v_prenex_6 147)) (<= (+ v_prenex_6 98) 0) (<= 278886 .cse48) (not (= 0 (mod (+ .cse48 3) 5))) (<= c_~a0~0 (div (+ .cse48 (- 278886)) 5)) (< .cse48 278887) (< .cse49 0) (<= (* 250 v_prenex_6) 0) (not (= 0 (mod .cse49 5))))))) (exists ((v_prenex_16 Int)) (let ((.cse51 (div (* v_prenex_16 (- 250)) 9))) (let ((.cse50 (div .cse51 5))) (and (< 0 (+ v_prenex_16 147)) (<= 278887 .cse50) (not (= 0 (mod .cse51 5))) (<= c_~a0~0 (div (+ .cse50 (- 278886)) 5)) (<= (+ v_prenex_16 98) 0) (<= (* 250 v_prenex_16) 0) (< .cse51 0) (= (mod (+ .cse50 4) 5) 0))))) (exists ((v_prenex_7 Int)) (let ((.cse53 (div (* v_prenex_7 (- 250)) 9))) (let ((.cse52 (div .cse53 5))) (and (<= (* 250 v_prenex_7) 0) (<= (+ v_prenex_7 98) 0) (<= c_~a0~0 (div (+ .cse52 (- 278887)) 5)) (not (= (mod (+ .cse52 4) 5) 0)) (= 0 (mod .cse53 5)) (< 0 (+ v_prenex_7 147)) (< .cse52 278886) (<= 278887 .cse52)))))) is different from false [2019-11-19 21:55:09,227 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 509 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 43 not checked. [2019-11-19 21:55:09,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:55:09,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2019-11-19 21:55:09,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272440630] [2019-11-19 21:55:09,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 21:55:09,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:55:09,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 21:55:09,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=80, Unknown=2, NotChecked=38, Total=156 [2019-11-19 21:55:09,230 INFO L87 Difference]: Start difference. First operand 22529 states and 23580 transitions. Second operand 13 states. [2019-11-19 21:55:15,845 WARN L838 $PredicateComparison]: unable to prove that (and (or (exists ((v_~a0~0_826 Int)) (let ((.cse1 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse0 (div .cse1 5))) (and (= (mod (+ .cse0 4) 5) 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse0 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse0 (- 278887)) 5)) (= 0 (mod .cse1 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse3 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse2 (div .cse3 5))) (and (<= 278886 .cse2) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse2 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse2 (- 278887)) 5)) (<= 0 .cse3))))) (exists ((v_~a0~0_826 Int)) (let ((.cse5 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse4 (div .cse5 5))) (and (< .cse4 278886) (not (= (mod (+ .cse4 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse4 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse4 (- 278887)) 5)) (<= 0 .cse5))))) (exists ((v_~a0~0_826 Int)) (let ((.cse7 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse6 (div .cse7 5))) (and (<= 278887 .cse6) (< .cse6 278886) (not (= (mod (+ .cse6 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse6 (- 278887)) 5)) (<= 0 .cse7))))) (exists ((v_~a0~0_826 Int)) (let ((.cse9 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse8 (div .cse9 5))) (and (<= 278886 .cse8) (<= 278887 .cse8) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse8 (- 278887)) 5)) (= 0 (mod .cse9 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse11 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse10 (div .cse11 5))) (and (<= 278886 .cse10) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse10 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse10 (- 278887)) 5)) (= 0 (mod .cse11 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse13 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse12 (div .cse13 5))) (and (<= 278886 .cse12) (not (= 0 (mod .cse13 5))) (not (= 0 (mod (+ .cse12 3) 5))) (< .cse13 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (< .cse12 278887) (<= c_~a0~0 (div (+ .cse12 (- 278886)) 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse15 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse14 (div .cse15 5))) (and (<= 278887 .cse14) (< .cse14 278886) (not (= (mod (+ .cse14 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse14 (- 278887)) 5)) (= 0 (mod .cse15 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse17 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse16 (div .cse17 5))) (and (not (= 0 (mod (+ .cse16 3) 5))) (< .cse16 278886) (not (= (mod (+ .cse16 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse16 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (= 0 (mod .cse17 5)) (< .cse16 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse19 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse18 (div .cse19 5))) (and (<= 278887 .cse18) (= (mod (+ .cse18 4) 5) 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse18 (- 278887)) 5)) (<= 0 .cse19))))) (exists ((v_~a0~0_826 Int)) (let ((.cse21 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse20 (div .cse21 5))) (and (<= 278886 .cse20) (<= 278887 .cse20) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse20 (- 278887)) 5)) (<= 0 .cse21))))) (exists ((v_~a0~0_826 Int)) (let ((.cse22 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse23 (div .cse22 5))) (and (not (= 0 (mod .cse22 5))) (< .cse23 278886) (not (= (mod (+ .cse23 4) 5) 0)) (< .cse22 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse23 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (+ (div (+ .cse23 (- 278886)) 5) 1)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse25 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse24 (div .cse25 5))) (and (< .cse24 278886) (not (= (mod (+ .cse24 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse24 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse24 (- 278887)) 5)) (= 0 (mod .cse25 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse26 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse27 (div .cse26 5))) (and (not (= 0 (mod .cse26 5))) (not (= 0 (mod (+ .cse27 3) 5))) (< .cse27 278886) (not (= (mod (+ .cse27 4) 5) 0)) (< .cse26 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (+ (div (+ .cse27 (- 278886)) 5) 1)) (< .cse27 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse29 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse28 (div .cse29 5))) (and (<= 278886 .cse28) (not (= 0 (mod .cse29 5))) (< .cse29 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse28 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse28 (- 278886)) 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse31 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse30 (div .cse31 5))) (and (= (mod (+ .cse30 4) 5) 0) (not (= 0 (mod (+ .cse30 3) 5))) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse30 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= 0 .cse31) (< .cse30 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse33 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse32 (div .cse33 5))) (and (<= 278887 .cse32) (not (= 0 (mod .cse33 5))) (= (mod (+ .cse32 4) 5) 0) (< .cse33 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse32 (- 278886)) 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse35 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse34 (div .cse35 5))) (and (<= 278886 .cse34) (<= 278887 .cse34) (not (= 0 (mod .cse35 5))) (< .cse35 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse34 (- 278886)) 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse37 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse36 (div .cse37 5))) (and (not (= 0 (mod (+ .cse36 3) 5))) (< .cse36 278886) (not (= (mod (+ .cse36 4) 5) 0)) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse36 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= 0 .cse37) (< .cse36 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse39 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse38 (div .cse39 5))) (and (<= 278886 .cse38) (not (= 0 (mod (+ .cse38 3) 5))) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse38 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (= 0 (mod .cse39 5)) (< .cse38 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse41 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse40 (div .cse41 5))) (and (= (mod (+ .cse40 4) 5) 0) (not (= 0 (mod (+ .cse40 3) 5))) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse40 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (= 0 (mod .cse41 5)) (< .cse40 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse43 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse42 (div .cse43 5))) (and (<= 278887 .cse42) (= (mod (+ .cse42 4) 5) 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse42 (- 278887)) 5)) (= 0 (mod .cse43 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse45 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse44 (div .cse45 5))) (and (<= 278887 .cse44) (not (= 0 (mod .cse45 5))) (< .cse44 278886) (not (= (mod (+ .cse44 4) 5) 0)) (< .cse45 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (+ (div (+ .cse44 (- 278886)) 5) 1)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse47 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse46 (div .cse47 5))) (and (<= 278886 .cse46) (not (= 0 (mod (+ .cse46 3) 5))) (< 0 (+ v_~a0~0_826 147)) (<= c_~a0~0 (+ (div (+ .cse46 (- 278887)) 5) 1)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= 0 .cse47) (< .cse46 278887))))) (exists ((v_~a0~0_826 Int)) (let ((.cse49 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse48 (div .cse49 5))) (and (= (mod (+ .cse48 4) 5) 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse48 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse48 (- 278887)) 5)) (<= 0 .cse49))))) (exists ((v_~a0~0_826 Int)) (let ((.cse50 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse51 (div .cse50 5))) (and (not (= 0 (mod .cse50 5))) (= (mod (+ .cse51 4) 5) 0) (not (= 0 (mod (+ .cse51 3) 5))) (< .cse50 0) (< 0 (+ v_~a0~0_826 147)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (< .cse51 278887) (<= c_~a0~0 (div (+ .cse51 (- 278886)) 5)))))) (exists ((v_~a0~0_826 Int)) (let ((.cse52 (div (* v_~a0~0_826 (- 250)) 9))) (let ((.cse53 (div .cse52 5))) (and (not (= 0 (mod .cse52 5))) (= (mod (+ .cse53 4) 5) 0) (< .cse52 0) (< 0 (+ v_~a0~0_826 147)) (= 0 (mod (+ .cse53 3) 5)) (<= (* 250 v_~a0~0_826) 0) (<= (+ v_~a0~0_826 98) 0) (<= c_~a0~0 (div (+ .cse53 (- 278886)) 5))))))) (<= (+ c_~a29~0 144) 0) (not (= 3 c_~a2~0))) is different from false [2019-11-19 21:55:20,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:55:20,367 INFO L93 Difference]: Finished difference Result 55478 states and 57915 transitions. [2019-11-19 21:55:20,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 21:55:20,368 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 697 [2019-11-19 21:55:20,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:55:20,394 INFO L225 Difference]: With dead ends: 55478 [2019-11-19 21:55:20,394 INFO L226 Difference]: Without dead ends: 32951 [2019-11-19 21:55:20,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 697 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=53, Invalid=138, Unknown=3, NotChecked=78, Total=272 [2019-11-19 21:55:20,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32951 states. [2019-11-19 21:55:20,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32951 to 24411. [2019-11-19 21:55:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24411 states. [2019-11-19 21:55:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24411 states to 24411 states and 25533 transitions. [2019-11-19 21:55:20,704 INFO L78 Accepts]: Start accepts. Automaton has 24411 states and 25533 transitions. Word has length 697 [2019-11-19 21:55:20,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:55:20,705 INFO L462 AbstractCegarLoop]: Abstraction has 24411 states and 25533 transitions. [2019-11-19 21:55:20,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 21:55:20,705 INFO L276 IsEmpty]: Start isEmpty. Operand 24411 states and 25533 transitions. [2019-11-19 21:55:20,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 719 [2019-11-19 21:55:20,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:55:20,720 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 21:55:20,923 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:55:20,924 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:55:20,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:55:20,924 INFO L82 PathProgramCache]: Analyzing trace with hash -717755273, now seen corresponding path program 1 times [2019-11-19 21:55:20,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:55:20,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059400926] [2019-11-19 21:55:20,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:55:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:55:21,598 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-11-19 21:55:21,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059400926] [2019-11-19 21:55:21,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:55:21,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:55:21,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128545505] [2019-11-19 21:55:21,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:55:21,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:55:21,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:55:21,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:55:21,600 INFO L87 Difference]: Start difference. First operand 24411 states and 25533 transitions. Second operand 3 states. [2019-11-19 21:55:22,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:55:22,913 INFO L93 Difference]: Finished difference Result 49117 states and 51367 transitions. [2019-11-19 21:55:22,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:55:22,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 718 [2019-11-19 21:55:22,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:55:22,932 INFO L225 Difference]: With dead ends: 49117 [2019-11-19 21:55:22,932 INFO L226 Difference]: Without dead ends: 24708 [2019-11-19 21:55:22,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:55:22,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24708 states. [2019-11-19 21:55:23,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24708 to 24409. [2019-11-19 21:55:23,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24409 states. [2019-11-19 21:55:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24409 states to 24409 states and 25529 transitions. [2019-11-19 21:55:23,163 INFO L78 Accepts]: Start accepts. Automaton has 24409 states and 25529 transitions. Word has length 718 [2019-11-19 21:55:23,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:55:23,164 INFO L462 AbstractCegarLoop]: Abstraction has 24409 states and 25529 transitions. [2019-11-19 21:55:23,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:55:23,164 INFO L276 IsEmpty]: Start isEmpty. Operand 24409 states and 25529 transitions. [2019-11-19 21:55:23,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2019-11-19 21:55:23,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:55:23,186 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:55:23,186 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:55:23,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:55:23,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1690318276, now seen corresponding path program 1 times [2019-11-19 21:55:23,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:55:23,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851140209] [2019-11-19 21:55:23,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:55:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:55:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 597 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-11-19 21:55:23,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851140209] [2019-11-19 21:55:23,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:55:23,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:55:23,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860184845] [2019-11-19 21:55:23,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:55:23,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:55:23,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:55:23,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:55:23,917 INFO L87 Difference]: Start difference. First operand 24409 states and 25529 transitions. Second operand 5 states. [2019-11-19 21:55:26,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:55:26,230 INFO L93 Difference]: Finished difference Result 54506 states and 56872 transitions. [2019-11-19 21:55:26,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:55:26,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 842 [2019-11-19 21:55:26,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:55:26,274 INFO L225 Difference]: With dead ends: 54506 [2019-11-19 21:55:26,274 INFO L226 Difference]: Without dead ends: 29497 [2019-11-19 21:55:26,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:55:26,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29497 states. [2019-11-19 21:55:26,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29497 to 22610. [2019-11-19 21:55:26,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22610 states. [2019-11-19 21:55:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22610 states to 22610 states and 23415 transitions. [2019-11-19 21:55:26,512 INFO L78 Accepts]: Start accepts. Automaton has 22610 states and 23415 transitions. Word has length 842 [2019-11-19 21:55:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:55:26,512 INFO L462 AbstractCegarLoop]: Abstraction has 22610 states and 23415 transitions. [2019-11-19 21:55:26,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:55:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 22610 states and 23415 transitions. [2019-11-19 21:55:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2019-11-19 21:55:26,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:55:26,529 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 21:55:26,530 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:55:26,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:55:26,530 INFO L82 PathProgramCache]: Analyzing trace with hash 591902161, now seen corresponding path program 1 times [2019-11-19 21:55:26,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:55:26,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264374394] [2019-11-19 21:55:26,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:55:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:55:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2019-11-19 21:55:27,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264374394] [2019-11-19 21:55:27,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:55:27,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:55:27,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762512051] [2019-11-19 21:55:27,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:55:27,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:55:27,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:55:27,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:55:27,209 INFO L87 Difference]: Start difference. First operand 22610 states and 23415 transitions. Second operand 3 states. [2019-11-19 21:55:28,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:55:28,608 INFO L93 Difference]: Finished difference Result 47309 states and 48970 transitions. [2019-11-19 21:55:28,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:55:28,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 845 [2019-11-19 21:55:28,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:55:28,623 INFO L225 Difference]: With dead ends: 47309 [2019-11-19 21:55:28,623 INFO L226 Difference]: Without dead ends: 20802 [2019-11-19 21:55:28,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:55:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20802 states. [2019-11-19 21:55:28,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20802 to 20204. [2019-11-19 21:55:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20204 states. [2019-11-19 21:55:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20204 states to 20204 states and 20786 transitions. [2019-11-19 21:55:28,795 INFO L78 Accepts]: Start accepts. Automaton has 20204 states and 20786 transitions. Word has length 845 [2019-11-19 21:55:28,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:55:28,796 INFO L462 AbstractCegarLoop]: Abstraction has 20204 states and 20786 transitions. [2019-11-19 21:55:28,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:55:28,796 INFO L276 IsEmpty]: Start isEmpty. Operand 20204 states and 20786 transitions. [2019-11-19 21:55:28,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2019-11-19 21:55:28,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:55:28,809 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 21:55:28,810 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:55:28,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:55:28,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1103935205, now seen corresponding path program 1 times [2019-11-19 21:55:28,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:55:28,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735420076] [2019-11-19 21:55:28,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:55:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:55:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-11-19 21:55:29,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735420076] [2019-11-19 21:55:29,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:55:29,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:55:29,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053680347] [2019-11-19 21:55:29,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:55:29,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:55:29,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:55:29,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:55:29,436 INFO L87 Difference]: Start difference. First operand 20204 states and 20786 transitions. Second operand 3 states. [2019-11-19 21:55:30,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:55:30,527 INFO L93 Difference]: Finished difference Result 41298 states and 42530 transitions. [2019-11-19 21:55:30,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:55:30,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 847 [2019-11-19 21:55:30,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:55:30,541 INFO L225 Difference]: With dead ends: 41298 [2019-11-19 21:55:30,542 INFO L226 Difference]: Without dead ends: 22892 [2019-11-19 21:55:30,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:55:30,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22892 states. [2019-11-19 21:55:30,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22892 to 21696. [2019-11-19 21:55:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21696 states. [2019-11-19 21:55:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21696 states to 21696 states and 22272 transitions. [2019-11-19 21:55:30,738 INFO L78 Accepts]: Start accepts. Automaton has 21696 states and 22272 transitions. Word has length 847 [2019-11-19 21:55:30,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:55:30,738 INFO L462 AbstractCegarLoop]: Abstraction has 21696 states and 22272 transitions. [2019-11-19 21:55:30,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:55:30,738 INFO L276 IsEmpty]: Start isEmpty. Operand 21696 states and 22272 transitions. [2019-11-19 21:55:30,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 862 [2019-11-19 21:55:30,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:55:30,746 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 21:55:30,747 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:55:30,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:55:30,747 INFO L82 PathProgramCache]: Analyzing trace with hash 76724679, now seen corresponding path program 1 times [2019-11-19 21:55:30,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:55:30,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653044641] [2019-11-19 21:55:30,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:55:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:55:32,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 1000 proven. 0 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-11-19 21:55:32,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653044641] [2019-11-19 21:55:32,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:55:32,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:55:32,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166077649] [2019-11-19 21:55:32,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:55:32,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:55:32,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:55:32,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:55:32,078 INFO L87 Difference]: Start difference. First operand 21696 states and 22272 transitions. Second operand 5 states. [2019-11-19 21:55:33,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:55:33,809 INFO L93 Difference]: Finished difference Result 44014 states and 45186 transitions. [2019-11-19 21:55:33,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:55:33,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 861 [2019-11-19 21:55:33,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:55:33,825 INFO L225 Difference]: With dead ends: 44014 [2019-11-19 21:55:33,825 INFO L226 Difference]: Without dead ends: 22918 [2019-11-19 21:55:33,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:55:33,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22918 states. [2019-11-19 21:55:34,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22918 to 21696. [2019-11-19 21:55:34,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21696 states. [2019-11-19 21:55:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21696 states to 21696 states and 22250 transitions. [2019-11-19 21:55:34,033 INFO L78 Accepts]: Start accepts. Automaton has 21696 states and 22250 transitions. Word has length 861 [2019-11-19 21:55:34,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:55:34,034 INFO L462 AbstractCegarLoop]: Abstraction has 21696 states and 22250 transitions. [2019-11-19 21:55:34,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:55:34,034 INFO L276 IsEmpty]: Start isEmpty. Operand 21696 states and 22250 transitions. [2019-11-19 21:55:34,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2019-11-19 21:55:34,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:55:34,044 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 21:55:34,044 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:55:34,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:55:34,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1531465597, now seen corresponding path program 1 times [2019-11-19 21:55:34,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:55:34,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044855943] [2019-11-19 21:55:34,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:55:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:55:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 908 trivial. 0 not checked. [2019-11-19 21:55:34,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044855943] [2019-11-19 21:55:34,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:55:34,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:55:34,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472079674] [2019-11-19 21:55:34,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:55:34,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:55:34,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:55:34,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:55:34,655 INFO L87 Difference]: Start difference. First operand 21696 states and 22250 transitions. Second operand 3 states. [2019-11-19 21:55:35,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:55:35,684 INFO L93 Difference]: Finished difference Result 43686 states and 44833 transitions. [2019-11-19 21:55:35,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:55:35,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 868 [2019-11-19 21:55:35,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:55:35,701 INFO L225 Difference]: With dead ends: 43686 [2019-11-19 21:55:35,701 INFO L226 Difference]: Without dead ends: 23489 [2019-11-19 21:55:35,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:55:35,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23489 states. [2019-11-19 21:55:35,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23489 to 21394. [2019-11-19 21:55:35,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21394 states. [2019-11-19 21:55:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21394 states to 21394 states and 21903 transitions. [2019-11-19 21:55:35,923 INFO L78 Accepts]: Start accepts. Automaton has 21394 states and 21903 transitions. Word has length 868 [2019-11-19 21:55:35,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:55:35,923 INFO L462 AbstractCegarLoop]: Abstraction has 21394 states and 21903 transitions. [2019-11-19 21:55:35,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:55:35,924 INFO L276 IsEmpty]: Start isEmpty. Operand 21394 states and 21903 transitions. [2019-11-19 21:55:36,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2019-11-19 21:55:36,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:55:36,025 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:55:36,025 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:55:36,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:55:36,026 INFO L82 PathProgramCache]: Analyzing trace with hash -154291092, now seen corresponding path program 1 times [2019-11-19 21:55:36,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:55:36,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665598439] [2019-11-19 21:55:36,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:55:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:55:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 989 proven. 286 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-11-19 21:55:37,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665598439] [2019-11-19 21:55:37,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614636694] [2019-11-19 21:55:37,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:55:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:55:38,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 21:55:38,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:55:38,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:55:38,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:38,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:38,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:38,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:38,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:38,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:38,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 21:55:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1436 backedges. 1203 proven. 2 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-11-19 21:55:39,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:55:39,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-11-19 21:55:39,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858586245] [2019-11-19 21:55:39,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 21:55:39,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:55:39,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 21:55:39,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-19 21:55:39,478 INFO L87 Difference]: Start difference. First operand 21394 states and 21903 transitions. Second operand 16 states. [2019-11-19 21:55:47,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:55:47,480 INFO L93 Difference]: Finished difference Result 41538 states and 42493 transitions. [2019-11-19 21:55:47,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-19 21:55:47,481 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 887 [2019-11-19 21:55:47,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:55:47,497 INFO L225 Difference]: With dead ends: 41538 [2019-11-19 21:55:47,497 INFO L226 Difference]: Without dead ends: 21942 [2019-11-19 21:55:47,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 905 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=379, Invalid=1261, Unknown=0, NotChecked=0, Total=1640 [2019-11-19 21:55:47,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21942 states. [2019-11-19 21:55:47,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21942 to 18688. [2019-11-19 21:55:47,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18688 states. [2019-11-19 21:55:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18688 states to 18688 states and 19098 transitions. [2019-11-19 21:55:47,691 INFO L78 Accepts]: Start accepts. Automaton has 18688 states and 19098 transitions. Word has length 887 [2019-11-19 21:55:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:55:47,691 INFO L462 AbstractCegarLoop]: Abstraction has 18688 states and 19098 transitions. [2019-11-19 21:55:47,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 21:55:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 18688 states and 19098 transitions. [2019-11-19 21:55:47,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2019-11-19 21:55:47,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:55:47,700 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 21:55:47,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:55:47,901 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:55:47,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:55:47,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1903949696, now seen corresponding path program 1 times [2019-11-19 21:55:47,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:55:47,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566626050] [2019-11-19 21:55:47,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:55:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:55:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 996 proven. 198 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-11-19 21:55:49,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566626050] [2019-11-19 21:55:49,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5029553] [2019-11-19 21:55:49,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:55:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:55:49,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 21:55:49,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:55:49,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:49,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:49,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:49,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:49,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:49,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:49,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:49,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:50,837 WARN L191 SmtUtils]: Spent 802.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 23 [2019-11-19 21:55:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 722 proven. 0 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2019-11-19 21:55:51,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 21:55:51,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-11-19 21:55:51,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377389712] [2019-11-19 21:55:51,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:55:51,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:55:51,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:55:51,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:55:51,405 INFO L87 Difference]: Start difference. First operand 18688 states and 19098 transitions. Second operand 4 states. [2019-11-19 21:55:53,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:55:53,775 INFO L93 Difference]: Finished difference Result 41873 states and 42813 transitions. [2019-11-19 21:55:53,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:55:53,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 893 [2019-11-19 21:55:53,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:55:53,794 INFO L225 Difference]: With dead ends: 41873 [2019-11-19 21:55:53,794 INFO L226 Difference]: Without dead ends: 24598 [2019-11-19 21:55:53,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 907 GetRequests, 894 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:55:53,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24598 states. [2019-11-19 21:55:53,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24598 to 20101. [2019-11-19 21:55:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20101 states. [2019-11-19 21:55:53,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20101 states to 20101 states and 20528 transitions. [2019-11-19 21:55:53,995 INFO L78 Accepts]: Start accepts. Automaton has 20101 states and 20528 transitions. Word has length 893 [2019-11-19 21:55:53,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:55:53,996 INFO L462 AbstractCegarLoop]: Abstraction has 20101 states and 20528 transitions. [2019-11-19 21:55:53,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:55:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 20101 states and 20528 transitions. [2019-11-19 21:55:54,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2019-11-19 21:55:54,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:55:54,008 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-19 21:55:54,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:55:54,212 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:55:54,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:55:54,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1722502239, now seen corresponding path program 1 times [2019-11-19 21:55:54,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:55:54,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962198536] [2019-11-19 21:55:54,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:55:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:55:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 985 proven. 182 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-11-19 21:55:55,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962198536] [2019-11-19 21:55:55,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004877674] [2019-11-19 21:55:55,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:55:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:55:55,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 21:55:55,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:55:55,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:55,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:55,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:55,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:55,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:55,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:55,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:55,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1544 backedges. 737 proven. 0 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2019-11-19 21:55:55,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 21:55:55,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-11-19 21:55:55,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373188866] [2019-11-19 21:55:55,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:55:55,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:55:55,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:55:55,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:55:55,888 INFO L87 Difference]: Start difference. First operand 20101 states and 20528 transitions. Second operand 4 states. [2019-11-19 21:55:57,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:55:57,601 INFO L93 Difference]: Finished difference Result 44400 states and 45367 transitions. [2019-11-19 21:55:57,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:55:57,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 922 [2019-11-19 21:55:57,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:55:57,620 INFO L225 Difference]: With dead ends: 44400 [2019-11-19 21:55:57,620 INFO L226 Difference]: Without dead ends: 25798 [2019-11-19 21:55:57,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 921 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:55:57,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25798 states. [2019-11-19 21:55:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25798 to 19204. [2019-11-19 21:55:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19204 states. [2019-11-19 21:55:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19204 states to 19204 states and 19616 transitions. [2019-11-19 21:55:57,827 INFO L78 Accepts]: Start accepts. Automaton has 19204 states and 19616 transitions. Word has length 922 [2019-11-19 21:55:57,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:55:57,828 INFO L462 AbstractCegarLoop]: Abstraction has 19204 states and 19616 transitions. [2019-11-19 21:55:57,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:55:57,828 INFO L276 IsEmpty]: Start isEmpty. Operand 19204 states and 19616 transitions. [2019-11-19 21:55:57,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2019-11-19 21:55:57,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:55:57,842 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:55:58,045 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:55:58,046 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:55:58,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:55:58,046 INFO L82 PathProgramCache]: Analyzing trace with hash -175244572, now seen corresponding path program 1 times [2019-11-19 21:55:58,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:55:58,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500765498] [2019-11-19 21:55:58,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:55:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:55:59,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1605 backedges. 978 proven. 144 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-11-19 21:55:59,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500765498] [2019-11-19 21:55:59,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770576473] [2019-11-19 21:55:59,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:55:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:55:59,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 21:55:59,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:55:59,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:59,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:55:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1605 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-11-19 21:55:59,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 21:55:59,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-11-19 21:55:59,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189471673] [2019-11-19 21:55:59,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:55:59,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:55:59,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:55:59,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:55:59,900 INFO L87 Difference]: Start difference. First operand 19204 states and 19616 transitions. Second operand 4 states. [2019-11-19 21:56:01,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:56:01,434 INFO L93 Difference]: Finished difference Result 45297 states and 46295 transitions. [2019-11-19 21:56:01,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:56:01,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1005 [2019-11-19 21:56:01,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:56:01,453 INFO L225 Difference]: With dead ends: 45297 [2019-11-19 21:56:01,453 INFO L226 Difference]: Without dead ends: 27592 [2019-11-19 21:56:01,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1010 GetRequests, 1004 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:56:01,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27592 states. [2019-11-19 21:56:01,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27592 to 21299. [2019-11-19 21:56:01,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21299 states. [2019-11-19 21:56:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21299 states to 21299 states and 21777 transitions. [2019-11-19 21:56:01,657 INFO L78 Accepts]: Start accepts. Automaton has 21299 states and 21777 transitions. Word has length 1005 [2019-11-19 21:56:01,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:56:01,657 INFO L462 AbstractCegarLoop]: Abstraction has 21299 states and 21777 transitions. [2019-11-19 21:56:01,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:56:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 21299 states and 21777 transitions. [2019-11-19 21:56:01,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1044 [2019-11-19 21:56:01,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:56:01,668 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:56:01,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:56:01,869 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:56:01,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:56:01,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1147207921, now seen corresponding path program 1 times [2019-11-19 21:56:01,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:56:01,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129538735] [2019-11-19 21:56:01,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:56:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:56:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1720 backedges. 1093 proven. 343 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-11-19 21:56:04,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129538735] [2019-11-19 21:56:04,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228436541] [2019-11-19 21:56:04,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:56:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:56:04,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 21:56:04,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:56:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1720 backedges. 1158 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2019-11-19 21:56:05,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 21:56:05,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2019-11-19 21:56:05,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118738182] [2019-11-19 21:56:05,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:56:05,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:56:05,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:56:05,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-11-19 21:56:05,623 INFO L87 Difference]: Start difference. First operand 21299 states and 21777 transitions. Second operand 5 states. [2019-11-19 21:56:06,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:56:06,903 INFO L93 Difference]: Finished difference Result 41115 states and 42054 transitions. [2019-11-19 21:56:06,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:56:06,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1043 [2019-11-19 21:56:06,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:56:06,918 INFO L225 Difference]: With dead ends: 41115 [2019-11-19 21:56:06,918 INFO L226 Difference]: Without dead ends: 19513 [2019-11-19 21:56:06,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1058 GetRequests, 1042 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-11-19 21:56:06,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19513 states. [2019-11-19 21:56:07,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19513 to 19495. [2019-11-19 21:56:07,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19495 states. [2019-11-19 21:56:07,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19495 states to 19495 states and 19819 transitions. [2019-11-19 21:56:07,128 INFO L78 Accepts]: Start accepts. Automaton has 19495 states and 19819 transitions. Word has length 1043 [2019-11-19 21:56:07,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:56:07,129 INFO L462 AbstractCegarLoop]: Abstraction has 19495 states and 19819 transitions. [2019-11-19 21:56:07,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:56:07,129 INFO L276 IsEmpty]: Start isEmpty. Operand 19495 states and 19819 transitions. [2019-11-19 21:56:07,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1094 [2019-11-19 21:56:07,146 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:56:07,147 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:56:07,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:56:07,347 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:56:07,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:56:07,348 INFO L82 PathProgramCache]: Analyzing trace with hash -813641473, now seen corresponding path program 1 times [2019-11-19 21:56:07,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:56:07,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067377823] [2019-11-19 21:56:07,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:56:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:56:09,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 1403 proven. 102 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2019-11-19 21:56:09,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067377823] [2019-11-19 21:56:09,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643155817] [2019-11-19 21:56:09,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:56:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:56:09,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 1242 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 21:56:09,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:56:09,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:56:09,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:56:09,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:56:09,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:56:09,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:56:09,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:56:09,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:56:09,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:56:12,069 WARN L191 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 60 DAG size of output: 23 [2019-11-19 21:56:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 748 proven. 0 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2019-11-19 21:56:12,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 21:56:12,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-11-19 21:56:12,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455300638] [2019-11-19 21:56:12,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:56:12,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:56:12,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:56:12,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-19 21:56:12,964 INFO L87 Difference]: Start difference. First operand 19495 states and 19819 transitions. Second operand 4 states. [2019-11-19 21:56:14,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:56:14,891 INFO L93 Difference]: Finished difference Result 40790 states and 41467 transitions. [2019-11-19 21:56:14,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:56:14,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1093 [2019-11-19 21:56:14,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:56:14,906 INFO L225 Difference]: With dead ends: 40790 [2019-11-19 21:56:14,906 INFO L226 Difference]: Without dead ends: 22495 [2019-11-19 21:56:14,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1102 GetRequests, 1092 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-19 21:56:14,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22495 states. [2019-11-19 21:56:15,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22495 to 14404. [2019-11-19 21:56:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14404 states. [2019-11-19 21:56:15,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14404 states to 14404 states and 14621 transitions. [2019-11-19 21:56:15,073 INFO L78 Accepts]: Start accepts. Automaton has 14404 states and 14621 transitions. Word has length 1093 [2019-11-19 21:56:15,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:56:15,073 INFO L462 AbstractCegarLoop]: Abstraction has 14404 states and 14621 transitions. [2019-11-19 21:56:15,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:56:15,074 INFO L276 IsEmpty]: Start isEmpty. Operand 14404 states and 14621 transitions. [2019-11-19 21:56:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1123 [2019-11-19 21:56:15,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:56:15,085 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:56:15,285 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:56:15,285 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:56:15,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:56:15,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1246778028, now seen corresponding path program 1 times [2019-11-19 21:56:15,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:56:15,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525690917] [2019-11-19 21:56:15,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:56:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:56:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1861 backedges. 1080 proven. 628 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-11-19 21:56:17,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525690917] [2019-11-19 21:56:17,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728873065] [2019-11-19 21:56:17,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:56:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:56:17,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 21:56:17,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:56:17,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:56:17,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:56:17,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:56:17,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:56:21,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1861 backedges. 1158 proven. 86 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2019-11-19 21:56:21,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:56:21,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 13 [2019-11-19 21:56:21,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548775298] [2019-11-19 21:56:21,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 21:56:21,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:56:21,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 21:56:21,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-19 21:56:21,393 INFO L87 Difference]: Start difference. First operand 14404 states and 14621 transitions. Second operand 13 states. [2019-11-19 21:56:38,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:56:38,296 INFO L93 Difference]: Finished difference Result 39555 states and 40135 transitions. [2019-11-19 21:56:38,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-19 21:56:38,297 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1122 [2019-11-19 21:56:38,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:56:38,317 INFO L225 Difference]: With dead ends: 39555 [2019-11-19 21:56:38,317 INFO L226 Difference]: Without dead ends: 25448 [2019-11-19 21:56:38,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1208 GetRequests, 1159 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=477, Invalid=1875, Unknown=0, NotChecked=0, Total=2352 [2019-11-19 21:56:38,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25448 states. [2019-11-19 21:56:38,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25448 to 14702. [2019-11-19 21:56:38,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14702 states. [2019-11-19 21:56:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14702 states to 14702 states and 14883 transitions. [2019-11-19 21:56:38,498 INFO L78 Accepts]: Start accepts. Automaton has 14702 states and 14883 transitions. Word has length 1122 [2019-11-19 21:56:38,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:56:38,499 INFO L462 AbstractCegarLoop]: Abstraction has 14702 states and 14883 transitions. [2019-11-19 21:56:38,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 21:56:38,499 INFO L276 IsEmpty]: Start isEmpty. Operand 14702 states and 14883 transitions. [2019-11-19 21:56:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1182 [2019-11-19 21:56:38,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:56:38,511 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:56:38,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:56:38,711 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:56:38,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:56:38,712 INFO L82 PathProgramCache]: Analyzing trace with hash -848873680, now seen corresponding path program 1 times [2019-11-19 21:56:38,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:56:38,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572336419] [2019-11-19 21:56:38,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:56:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:56:39,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2037 backedges. 1323 proven. 231 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2019-11-19 21:56:39,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572336419] [2019-11-19 21:56:39,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34320861] [2019-11-19 21:56:39,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:56:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:56:40,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 21:56:40,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:56:40,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:56:40,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:56:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2037 backedges. 1065 proven. 0 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2019-11-19 21:56:41,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 21:56:41,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-19 21:56:41,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900997301] [2019-11-19 21:56:41,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:56:41,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:56:41,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:56:41,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:56:41,173 INFO L87 Difference]: Start difference. First operand 14702 states and 14883 transitions. Second operand 4 states. [2019-11-19 21:56:42,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:56:42,714 INFO L93 Difference]: Finished difference Result 31800 states and 32196 transitions. [2019-11-19 21:56:42,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:56:42,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1181 [2019-11-19 21:56:42,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:56:42,715 INFO L225 Difference]: With dead ends: 31800 [2019-11-19 21:56:42,715 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 21:56:42,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1186 GetRequests, 1180 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:56:42,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 21:56:42,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 21:56:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 21:56:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 21:56:42,723 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1181 [2019-11-19 21:56:42,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:56:42,724 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 21:56:42,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:56:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 21:56:42,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 21:56:42,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:56:42,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 21:56:47,220 WARN L191 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 2082 DAG size of output: 1244 [2019-11-19 21:56:50,550 WARN L191 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 1531 DAG size of output: 1241 [2019-11-19 21:56:51,972 WARN L191 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 1008 DAG size of output: 888 [2019-11-19 21:57:07,047 WARN L191 SmtUtils]: Spent 15.06 s on a formula simplification. DAG size of input: 1184 DAG size of output: 189 [2019-11-19 21:57:22,223 WARN L191 SmtUtils]: Spent 15.17 s on a formula simplification. DAG size of input: 1181 DAG size of output: 189 [2019-11-19 21:57:31,222 WARN L191 SmtUtils]: Spent 8.99 s on a formula simplification. DAG size of input: 853 DAG size of output: 176 [2019-11-19 21:57:31,225 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,226 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,226 INFO L444 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,226 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,226 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-19 21:57:31,226 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,226 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,226 INFO L444 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,226 INFO L444 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,226 INFO L444 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,226 INFO L444 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,226 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-19 21:57:31,226 INFO L444 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,227 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,227 INFO L444 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,227 INFO L444 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-19 21:57:31,227 INFO L444 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,227 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,227 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-19 21:57:31,227 INFO L444 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,227 INFO L444 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,227 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,227 INFO L444 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,227 INFO L444 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,227 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,227 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-19 21:57:31,227 INFO L444 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,228 INFO L444 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,228 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,228 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,228 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-19 21:57:31,228 INFO L444 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-19 21:57:31,228 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,228 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,228 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,228 INFO L444 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,228 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-19 21:57:31,228 INFO L444 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-19 21:57:31,228 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,228 INFO L444 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,228 INFO L444 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,229 INFO L444 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,229 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,229 INFO L444 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-19 21:57:31,229 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,229 INFO L444 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-19 21:57:31,229 INFO L444 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-19 21:57:31,229 INFO L444 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-19 21:57:31,229 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-19 21:57:31,229 INFO L444 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,229 INFO L444 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,229 INFO L444 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,229 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,229 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,230 INFO L444 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-19 21:57:31,230 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,230 INFO L444 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,230 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-19 21:57:31,230 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,230 INFO L444 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-19 21:57:31,230 INFO L444 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,230 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,230 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,230 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-19 21:57:31,231 INFO L444 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,231 INFO L444 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-19 21:57:31,231 INFO L444 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-19 21:57:31,231 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-19 21:57:31,231 INFO L444 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-19 21:57:31,231 INFO L444 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-19 21:57:31,231 INFO L444 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-19 21:57:31,231 INFO L444 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,231 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,231 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,231 INFO L444 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,232 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-19 21:57:31,232 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-19 21:57:31,232 INFO L444 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,232 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-19 21:57:31,232 INFO L444 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,232 INFO L444 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,232 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,232 INFO L444 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,232 INFO L444 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,232 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,232 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-19 21:57:31,233 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 21:57:31,233 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 142) no Hoare annotation was computed. [2019-11-19 21:57:31,233 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,233 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,233 INFO L444 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,233 INFO L444 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,233 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,233 INFO L444 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-19 21:57:31,233 INFO L444 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-19 21:57:31,233 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,234 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-19 21:57:31,234 INFO L444 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-19 21:57:31,234 INFO L444 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-19 21:57:31,234 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,234 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-19 21:57:31,234 INFO L444 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-19 21:57:31,234 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,234 INFO L444 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,234 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,234 INFO L444 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,234 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-19 21:57:31,235 INFO L444 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-19 21:57:31,235 INFO L444 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,235 INFO L444 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,235 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,235 INFO L444 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-19 21:57:31,235 INFO L444 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-19 21:57:31,235 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,235 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-19 21:57:31,235 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,235 INFO L444 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,236 INFO L444 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,236 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,236 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,236 INFO L444 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,236 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-19 21:57:31,236 INFO L444 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,236 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,236 INFO L444 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-19 21:57:31,236 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,236 INFO L444 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,236 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,237 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,237 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-19 21:57:31,237 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,237 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,237 INFO L444 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,237 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,237 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,237 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-19 21:57:31,237 INFO L444 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,237 INFO L444 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,237 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,238 INFO L444 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,238 INFO L444 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-19 21:57:31,238 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,238 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,238 INFO L444 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,238 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-19 21:57:31,238 INFO L444 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-19 21:57:31,238 INFO L444 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,238 INFO L444 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,238 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-19 21:57:31,238 INFO L444 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,239 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,239 INFO L444 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,239 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,239 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,239 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-19 21:57:31,239 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,242 INFO L444 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,242 INFO L444 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,242 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,242 INFO L444 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,242 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-19 21:57:31,242 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,243 INFO L444 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,243 INFO L444 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-19 21:57:31,243 INFO L444 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,243 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-19 21:57:31,243 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-19 21:57:31,243 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,243 INFO L444 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,244 INFO L444 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,244 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,244 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,244 INFO L444 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-19 21:57:31,244 INFO L444 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-19 21:57:31,244 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,245 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-19 21:57:31,245 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 21:57:31,245 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-19 21:57:31,245 INFO L444 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,245 INFO L444 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,245 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,245 INFO L444 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,246 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,246 INFO L444 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-19 21:57:31,246 INFO L444 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-19 21:57:31,246 INFO L444 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-19 21:57:31,246 INFO L444 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-19 21:57:31,246 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,247 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,247 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,247 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-19 21:57:31,247 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-19 21:57:31,247 INFO L444 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,247 INFO L444 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-19 21:57:31,247 INFO L444 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,248 INFO L444 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,248 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,248 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,248 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-19 21:57:31,248 INFO L444 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-19 21:57:31,248 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-19 21:57:31,249 INFO L444 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,249 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-19 21:57:31,249 INFO L444 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,249 INFO L444 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,249 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,249 INFO L444 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,250 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,250 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,250 INFO L444 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,250 INFO L444 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,250 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-19 21:57:31,250 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-19 21:57:31,250 INFO L444 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-19 21:57:31,251 INFO L444 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-19 21:57:31,251 INFO L444 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,251 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,251 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,251 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,252 INFO L440 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse37 (+ ~a29~0 144)) (.cse40 (+ ~a4~0 86))) (let ((.cse12 (<= .cse40 0)) (.cse36 (< 0 .cse37)) (.cse39 (+ ~a29~0 16))) (let ((.cse7 (<= (+ ~a0~0 147) 0)) (.cse35 (not (= 1 ~a2~0))) (.cse23 (+ ~a0~0 44)) (.cse24 (+ ~a29~0 127)) (.cse33 (not (= 6 ULTIMATE.start_calculate_output_~input))) (.cse19 (< 0 .cse40)) (.cse38 (<= .cse39 0)) (.cse9 (= 4 ~a2~0)) (.cse14 (= 2 ~a2~0)) (.cse25 (and .cse12 .cse36)) (.cse3 (= ~a2~0 1))) (let ((.cse21 (and .cse25 .cse3)) (.cse10 (and .cse12 .cse14)) (.cse4 (= 3 ~a2~0)) (.cse20 (and .cse12 .cse36 .cse9)) (.cse16 (<= ~a0~0 599920)) (.cse8 (< 0 .cse39)) (.cse15 (<= ~a0~0 599976)) (.cse26 (or .cse33 .cse19 .cse38)) (.cse6 (<= ~a29~0 43)) (.cse18 (<= (+ (* 25 ~a29~0) ~a0~0) 596270)) (.cse13 (and .cse38 .cse36)) (.cse0 (<= (+ ~a0~0 242851) 0)) (.cse1 (<= 0 .cse24)) (.cse11 (<= .cse37 0)) (.cse30 (<= (+ ~a0~0 98) 0)) (.cse29 (<= 0 (+ ~a0~0 146))) (.cse17 (exists ((v_~a29~0_893 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_893 299928)) (< 43 v_~a29~0_893) (<= 0 v_~a29~0_893)))) (.cse32 (<= 0 (+ ~a0~0 97))) (.cse22 (<= .cse23 0)) (.cse5 (<= (+ ~a0~0 61) 0)) (.cse2 (<= (+ ~a4~0 42) 0)) (.cse31 (and .cse36 .cse7 (not (= ~a2~0 3)) .cse35)) (.cse27 (= 5 ~a2~0)) (.cse28 (<= 4453 ~a29~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (and .cse2 .cse4 .cse5) .cse6 .cse1) (and .cse7 .cse2 (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse8 .cse9) (and (or (and .cse10 .cse11) (and (and (and .cse12 .cse13) .cse14) .cse1)) .cse15) (and .cse12 .cse9 .cse16 .cse17 .cse18) (and .cse8 .cse15 (and .cse2 .cse3 .cse19 .cse6)) (and .cse2 .cse8 (and .cse3 .cse7)) (and (and .cse8 (<= ~a29~0 42) .cse20) .cse15) (and (<= (+ ~a4~0 89) 0) (and .cse21 .cse22) (<= 0 .cse23) (<= .cse24 0) .cse1) (and .cse15 (and (and .cse25 .cse26 .cse27) .cse28)) (and .cse27 .cse5 .cse2 .cse29 .cse13) (and .cse30 .cse27 .cse1 .cse2 .cse29) (and (and .cse2 (and .cse31 .cse0)) .cse27) (and .cse5 .cse9 .cse2 .cse32 .cse13) (and .cse30 .cse2 .cse4) (and (and .cse12 .cse8 .cse4) .cse15) (and .cse5 .cse21) (and .cse5 .cse2 .cse3 .cse29 .cse13) (and .cse2 .cse7 .cse14) (and (or (and (and .cse10 .cse1) .cse33) (and .cse17 (and .cse12 .cse4))) .cse15) (and .cse20 .cse16) (and .cse30 .cse14 .cse1 .cse2) (and .cse5 .cse9 .cse1 .cse2 .cse32) (and .cse31 .cse14) (and .cse7 .cse12) (and .cse6 .cse14 .cse5 .cse1 .cse2) (and .cse8 .cse15 (and .cse26 (and (or .cse6 .cse18) .cse25) .cse27)) (and (or (and .cse13 .cse0 .cse1) .cse11) .cse2 .cse9 (exists ((v_~a0~0_830 Int)) (let ((.cse34 (div v_~a0~0_830 5))) (and (<= v_~a0~0_830 599920) (<= ~a0~0 (+ (div (+ .cse34 (- 278887)) 5) 1)) (< .cse34 278887) (not (= (mod (+ .cse34 3) 5) 0)) (<= 0 v_~a0~0_830))))) (and .cse30 .cse19 .cse2 .cse3 .cse29) (and .cse12 .cse17 .cse3 .cse32 .cse22) (and .cse12 .cse35 .cse5) (and (and .cse2 .cse31 .cse27) .cse28)))))) [2019-11-19 21:57:31,252 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-19 21:57:31,253 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-19 21:57:31,253 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,253 INFO L444 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,253 INFO L444 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,253 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,253 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,254 INFO L444 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,254 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,254 INFO L444 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-19 21:57:31,254 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,254 INFO L444 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-19 21:57:31,254 INFO L447 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-19 21:57:31,254 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,255 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-19 21:57:31,255 INFO L444 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-19 21:57:31,255 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-19 21:57:31,255 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-19 21:57:31,255 INFO L444 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,255 INFO L444 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,256 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,256 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,256 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,256 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-19 21:57:31,257 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-19 21:57:31,257 INFO L444 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,257 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-19 21:57:31,257 INFO L444 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-19 21:57:31,257 INFO L444 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,257 INFO L444 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,258 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,258 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,258 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,258 INFO L444 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,259 INFO L440 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse41 (+ ~a29~0 144)) (.cse42 (+ ~a4~0 86))) (let ((.cse40 (+ ~a0~0 44)) (.cse9 (<= .cse42 0)) (.cse39 (< 0 .cse41)) (.cse15 (+ ~a0~0 147))) (let ((.cse25 (= 4 ~a2~0)) (.cse21 (+ ~a29~0 127)) (.cse34 (< 0 .cse42)) (.cse16 (<= 0 (+ ~a0~0 146))) (.cse38 (+ ~a29~0 16)) (.cse7 (= 2 ~a2~0)) (.cse22 (<= .cse15 0)) (.cse37 (not (= 1 ~a2~0))) (.cse33 (and .cse9 .cse39)) (.cse18 (= ~a2~0 1)) (.cse20 (<= 0 .cse40)) (.cse24 (= 3 ~a2~0))) (let ((.cse4 (or (and .cse9 .cse24) (and .cse39 .cse20 .cse24))) (.cse11 (and .cse33 .cse18)) (.cse23 (<= 4453 ~a29~0)) (.cse6 (and .cse39 .cse22 (not (= ~a2~0 3)) .cse37)) (.cse0 (and .cse9 .cse7)) (.cse26 (<= (+ ~a0~0 242851) 0)) (.cse30 (<= .cse41 0)) (.cse12 (= 5 ~a2~0)) (.cse2 (not (= 6 ULTIMATE.start_calculate_output_~input))) (.cse8 (< 0 .cse38)) (.cse5 (<= ~a0~0 599976)) (.cse32 (<= (+ (* 25 ~a29~0) ~a0~0) 596270)) (.cse28 (and .cse34 .cse16 .cse24)) (.cse27 (<= ~a29~0 43)) (.cse1 (<= 0 .cse21)) (.cse29 (and .cse9 .cse39 .cse25)) (.cse35 (<= ~a0~0 599920)) (.cse13 (<= (+ ~a0~0 98) 0)) (.cse3 (exists ((v_~a29~0_893 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_893 299928)) (< 43 v_~a29~0_893) (<= 0 v_~a29~0_893)))) (.cse19 (<= .cse40 0)) (.cse14 (<= (+ ~a4~0 42) 0)) (.cse36 (<= 0 (+ ~a0~0 97))) (.cse17 (and (<= .cse38 0) .cse39)) (.cse10 (<= (+ ~a0~0 61) 0))) (or (and (or (and (and .cse0 .cse1) .cse2) (and .cse3 .cse4)) .cse5) (and .cse6 .cse7) (and (and .cse8 (and .cse9 .cse4)) .cse5) (and .cse10 .cse11) (and .cse12 (and .cse13 .cse14 (< 0 .cse15) .cse1)) (and .cse12 .cse10 .cse14 .cse16 .cse17) (and .cse10 .cse14 .cse18 .cse16 .cse17) (and (and .cse11 .cse19) (<= (+ ~a4~0 89) 0) .cse20 (<= .cse21 0) .cse1) (and .cse22 .cse9) (and (and (and .cse14 .cse6) .cse12) .cse23) (and (and (and .cse9 .cse2 .cse12) .cse23) .cse5) (and (and .cse14 .cse17 .cse24 .cse10) .cse1) (and .cse14 .cse8 .cse22 .cse25) (and (and .cse14 (and .cse6 .cse26)) .cse12) (and .cse8 (and .cse14 .cse27 .cse28 .cse10)) (and (and .cse8 (<= ~a29~0 42) .cse29) .cse5) (and (or (and (and (and .cse9 .cse17) .cse7) .cse1) (and .cse0 .cse30)) .cse5) (and .cse14 (and .cse18 .cse22) .cse8) (and .cse26 .cse1 .cse14 .cse18) (and (and (or (and .cse26 .cse1) .cse30) .cse14 .cse25) (exists ((v_~a0~0_830 Int)) (let ((.cse31 (div v_~a0~0_830 5))) (and (<= v_~a0~0_830 599920) (<= ~a0~0 (+ (div (+ .cse31 (- 278887)) 5) 1)) (< .cse31 278887) (not (= (mod (+ .cse31 3) 5) 0)) (<= 0 v_~a0~0_830))))) (and .cse13 .cse8 .cse7 .cse14) (and .cse5 (and (and (and (or .cse27 .cse32) .cse33) .cse12 (or .cse2 .cse27)) .cse8)) (and (and .cse8 (and .cse14 (and .cse18 .cse34 .cse27))) .cse5) (and .cse9 .cse25 .cse35 .cse3 .cse32) (and .cse13 .cse14 .cse28) (and .cse10 .cse25 .cse1 .cse14 .cse36) (and .cse27 .cse7 .cse10 .cse1 .cse14) (and .cse14 (and .cse22 .cse24)) (and .cse29 .cse35) (and .cse13 .cse34 .cse14 .cse18 .cse16) (and .cse14 .cse22 .cse7) (and .cse9 .cse3 .cse18 .cse36 .cse19) (and .cse14 .cse36 .cse17 .cse10 .cse25) (and .cse9 .cse37 .cse10)))))) [2019-11-19 21:57:31,259 INFO L444 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,259 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-19 21:57:31,260 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-19 21:57:31,260 INFO L444 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,260 INFO L444 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,260 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,260 INFO L444 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,260 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,261 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,261 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-19 21:57:31,261 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-19 21:57:31,261 INFO L444 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,261 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,261 INFO L444 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-19 21:57:31,261 INFO L444 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,262 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,262 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,262 INFO L444 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,262 INFO L444 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,262 INFO L444 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,262 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-19 21:57:31,263 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-19 21:57:31,263 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,263 INFO L444 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,263 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,263 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,263 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,264 INFO L444 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,264 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 21:57:31,264 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-19 21:57:31,264 INFO L444 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,264 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-19 21:57:31,264 INFO L444 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,264 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,265 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,265 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,265 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,265 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,265 INFO L444 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,265 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-19 21:57:31,265 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-19 21:57:31,266 INFO L444 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,266 INFO L444 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,266 INFO L444 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,266 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,266 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,266 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,267 INFO L444 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,267 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-19 21:57:31,267 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-19 21:57:31,267 INFO L444 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,267 INFO L444 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,267 INFO L444 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,267 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,268 INFO L444 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,268 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,268 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,268 INFO L444 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-19 21:57:31,268 INFO L444 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-19 21:57:31,268 INFO L444 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,269 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-19 21:57:31,269 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-19 21:57:31,269 INFO L444 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,269 INFO L444 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,269 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,269 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,269 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,270 INFO L444 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,270 INFO L440 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse41 (+ ~a29~0 144)) (.cse42 (+ ~a4~0 86))) (let ((.cse40 (+ ~a0~0 44)) (.cse15 (+ ~a0~0 147)) (.cse9 (<= .cse42 0)) (.cse39 (< 0 .cse41))) (let ((.cse22 (= 4 ~a2~0)) (.cse28 (+ ~a29~0 127)) (.cse34 (< 0 .cse42)) (.cse16 (<= 0 (+ ~a0~0 146))) (.cse38 (+ ~a29~0 16)) (.cse7 (= 2 ~a2~0)) (.cse33 (and .cse9 .cse39)) (.cse18 (= ~a2~0 1)) (.cse19 (<= .cse15 0)) (.cse37 (not (= 1 ~a2~0))) (.cse27 (<= 0 .cse40)) (.cse21 (= 3 ~a2~0))) (let ((.cse4 (or (and .cse9 .cse21) (and .cse39 .cse27 .cse21))) (.cse20 (<= 4453 ~a29~0)) (.cse6 (and .cse39 .cse19 (not (= ~a2~0 3)) .cse37)) (.cse11 (and .cse33 .cse18)) (.cse0 (and .cse9 .cse7)) (.cse23 (<= (+ ~a0~0 242851) 0)) (.cse30 (<= .cse41 0)) (.cse12 (= 5 ~a2~0)) (.cse2 (not (= 6 ULTIMATE.start_calculate_output_~input))) (.cse8 (< 0 .cse38)) (.cse5 (<= ~a0~0 599976)) (.cse32 (<= (+ (* 25 ~a29~0) ~a0~0) 596270)) (.cse25 (and .cse34 .cse16 .cse21)) (.cse24 (<= ~a29~0 43)) (.cse1 (<= 0 .cse28)) (.cse29 (and .cse9 .cse39 .cse22)) (.cse35 (<= ~a0~0 599920)) (.cse13 (<= (+ ~a0~0 98) 0)) (.cse3 (exists ((v_~a29~0_893 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_893 299928)) (< 43 v_~a29~0_893) (<= 0 v_~a29~0_893)))) (.cse26 (<= .cse40 0)) (.cse14 (<= (+ ~a4~0 42) 0)) (.cse36 (<= 0 (+ ~a0~0 97))) (.cse17 (and (<= .cse38 0) .cse39)) (.cse10 (<= (+ ~a0~0 61) 0))) (or (and (or (and (and .cse0 .cse1) .cse2) (and .cse3 .cse4)) .cse5) (and .cse6 .cse7) (and (and .cse8 (and .cse9 .cse4)) .cse5) (and .cse10 .cse11) (and .cse12 (and .cse13 .cse14 (< 0 .cse15) .cse1)) (and .cse12 .cse10 .cse14 .cse16 .cse17) (and .cse10 .cse14 .cse18 .cse16 .cse17) (and .cse19 .cse9) (and (and (and .cse14 .cse6) .cse12) .cse20) (and (and (and .cse9 .cse2 .cse12) .cse20) .cse5) (and (and .cse14 .cse17 .cse21 .cse10) .cse1) (and .cse14 .cse8 .cse19 .cse22) (and (and .cse14 (and .cse6 .cse23)) .cse12) (and .cse8 (and .cse14 .cse24 .cse25 .cse10)) (and (and .cse11 .cse26) (<= (+ ~a4~0 89) 0) .cse27 (<= .cse28 0) .cse1) (and (and .cse8 (<= ~a29~0 42) .cse29) .cse5) (and (or (and (and (and .cse9 .cse17) .cse7) .cse1) (and .cse0 .cse30)) .cse5) (and .cse14 (and .cse18 .cse19) .cse8) (and .cse23 .cse1 .cse14 .cse18) (and (and (or (and .cse23 .cse1) .cse30) .cse14 .cse22) (exists ((v_~a0~0_830 Int)) (let ((.cse31 (div v_~a0~0_830 5))) (and (<= v_~a0~0_830 599920) (<= ~a0~0 (+ (div (+ .cse31 (- 278887)) 5) 1)) (< .cse31 278887) (not (= (mod (+ .cse31 3) 5) 0)) (<= 0 v_~a0~0_830))))) (and .cse13 .cse8 .cse7 .cse14) (and .cse5 (and (and (and (or .cse24 .cse32) .cse33) .cse12 (or .cse2 .cse24)) .cse8)) (and (and .cse8 (and .cse14 (and .cse18 .cse34 .cse24))) .cse5) (and .cse9 .cse22 .cse35 .cse3 .cse32) (and .cse13 .cse14 .cse25) (and .cse10 .cse22 .cse1 .cse14 .cse36) (and .cse24 .cse7 .cse10 .cse1 .cse14) (and .cse14 (and .cse19 .cse21)) (and .cse29 .cse35) (and .cse13 .cse34 .cse14 .cse18 .cse16) (and .cse14 .cse19 .cse7) (and .cse9 .cse3 .cse18 .cse36 .cse26) (and .cse14 .cse36 .cse17 .cse10 .cse22) (and .cse9 .cse37 .cse10)))))) [2019-11-19 21:57:31,271 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-19 21:57:31,271 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-19 21:57:31,271 INFO L444 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,271 INFO L444 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,271 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,271 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,272 INFO L444 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,272 INFO L444 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,272 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,272 INFO L444 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,272 INFO L444 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-19 21:57:31,272 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-19 21:57:31,273 INFO L444 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,273 INFO L444 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-19 21:57:31,273 INFO L444 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-19 21:57:31,273 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,273 INFO L444 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,273 INFO L444 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,273 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,274 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,274 INFO L444 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-19 21:57:31,274 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-19 21:57:31,274 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,274 INFO L444 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,274 INFO L444 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,274 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,275 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-19 21:57:31,275 INFO L444 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-19 21:57:31,275 INFO L444 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-19 21:57:31,275 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,275 INFO L444 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-19 21:57:31,275 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-19 21:57:31,276 INFO L444 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,276 INFO L444 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,276 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,276 INFO L444 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,276 INFO L444 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,276 INFO L444 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,276 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,277 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-19 21:57:31,277 INFO L444 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-19 21:57:31,277 INFO L444 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,277 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,277 INFO L444 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,277 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-19 21:57:31,277 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,278 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 21:57:31,278 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,278 INFO L444 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-19 21:57:31,278 INFO L444 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,278 INFO L444 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,278 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,279 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,279 INFO L444 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,279 INFO L444 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,279 INFO L444 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,279 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-19 21:57:31,279 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-19 21:57:31,279 INFO L444 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,280 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-19 21:57:31,280 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,280 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,280 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,280 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-19 21:57:31,280 INFO L444 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,280 INFO L444 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,281 INFO L444 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,281 INFO L444 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,281 INFO L444 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-19 21:57:31,281 INFO L444 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,281 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,281 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-19 21:57:31,282 INFO L444 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-19 21:57:31,282 INFO L444 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,282 INFO L444 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,282 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,282 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-19 21:57:31,282 INFO L444 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,282 INFO L444 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,283 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,283 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,283 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,283 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-19 21:57:31,283 INFO L444 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,283 INFO L444 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,284 INFO L444 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-19 21:57:31,284 INFO L444 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-19 21:57:31,284 INFO L444 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,284 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-19 21:57:31,284 INFO L444 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-19 21:57:31,284 INFO L444 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,285 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-19 21:57:31,285 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,285 INFO L444 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-19 21:57:31,285 INFO L444 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-19 21:57:31,285 INFO L444 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,285 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,285 INFO L444 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-19 21:57:31,286 INFO L444 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-19 21:57:31,286 INFO L444 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-19 21:57:31,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,299 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:57:31 BoogieIcfgContainer [2019-11-19 21:57:31,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:57:31,372 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:57:31,372 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:57:31,372 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:57:31,373 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:53:43" (3/4) ... [2019-11-19 21:57:31,376 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 21:57:31,432 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-19 21:57:31,435 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 21:57:31,480 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && 2 == a2) && 0 <= a29 + 127) && !(6 == input)) || ((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && ((a4 + 86 <= 0 && 3 == a2) || ((0 < a29 + 144 && 0 <= a0 + 44) && 3 == a2)))) && a0 <= 599976) || ((((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 2 == a2)) || ((0 < a29 + 16 && a4 + 86 <= 0 && ((a4 + 86 <= 0 && 3 == a2) || ((0 < a29 + 144 && 0 <= a0 + 44) && 3 == a2))) && a0 <= 599976)) || (a0 + 61 <= 0 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1)) || (5 == a2 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && 0 <= a29 + 127)) || ((((5 == a2 && a0 + 61 <= 0) && a4 + 42 <= 0) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((((a0 + 61 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || (((((((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0) && a4 + 89 <= 0) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || (a0 + 147 <= 0 && a4 + 86 <= 0)) || (((a4 + 42 <= 0 && ((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 5 == a2) && 4453 <= a29)) || ((((a4 + 86 <= 0 && !(6 == input)) && 5 == a2) && 4453 <= a29) && a0 <= 599976)) || ((((a4 + 42 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && 0 < a29 + 16) && a0 + 147 <= 0) && 4 == a2)) || ((a4 + 42 <= 0 && (((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && a0 + 242851 <= 0) && 5 == a2)) || (0 < a29 + 16 && ((a4 + 42 <= 0 && a29 <= 43) && (0 < a4 + 86 && 0 <= a0 + 146) && 3 == a2) && a0 + 61 <= 0)) || (((0 < a29 + 16 && a29 <= 42) && (a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599976)) || (((((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 2 == a2) && 0 <= a29 + 127) || ((a4 + 86 <= 0 && 2 == a2) && a29 + 144 <= 0)) && a0 <= 599976)) || ((a4 + 42 <= 0 && a2 == 1 && a0 + 147 <= 0) && 0 < a29 + 16)) || (((a0 + 242851 <= 0 && 0 <= a29 + 127) && a4 + 42 <= 0) && a2 == 1)) || (((((a0 + 242851 <= 0 && 0 <= a29 + 127) || a29 + 144 <= 0) && a4 + 42 <= 0) && 4 == a2) && (\exists v_~a0~0_830 : int :: (((v_~a0~0_830 <= 599920 && a0 <= (v_~a0~0_830 / 5 + -278887) / 5 + 1) && v_~a0~0_830 / 5 < 278887) && !((v_~a0~0_830 / 5 + 3) % 5 == 0)) && 0 <= v_~a0~0_830))) || (((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2) && a4 + 42 <= 0)) || (a0 <= 599976 && ((((a29 <= 43 || 25 * a29 + a0 <= 596270) && a4 + 86 <= 0 && 0 < a29 + 144) && 5 == a2) && (!(6 == input) || a29 <= 43)) && 0 < a29 + 16)) || ((0 < a29 + 16 && a4 + 42 <= 0 && (a2 == 1 && 0 < a4 + 86) && a29 <= 43) && a0 <= 599976)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && (0 < a4 + 86 && 0 <= a0 + 146) && 3 == a2)) || ((((a0 + 61 <= 0 && 4 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0) && 0 <= a0 + 97)) || ((((a29 <= 43 && 2 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127) && a4 + 42 <= 0)) || (a4 + 42 <= 0 && a0 + 147 <= 0 && 3 == a2)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599920)) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || ((((a4 + 86 <= 0 && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && a2 == 1) && 0 <= a0 + 97) && a0 + 44 <= 0)) || ((((a4 + 42 <= 0 && 0 <= a0 + 97) && a29 + 16 <= 0 && 0 < a29 + 144) && a0 + 61 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0) [2019-11-19 21:57:31,483 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && 2 == a2) && 0 <= a29 + 127) && !(6 == input)) || ((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && ((a4 + 86 <= 0 && 3 == a2) || ((0 < a29 + 144 && 0 <= a0 + 44) && 3 == a2)))) && a0 <= 599976) || ((((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 2 == a2)) || ((0 < a29 + 16 && a4 + 86 <= 0 && ((a4 + 86 <= 0 && 3 == a2) || ((0 < a29 + 144 && 0 <= a0 + 44) && 3 == a2))) && a0 <= 599976)) || (a0 + 61 <= 0 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1)) || (5 == a2 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && 0 <= a29 + 127)) || ((((5 == a2 && a0 + 61 <= 0) && a4 + 42 <= 0) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((((a0 + 61 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || (a0 + 147 <= 0 && a4 + 86 <= 0)) || (((a4 + 42 <= 0 && ((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 5 == a2) && 4453 <= a29)) || ((((a4 + 86 <= 0 && !(6 == input)) && 5 == a2) && 4453 <= a29) && a0 <= 599976)) || ((((a4 + 42 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && 0 < a29 + 16) && a0 + 147 <= 0) && 4 == a2)) || ((a4 + 42 <= 0 && (((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && a0 + 242851 <= 0) && 5 == a2)) || (0 < a29 + 16 && ((a4 + 42 <= 0 && a29 <= 43) && (0 < a4 + 86 && 0 <= a0 + 146) && 3 == a2) && a0 + 61 <= 0)) || (((((((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0) && a4 + 89 <= 0) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || (((0 < a29 + 16 && a29 <= 42) && (a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599976)) || (((((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 2 == a2) && 0 <= a29 + 127) || ((a4 + 86 <= 0 && 2 == a2) && a29 + 144 <= 0)) && a0 <= 599976)) || ((a4 + 42 <= 0 && a2 == 1 && a0 + 147 <= 0) && 0 < a29 + 16)) || (((a0 + 242851 <= 0 && 0 <= a29 + 127) && a4 + 42 <= 0) && a2 == 1)) || (((((a0 + 242851 <= 0 && 0 <= a29 + 127) || a29 + 144 <= 0) && a4 + 42 <= 0) && 4 == a2) && (\exists v_~a0~0_830 : int :: (((v_~a0~0_830 <= 599920 && a0 <= (v_~a0~0_830 / 5 + -278887) / 5 + 1) && v_~a0~0_830 / 5 < 278887) && !((v_~a0~0_830 / 5 + 3) % 5 == 0)) && 0 <= v_~a0~0_830))) || (((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2) && a4 + 42 <= 0)) || (a0 <= 599976 && ((((a29 <= 43 || 25 * a29 + a0 <= 596270) && a4 + 86 <= 0 && 0 < a29 + 144) && 5 == a2) && (!(6 == input) || a29 <= 43)) && 0 < a29 + 16)) || ((0 < a29 + 16 && a4 + 42 <= 0 && (a2 == 1 && 0 < a4 + 86) && a29 <= 43) && a0 <= 599976)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && (0 < a4 + 86 && 0 <= a0 + 146) && 3 == a2)) || ((((a0 + 61 <= 0 && 4 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0) && 0 <= a0 + 97)) || ((((a29 <= 43 && 2 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127) && a4 + 42 <= 0)) || (a4 + 42 <= 0 && a0 + 147 <= 0 && 3 == a2)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599920)) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || ((((a4 + 86 <= 0 && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && a2 == 1) && 0 <= a0 + 97) && a0 + 44 <= 0)) || ((((a4 + 42 <= 0 && 0 <= a0 + 97) && a29 + 16 <= 0 && 0 < a29 + 144) && a0 + 61 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0) [2019-11-19 21:57:31,513 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((a0 + 242851 <= 0 && 0 <= a29 + 127) && a4 + 42 <= 0) && a2 == 1) || ((((a4 + 42 <= 0 && 3 == a2) && a0 + 61 <= 0) && a29 <= 43) && 0 <= a29 + 127)) || ((((a0 + 147 <= 0 && a4 + 42 <= 0) && !(1 == input)) && 0 < a29 + 16) && 4 == a2)) || ((((a4 + 86 <= 0 && 2 == a2) && a29 + 144 <= 0) || (((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 2 == a2) && 0 <= a29 + 127)) && a0 <= 599976)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || ((0 < a29 + 16 && a0 <= 599976) && ((a4 + 42 <= 0 && a2 == 1) && 0 < a4 + 86) && a29 <= 43)) || ((a4 + 42 <= 0 && 0 < a29 + 16) && a2 == 1 && a0 + 147 <= 0)) || (((0 < a29 + 16 && a29 <= 42) && (a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599976)) || ((((a4 + 89 <= 0 && ((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || (a0 <= 599976 && (((a4 + 86 <= 0 && 0 < a29 + 144) && ((!(6 == input) || 0 < a4 + 86) || a29 + 16 <= 0)) && 5 == a2) && 4453 <= a29)) || ((((5 == a2 && a0 + 61 <= 0) && a4 + 42 <= 0) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((((a0 + 98 <= 0 && 5 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0) && 0 <= a0 + 146)) || ((a4 + 42 <= 0 && (((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && a0 + 242851 <= 0) && 5 == a2)) || ((((a0 + 61 <= 0 && 4 == a2) && a4 + 42 <= 0) && 0 <= a0 + 97) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || (((a4 + 86 <= 0 && 0 < a29 + 16) && 3 == a2) && a0 <= 599976)) || (a0 + 61 <= 0 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1)) || ((((a0 + 61 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || (((((a4 + 86 <= 0 && 2 == a2) && 0 <= a29 + 127) && !(6 == input)) || ((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && a4 + 86 <= 0 && 3 == a2)) && a0 <= 599976)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599920)) || (((a0 + 98 <= 0 && 2 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0)) || ((((a0 + 61 <= 0 && 4 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0) && 0 <= a0 + 97)) || ((((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 2 == a2)) || (a0 + 147 <= 0 && a4 + 86 <= 0)) || ((((a29 <= 43 && 2 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127) && a4 + 42 <= 0)) || ((0 < a29 + 16 && a0 <= 599976) && (((!(6 == input) || 0 < a4 + 86) || a29 + 16 <= 0) && (a29 <= 43 || 25 * a29 + a0 <= 596270) && a4 + 86 <= 0 && 0 < a29 + 144) && 5 == a2)) || (((((((a29 + 16 <= 0 && 0 < a29 + 144) && a0 + 242851 <= 0) && 0 <= a29 + 127) || a29 + 144 <= 0) && a4 + 42 <= 0) && 4 == a2) && (\exists v_~a0~0_830 : int :: (((v_~a0~0_830 <= 599920 && a0 <= (v_~a0~0_830 / 5 + -278887) / 5 + 1) && v_~a0~0_830 / 5 < 278887) && !((v_~a0~0_830 / 5 + 3) % 5 == 0)) && 0 <= v_~a0~0_830))) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146)) || ((((a4 + 86 <= 0 && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && a2 == 1) && 0 <= a0 + 97) && a0 + 44 <= 0)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && ((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 5 == a2) && 4453 <= a29) [2019-11-19 21:57:31,676 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e61d26fd-ecce-468c-af01-36b8172aa427/bin/uautomizer/witness.graphml [2019-11-19 21:57:31,676 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:57:31,678 INFO L168 Benchmark]: Toolchain (without parser) took 233409.51 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 939.4 MB in the beginning and 4.7 GB in the end (delta: -3.7 GB). Peak memory consumption was 362.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:57:31,678 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:57:31,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1495.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:57:31,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 214.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:57:31,679 INFO L168 Benchmark]: Boogie Preprocessor took 208.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:57:31,680 INFO L168 Benchmark]: RCFGBuilder took 3012.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.9 MB in the end (delta: 77.3 MB). Peak memory consumption was 165.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:57:31,680 INFO L168 Benchmark]: TraceAbstraction took 228165.83 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 982.9 MB in the beginning and 4.8 GB in the end (delta: -3.8 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-11-19 21:57:31,680 INFO L168 Benchmark]: Witness Printer took 304.97 ms. Allocated memory is still 5.1 GB. Free memory was 4.8 GB in the beginning and 4.7 GB in the end (delta: 108.4 MB). Peak memory consumption was 108.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:57:31,682 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1495.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.7 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 214.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 208.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3012.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.9 MB in the end (delta: 77.3 MB). Peak memory consumption was 165.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 228165.83 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 982.9 MB in the beginning and 4.8 GB in the end (delta: -3.8 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 304.97 ms. Allocated memory is still 5.1 GB. Free memory was 4.8 GB in the beginning and 4.7 GB in the end (delta: 108.4 MB). Peak memory consumption was 108.4 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_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 142]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1766]: Loop Invariant [2019-11-19 21:57:31,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && 2 == a2) && 0 <= a29 + 127) && !(6 == input)) || ((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && ((a4 + 86 <= 0 && 3 == a2) || ((0 < a29 + 144 && 0 <= a0 + 44) && 3 == a2)))) && a0 <= 599976) || ((((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 2 == a2)) || ((0 < a29 + 16 && a4 + 86 <= 0 && ((a4 + 86 <= 0 && 3 == a2) || ((0 < a29 + 144 && 0 <= a0 + 44) && 3 == a2))) && a0 <= 599976)) || (a0 + 61 <= 0 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1)) || (5 == a2 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && 0 <= a29 + 127)) || ((((5 == a2 && a0 + 61 <= 0) && a4 + 42 <= 0) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((((a0 + 61 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || (((((((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0) && a4 + 89 <= 0) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || (a0 + 147 <= 0 && a4 + 86 <= 0)) || (((a4 + 42 <= 0 && ((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 5 == a2) && 4453 <= a29)) || ((((a4 + 86 <= 0 && !(6 == input)) && 5 == a2) && 4453 <= a29) && a0 <= 599976)) || ((((a4 + 42 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && 0 < a29 + 16) && a0 + 147 <= 0) && 4 == a2)) || ((a4 + 42 <= 0 && (((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && a0 + 242851 <= 0) && 5 == a2)) || (0 < a29 + 16 && ((a4 + 42 <= 0 && a29 <= 43) && (0 < a4 + 86 && 0 <= a0 + 146) && 3 == a2) && a0 + 61 <= 0)) || (((0 < a29 + 16 && a29 <= 42) && (a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599976)) || (((((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 2 == a2) && 0 <= a29 + 127) || ((a4 + 86 <= 0 && 2 == a2) && a29 + 144 <= 0)) && a0 <= 599976)) || ((a4 + 42 <= 0 && a2 == 1 && a0 + 147 <= 0) && 0 < a29 + 16)) || (((a0 + 242851 <= 0 && 0 <= a29 + 127) && a4 + 42 <= 0) && a2 == 1)) || (((((a0 + 242851 <= 0 && 0 <= a29 + 127) || a29 + 144 <= 0) && a4 + 42 <= 0) && 4 == a2) && (\exists v_~a0~0_830 : int :: (((v_~a0~0_830 <= 599920 && a0 <= (v_~a0~0_830 / 5 + -278887) / 5 + 1) && v_~a0~0_830 / 5 < 278887) && !((v_~a0~0_830 / 5 + 3) % 5 == 0)) && 0 <= v_~a0~0_830))) || (((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2) && a4 + 42 <= 0)) || (a0 <= 599976 && ((((a29 <= 43 || 25 * a29 + a0 <= 596270) && a4 + 86 <= 0 && 0 < a29 + 144) && 5 == a2) && (!(6 == input) || a29 <= 43)) && 0 < a29 + 16)) || ((0 < a29 + 16 && a4 + 42 <= 0 && (a2 == 1 && 0 < a4 + 86) && a29 <= 43) && a0 <= 599976)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && (0 < a4 + 86 && 0 <= a0 + 146) && 3 == a2)) || ((((a0 + 61 <= 0 && 4 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0) && 0 <= a0 + 97)) || ((((a29 <= 43 && 2 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127) && a4 + 42 <= 0)) || (a4 + 42 <= 0 && a0 + 147 <= 0 && 3 == a2)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599920)) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || ((((a4 + 86 <= 0 && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && a2 == 1) && 0 <= a0 + 97) && a0 + 44 <= 0)) || ((((a4 + 42 <= 0 && 0 <= a0 + 97) && a29 + 16 <= 0 && 0 < a29 + 144) && a0 + 61 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0) - InvariantResult [Line: 23]: Loop Invariant [2019-11-19 21:57:31,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((a4 + 86 <= 0 && 2 == a2) && 0 <= a29 + 127) && !(6 == input)) || ((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && ((a4 + 86 <= 0 && 3 == a2) || ((0 < a29 + 144 && 0 <= a0 + 44) && 3 == a2)))) && a0 <= 599976) || ((((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 2 == a2)) || ((0 < a29 + 16 && a4 + 86 <= 0 && ((a4 + 86 <= 0 && 3 == a2) || ((0 < a29 + 144 && 0 <= a0 + 44) && 3 == a2))) && a0 <= 599976)) || (a0 + 61 <= 0 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1)) || (5 == a2 && ((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && 0 <= a29 + 127)) || ((((5 == a2 && a0 + 61 <= 0) && a4 + 42 <= 0) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((((a0 + 61 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || (a0 + 147 <= 0 && a4 + 86 <= 0)) || (((a4 + 42 <= 0 && ((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 5 == a2) && 4453 <= a29)) || ((((a4 + 86 <= 0 && !(6 == input)) && 5 == a2) && 4453 <= a29) && a0 <= 599976)) || ((((a4 + 42 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 3 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127)) || (((a4 + 42 <= 0 && 0 < a29 + 16) && a0 + 147 <= 0) && 4 == a2)) || ((a4 + 42 <= 0 && (((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && a0 + 242851 <= 0) && 5 == a2)) || (0 < a29 + 16 && ((a4 + 42 <= 0 && a29 <= 43) && (0 < a4 + 86 && 0 <= a0 + 146) && 3 == a2) && a0 + 61 <= 0)) || (((((((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0) && a4 + 89 <= 0) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || (((0 < a29 + 16 && a29 <= 42) && (a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599976)) || (((((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 2 == a2) && 0 <= a29 + 127) || ((a4 + 86 <= 0 && 2 == a2) && a29 + 144 <= 0)) && a0 <= 599976)) || ((a4 + 42 <= 0 && a2 == 1 && a0 + 147 <= 0) && 0 < a29 + 16)) || (((a0 + 242851 <= 0 && 0 <= a29 + 127) && a4 + 42 <= 0) && a2 == 1)) || (((((a0 + 242851 <= 0 && 0 <= a29 + 127) || a29 + 144 <= 0) && a4 + 42 <= 0) && 4 == a2) && (\exists v_~a0~0_830 : int :: (((v_~a0~0_830 <= 599920 && a0 <= (v_~a0~0_830 / 5 + -278887) / 5 + 1) && v_~a0~0_830 / 5 < 278887) && !((v_~a0~0_830 / 5 + 3) % 5 == 0)) && 0 <= v_~a0~0_830))) || (((a0 + 98 <= 0 && 0 < a29 + 16) && 2 == a2) && a4 + 42 <= 0)) || (a0 <= 599976 && ((((a29 <= 43 || 25 * a29 + a0 <= 596270) && a4 + 86 <= 0 && 0 < a29 + 144) && 5 == a2) && (!(6 == input) || a29 <= 43)) && 0 < a29 + 16)) || ((0 < a29 + 16 && a4 + 42 <= 0 && (a2 == 1 && 0 < a4 + 86) && a29 <= 43) && a0 <= 599976)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && (0 < a4 + 86 && 0 <= a0 + 146) && 3 == a2)) || ((((a0 + 61 <= 0 && 4 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0) && 0 <= a0 + 97)) || ((((a29 <= 43 && 2 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127) && a4 + 42 <= 0)) || (a4 + 42 <= 0 && a0 + 147 <= 0 && 3 == a2)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599920)) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || ((((a4 + 86 <= 0 && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && a2 == 1) && 0 <= a0 + 97) && a0 + 44 <= 0)) || ((((a4 + 42 <= 0 && 0 <= a0 + 97) && a29 + 16 <= 0 && 0 < a29 + 144) && a0 + 61 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-19 21:57:31,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_830,QUANTIFIED] [2019-11-19 21:57:31,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] [2019-11-19 21:57:31,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_893,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((a0 + 242851 <= 0 && 0 <= a29 + 127) && a4 + 42 <= 0) && a2 == 1) || ((((a4 + 42 <= 0 && 3 == a2) && a0 + 61 <= 0) && a29 <= 43) && 0 <= a29 + 127)) || ((((a0 + 147 <= 0 && a4 + 42 <= 0) && !(1 == input)) && 0 < a29 + 16) && 4 == a2)) || ((((a4 + 86 <= 0 && 2 == a2) && a29 + 144 <= 0) || (((a4 + 86 <= 0 && a29 + 16 <= 0 && 0 < a29 + 144) && 2 == a2) && 0 <= a29 + 127)) && a0 <= 599976)) || ((((a4 + 86 <= 0 && 4 == a2) && a0 <= 599920) && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && 25 * a29 + a0 <= 596270)) || ((0 < a29 + 16 && a0 <= 599976) && ((a4 + 42 <= 0 && a2 == 1) && 0 < a4 + 86) && a29 <= 43)) || ((a4 + 42 <= 0 && 0 < a29 + 16) && a2 == 1 && a0 + 147 <= 0)) || (((0 < a29 + 16 && a29 <= 42) && (a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599976)) || ((((a4 + 89 <= 0 && ((a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1) && a0 + 44 <= 0) && 0 <= a0 + 44) && a29 + 127 <= 0) && 0 <= a29 + 127)) || (a0 <= 599976 && (((a4 + 86 <= 0 && 0 < a29 + 144) && ((!(6 == input) || 0 < a4 + 86) || a29 + 16 <= 0)) && 5 == a2) && 4453 <= a29)) || ((((5 == a2 && a0 + 61 <= 0) && a4 + 42 <= 0) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((((a0 + 98 <= 0 && 5 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0) && 0 <= a0 + 146)) || ((a4 + 42 <= 0 && (((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && a0 + 242851 <= 0) && 5 == a2)) || ((((a0 + 61 <= 0 && 4 == a2) && a4 + 42 <= 0) && 0 <= a0 + 97) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && 3 == a2)) || (((a4 + 86 <= 0 && 0 < a29 + 16) && 3 == a2) && a0 <= 599976)) || (a0 + 61 <= 0 && (a4 + 86 <= 0 && 0 < a29 + 144) && a2 == 1)) || ((((a0 + 61 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146) && a29 + 16 <= 0 && 0 < a29 + 144)) || ((a4 + 42 <= 0 && a0 + 147 <= 0) && 2 == a2)) || (((((a4 + 86 <= 0 && 2 == a2) && 0 <= a29 + 127) && !(6 == input)) || ((\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893) && a4 + 86 <= 0 && 3 == a2)) && a0 <= 599976)) || (((a4 + 86 <= 0 && 0 < a29 + 144) && 4 == a2) && a0 <= 599920)) || (((a0 + 98 <= 0 && 2 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0)) || ((((a0 + 61 <= 0 && 4 == a2) && 0 <= a29 + 127) && a4 + 42 <= 0) && 0 <= a0 + 97)) || ((((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 2 == a2)) || (a0 + 147 <= 0 && a4 + 86 <= 0)) || ((((a29 <= 43 && 2 == a2) && a0 + 61 <= 0) && 0 <= a29 + 127) && a4 + 42 <= 0)) || ((0 < a29 + 16 && a0 <= 599976) && (((!(6 == input) || 0 < a4 + 86) || a29 + 16 <= 0) && (a29 <= 43 || 25 * a29 + a0 <= 596270) && a4 + 86 <= 0 && 0 < a29 + 144) && 5 == a2)) || (((((((a29 + 16 <= 0 && 0 < a29 + 144) && a0 + 242851 <= 0) && 0 <= a29 + 127) || a29 + 144 <= 0) && a4 + 42 <= 0) && 4 == a2) && (\exists v_~a0~0_830 : int :: (((v_~a0~0_830 <= 599920 && a0 <= (v_~a0~0_830 / 5 + -278887) / 5 + 1) && v_~a0~0_830 / 5 < 278887) && !((v_~a0~0_830 / 5 + 3) % 5 == 0)) && 0 <= v_~a0~0_830))) || ((((a0 + 98 <= 0 && 0 < a4 + 86) && a4 + 42 <= 0) && a2 == 1) && 0 <= a0 + 146)) || ((((a4 + 86 <= 0 && (\exists v_~a29~0_893 : int :: (a29 + 300072 <= v_~a29~0_893 % 299928 && 43 < v_~a29~0_893) && 0 <= v_~a29~0_893)) && a2 == 1) && 0 <= a0 + 97) && a0 + 44 <= 0)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && ((0 < a29 + 144 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2)) && 5 == a2) && 4453 <= a29) - 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: 228.0s, OverallIterations: 29, TraceHistogramMax: 6, AutomataDifference: 110.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 48.2s, HoareTripleCheckerStatistics: 5586 SDtfs, 29844 SDslu, 2769 SDs, 0 SdLazy, 87351 SolverSat, 7307 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 85.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11392 GetRequests, 11113 SyntacticMatches, 46 SemanticMatches, 233 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1398 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24411occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.2s AutomataMinimizationTime, 29 MinimizatonAttempts, 90993 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 295 NumberOfFragments, 2875 HoareAnnotationTreeSize, 4 FomulaSimplifications, 216694997 FormulaSimplificationTreeSizeReduction, 9.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 178617731 FormulaSimplificationTreeSizeReductionInter, 39.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 38.3s InterpolantComputationTime, 29749 NumberOfCodeBlocks, 29749 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 29707 ConstructedInterpolants, 1118 QuantifiedInterpolants, 157868548 SizeOfPredicates, 13 NumberOfNonLiveVariables, 12728 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 42 InterpolantComputations, 25 PerfectInterpolantSequences, 37456/40679 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...