./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label01.c -s /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/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 03ab13ef0348e1ecfd1768bba293320ba0bb26c0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:56:36,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:56:36,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:56:36,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:56:36,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:56:36,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:56:36,086 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:56:36,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:56:36,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:56:36,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:56:36,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:56:36,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:56:36,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:56:36,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:56:36,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:56:36,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:56:36,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:56:36,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:56:36,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:56:36,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:56:36,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:56:36,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:56:36,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:56:36,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:56:36,115 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:56:36,116 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:56:36,116 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:56:36,117 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:56:36,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:56:36,119 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:56:36,119 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:56:36,120 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:56:36,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:56:36,122 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:56:36,123 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:56:36,124 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:56:36,124 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:56:36,125 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:56:36,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:56:36,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:56:36,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:56:36,128 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:56:36,145 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:56:36,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:56:36,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:56:36,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:56:36,149 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:56:36,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:56:36,150 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:56:36,150 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:56:36,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:56:36,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:56:36,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:56:36,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:56:36,153 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:56:36,153 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:56:36,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:56:36,154 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:56:36,154 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:56:36,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:56:36,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:56:36,155 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:56:36,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:56:36,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:56:36,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:56:36,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:56:36,157 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:56:36,157 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:56:36,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:56:36,158 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:56:36,158 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_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/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 -> 03ab13ef0348e1ecfd1768bba293320ba0bb26c0 [2019-11-15 23:56:36,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:56:36,242 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:56:36,249 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:56:36,252 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:56:36,252 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:56:36,253 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label01.c [2019-11-15 23:56:36,326 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/bin/uautomizer/data/8098a3538/f0b584c8b10b4031a75e840dde9474ed/FLAGfb7d5c1ae [2019-11-15 23:56:37,087 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:56:37,088 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/sv-benchmarks/c/eca-rers2012/Problem15_label01.c [2019-11-15 23:56:37,112 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/bin/uautomizer/data/8098a3538/f0b584c8b10b4031a75e840dde9474ed/FLAGfb7d5c1ae [2019-11-15 23:56:37,150 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/bin/uautomizer/data/8098a3538/f0b584c8b10b4031a75e840dde9474ed [2019-11-15 23:56:37,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:56:37,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:56:37,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:56:37,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:56:37,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:56:37,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:56:37" (1/1) ... [2019-11-15 23:56:37,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31514925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:37, skipping insertion in model container [2019-11-15 23:56:37,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:56:37" (1/1) ... [2019-11-15 23:56:37,171 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:56:37,248 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:56:38,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:56:38,217 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:56:38,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:56:38,581 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:56:38,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:38 WrapperNode [2019-11-15 23:56:38,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:56:38,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:56:38,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:56:38,584 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:56:38,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:38" (1/1) ... [2019-11-15 23:56:38,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:38" (1/1) ... [2019-11-15 23:56:38,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:56:38,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:56:38,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:56:38,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:56:38,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:38" (1/1) ... [2019-11-15 23:56:38,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:38" (1/1) ... [2019-11-15 23:56:38,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:38" (1/1) ... [2019-11-15 23:56:38,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:38" (1/1) ... [2019-11-15 23:56:38,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:38" (1/1) ... [2019-11-15 23:56:39,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:38" (1/1) ... [2019-11-15 23:56:39,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:38" (1/1) ... [2019-11-15 23:56:39,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:56:39,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:56:39,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:56:39,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:56:39,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:56:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:56:39,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:56:44,357 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:56:44,357 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 23:56:44,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:56:44 BoogieIcfgContainer [2019-11-15 23:56:44,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:56:44,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:56:44,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:56:44,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:56:44,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:56:37" (1/3) ... [2019-11-15 23:56:44,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39af3fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:56:44, skipping insertion in model container [2019-11-15 23:56:44,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:38" (2/3) ... [2019-11-15 23:56:44,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39af3fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:56:44, skipping insertion in model container [2019-11-15 23:56:44,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:56:44" (3/3) ... [2019-11-15 23:56:44,367 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label01.c [2019-11-15 23:56:44,378 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:56:44,387 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:56:44,400 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:56:44,447 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:56:44,447 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:56:44,447 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:56:44,448 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:56:44,448 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:56:44,448 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:56:44,448 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:56:44,449 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:56:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-15 23:56:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 23:56:44,498 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:44,499 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:44,501 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:44,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:44,507 INFO L82 PathProgramCache]: Analyzing trace with hash 626000386, now seen corresponding path program 1 times [2019-11-15 23:56:44,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:44,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996155433] [2019-11-15 23:56:44,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:44,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:44,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:44,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:44,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996155433] [2019-11-15 23:56:44,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:44,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:56:44,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301979747] [2019-11-15 23:56:44,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:44,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:44,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:44,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:44,890 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-15 23:56:51,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:51,029 INFO L93 Difference]: Finished difference Result 1470 states and 2719 transitions. [2019-11-15 23:56:51,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:51,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-15 23:56:51,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:51,060 INFO L225 Difference]: With dead ends: 1470 [2019-11-15 23:56:51,060 INFO L226 Difference]: Without dead ends: 978 [2019-11-15 23:56:51,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:51,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-11-15 23:56:51,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2019-11-15 23:56:51,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-11-15 23:56:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1472 transitions. [2019-11-15 23:56:51,185 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1472 transitions. Word has length 44 [2019-11-15 23:56:51,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:51,186 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 1472 transitions. [2019-11-15 23:56:51,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:51,187 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1472 transitions. [2019-11-15 23:56:51,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-15 23:56:51,199 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:51,200 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:51,200 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:51,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:51,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1760666973, now seen corresponding path program 1 times [2019-11-15 23:56:51,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:51,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626480853] [2019-11-15 23:56:51,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:51,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:51,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:51,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626480853] [2019-11-15 23:56:51,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:51,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:51,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456863959] [2019-11-15 23:56:51,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:56:51,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:51,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:56:51,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:51,550 INFO L87 Difference]: Start difference. First operand 976 states and 1472 transitions. Second operand 5 states. [2019-11-15 23:56:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:58,796 INFO L93 Difference]: Finished difference Result 3167 states and 4696 transitions. [2019-11-15 23:56:58,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:58,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-11-15 23:56:58,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:58,812 INFO L225 Difference]: With dead ends: 3167 [2019-11-15 23:56:58,813 INFO L226 Difference]: Without dead ends: 2193 [2019-11-15 23:56:58,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:58,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2019-11-15 23:56:58,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 1886. [2019-11-15 23:56:58,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2019-11-15 23:56:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2622 transitions. [2019-11-15 23:56:58,900 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2622 transitions. Word has length 109 [2019-11-15 23:56:58,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:58,903 INFO L462 AbstractCegarLoop]: Abstraction has 1886 states and 2622 transitions. [2019-11-15 23:56:58,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:56:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2622 transitions. [2019-11-15 23:56:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-15 23:56:58,908 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:58,908 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:56:58,909 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:58,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:58,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1367533996, now seen corresponding path program 1 times [2019-11-15 23:56:58,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:58,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734385590] [2019-11-15 23:56:58,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:58,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:58,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:59,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734385590] [2019-11-15 23:56:59,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:59,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:56:59,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096516366] [2019-11-15 23:56:59,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:59,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:59,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:59,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:59,137 INFO L87 Difference]: Start difference. First operand 1886 states and 2622 transitions. Second operand 4 states. [2019-11-15 23:57:02,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:02,541 INFO L93 Difference]: Finished difference Result 7067 states and 9932 transitions. [2019-11-15 23:57:02,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:57:02,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-15 23:57:02,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:02,576 INFO L225 Difference]: With dead ends: 7067 [2019-11-15 23:57:02,576 INFO L226 Difference]: Without dead ends: 5183 [2019-11-15 23:57:02,580 INFO L600 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-15 23:57:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5183 states. [2019-11-15 23:57:02,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5183 to 4878. [2019-11-15 23:57:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4878 states. [2019-11-15 23:57:02,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 6341 transitions. [2019-11-15 23:57:02,713 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 6341 transitions. Word has length 114 [2019-11-15 23:57:02,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:02,715 INFO L462 AbstractCegarLoop]: Abstraction has 4878 states and 6341 transitions. [2019-11-15 23:57:02,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:57:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 6341 transitions. [2019-11-15 23:57:02,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-15 23:57:02,717 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:02,717 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:57:02,718 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:02,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:02,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1300079150, now seen corresponding path program 1 times [2019-11-15 23:57:02,719 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:02,719 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121823502] [2019-11-15 23:57:02,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:02,719 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:02,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:02,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121823502] [2019-11-15 23:57:02,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638630335] [2019-11-15 23:57:02,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:03,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:57:03,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:03,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:57:03,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-11-15 23:57:03,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173737339] [2019-11-15 23:57:03,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:57:03,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:03,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:57:03,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:57:03,184 INFO L87 Difference]: Start difference. First operand 4878 states and 6341 transitions. Second operand 4 states. [2019-11-15 23:57:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:08,477 INFO L93 Difference]: Finished difference Result 14287 states and 18930 transitions. [2019-11-15 23:57:08,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:57:08,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-11-15 23:57:08,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:08,537 INFO L225 Difference]: With dead ends: 14287 [2019-11-15 23:57:08,537 INFO L226 Difference]: Without dead ends: 9411 [2019-11-15 23:57:08,545 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:57:08,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9411 states. [2019-11-15 23:57:08,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9411 to 9380. [2019-11-15 23:57:08,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9380 states. [2019-11-15 23:57:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9380 states to 9380 states and 11899 transitions. [2019-11-15 23:57:08,772 INFO L78 Accepts]: Start accepts. Automaton has 9380 states and 11899 transitions. Word has length 135 [2019-11-15 23:57:08,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:08,773 INFO L462 AbstractCegarLoop]: Abstraction has 9380 states and 11899 transitions. [2019-11-15 23:57:08,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:57:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand 9380 states and 11899 transitions. [2019-11-15 23:57:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-15 23:57:08,777 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:08,778 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 23:57:08,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:08,982 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:08,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:08,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2006286439, now seen corresponding path program 1 times [2019-11-15 23:57:08,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:08,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95760324] [2019-11-15 23:57:08,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:08,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:08,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:09,300 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 83 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 23:57:09,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95760324] [2019-11-15 23:57:09,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333881144] [2019-11-15 23:57:09,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:09,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:57:09,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:09,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:57:09,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-15 23:57:09,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047543939] [2019-11-15 23:57:09,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:57:09,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:09,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:57:09,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:57:09,518 INFO L87 Difference]: Start difference. First operand 9380 states and 11899 transitions. Second operand 3 states. [2019-11-15 23:57:11,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:11,518 INFO L93 Difference]: Finished difference Result 23540 states and 30243 transitions. [2019-11-15 23:57:11,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:57:11,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-11-15 23:57:11,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:11,591 INFO L225 Difference]: With dead ends: 23540 [2019-11-15 23:57:11,591 INFO L226 Difference]: Without dead ends: 14461 [2019-11-15 23:57:11,601 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:57:11,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14461 states. [2019-11-15 23:57:11,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14461 to 9376. [2019-11-15 23:57:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9376 states. [2019-11-15 23:57:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9376 states to 9376 states and 11687 transitions. [2019-11-15 23:57:11,856 INFO L78 Accepts]: Start accepts. Automaton has 9376 states and 11687 transitions. Word has length 214 [2019-11-15 23:57:11,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:11,856 INFO L462 AbstractCegarLoop]: Abstraction has 9376 states and 11687 transitions. [2019-11-15 23:57:11,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:57:11,857 INFO L276 IsEmpty]: Start isEmpty. Operand 9376 states and 11687 transitions. [2019-11-15 23:57:11,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-15 23:57:11,862 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:11,863 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:12,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:12,075 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:12,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:12,076 INFO L82 PathProgramCache]: Analyzing trace with hash -92208819, now seen corresponding path program 1 times [2019-11-15 23:57:12,076 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:12,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083051290] [2019-11-15 23:57:12,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:12,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:12,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-15 23:57:12,721 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083051290] [2019-11-15 23:57:12,721 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:12,722 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:57:12,722 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935046244] [2019-11-15 23:57:12,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:57:12,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:12,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:57:12,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:57:12,724 INFO L87 Difference]: Start difference. First operand 9376 states and 11687 transitions. Second operand 5 states. [2019-11-15 23:57:15,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:15,292 INFO L93 Difference]: Finished difference Result 20547 states and 25311 transitions. [2019-11-15 23:57:15,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:57:15,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 305 [2019-11-15 23:57:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:15,318 INFO L225 Difference]: With dead ends: 20547 [2019-11-15 23:57:15,319 INFO L226 Difference]: Without dead ends: 11173 [2019-11-15 23:57:15,330 INFO L600 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-15 23:57:15,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11173 states. [2019-11-15 23:57:15,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11173 to 10871. [2019-11-15 23:57:15,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10871 states. [2019-11-15 23:57:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10871 states to 10871 states and 13244 transitions. [2019-11-15 23:57:15,677 INFO L78 Accepts]: Start accepts. Automaton has 10871 states and 13244 transitions. Word has length 305 [2019-11-15 23:57:15,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:15,678 INFO L462 AbstractCegarLoop]: Abstraction has 10871 states and 13244 transitions. [2019-11-15 23:57:15,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:57:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 10871 states and 13244 transitions. [2019-11-15 23:57:15,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-11-15 23:57:15,688 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:15,689 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:15,690 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:15,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:15,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1024558271, now seen corresponding path program 1 times [2019-11-15 23:57:15,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:15,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259002053] [2019-11-15 23:57:15,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:15,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:15,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:16,086 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-15 23:57:16,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259002053] [2019-11-15 23:57:16,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:16,087 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:57:16,087 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583027350] [2019-11-15 23:57:16,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:57:16,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:16,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:57:16,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:57:16,089 INFO L87 Difference]: Start difference. First operand 10871 states and 13244 transitions. Second operand 4 states. [2019-11-15 23:57:20,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:20,357 INFO L93 Difference]: Finished difference Result 25031 states and 30699 transitions. [2019-11-15 23:57:20,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:57:20,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 390 [2019-11-15 23:57:20,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:20,388 INFO L225 Difference]: With dead ends: 25031 [2019-11-15 23:57:20,388 INFO L226 Difference]: Without dead ends: 14162 [2019-11-15 23:57:20,400 INFO L600 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-15 23:57:20,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14162 states. [2019-11-15 23:57:20,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14162 to 12665. [2019-11-15 23:57:20,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12665 states. [2019-11-15 23:57:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12665 states to 12665 states and 14798 transitions. [2019-11-15 23:57:20,786 INFO L78 Accepts]: Start accepts. Automaton has 12665 states and 14798 transitions. Word has length 390 [2019-11-15 23:57:20,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:20,787 INFO L462 AbstractCegarLoop]: Abstraction has 12665 states and 14798 transitions. [2019-11-15 23:57:20,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:57:20,787 INFO L276 IsEmpty]: Start isEmpty. Operand 12665 states and 14798 transitions. [2019-11-15 23:57:20,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-11-15 23:57:20,799 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:20,801 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:20,801 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:20,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:20,803 INFO L82 PathProgramCache]: Analyzing trace with hash -289447111, now seen corresponding path program 1 times [2019-11-15 23:57:20,803 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:20,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788465967] [2019-11-15 23:57:20,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:20,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:20,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:21,424 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 45 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:21,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788465967] [2019-11-15 23:57:21,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973675399] [2019-11-15 23:57:21,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:21,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:57:21,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:21,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:21,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:21,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:21,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:21,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:21,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:21,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:21,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:40,742 WARN L191 SmtUtils]: Spent 18.97 s on a formula simplification. DAG size of input: 56 DAG size of output: 26 [2019-11-15 23:57:41,929 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a29~0_894 Int)) (let ((.cse0 (div v_~a29~0_894 5))) (and (< .cse0 0) (not (= (mod .cse0 5) 0)) (<= (+ v_~a29~0_894 127) 0) (= (mod v_~a29~0_894 5) 0) (<= c_~a29~0 (+ (div .cse0 5) 4460))))) (exists ((v_prenex_1 Int)) (let ((.cse1 (div v_prenex_1 5))) (and (= (mod v_prenex_1 5) 0) (<= c_~a29~0 (+ (div .cse1 5) 4459)) (<= (+ v_prenex_1 127) 0) (= (mod .cse1 5) 0))))) is different from true [2019-11-15 23:57:42,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:42,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:57:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 105 not checked. [2019-11-15 23:57:43,405 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:57:43,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-15 23:57:43,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067981844] [2019-11-15 23:57:43,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:57:43,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:43,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:57:43,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=22, Unknown=1, NotChecked=10, Total=56 [2019-11-15 23:57:43,408 INFO L87 Difference]: Start difference. First operand 12665 states and 14798 transitions. Second operand 8 states. [2019-11-15 23:57:45,675 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_~a29~0_894 Int)) (let ((.cse3 (div v_~a29~0_894 5))) (and (< .cse3 0) (not (= (mod .cse3 5) 0)) (<= (+ v_~a29~0_894 127) 0) (= (mod v_~a29~0_894 5) 0) (<= c_~a29~0 (+ (div .cse3 5) 4460))))))) (and (or .cse0 (exists ((v_prenex_1 Int)) (let ((.cse1 (div v_prenex_1 5))) (and (= (mod v_prenex_1 5) 0) (<= c_~a29~0 (+ (div .cse1 5) 4459)) (<= (+ v_prenex_1 127) 0) (= (mod .cse1 5) 0))))) (or .cse0 (exists ((v_~a29~0_894 Int)) (let ((.cse2 (div v_~a29~0_894 5))) (and (<= (+ v_~a29~0_894 127) 0) (= (mod v_~a29~0_894 5) 0) (<= c_~a29~0 (+ (div .cse2 5) 4459)) (= (mod .cse2 5) 0))))))) is different from true [2019-11-15 23:57:56,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:56,195 INFO L93 Difference]: Finished difference Result 35267 states and 41876 transitions. [2019-11-15 23:57:56,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:57:56,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 391 [2019-11-15 23:57:56,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:56,223 INFO L225 Difference]: With dead ends: 35267 [2019-11-15 23:57:56,223 INFO L226 Difference]: Without dead ends: 22604 [2019-11-15 23:57:56,235 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 388 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=25, Invalid=23, Unknown=2, NotChecked=22, Total=72 [2019-11-15 23:57:56,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22604 states. [2019-11-15 23:57:56,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22604 to 17751. [2019-11-15 23:57:56,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17751 states. [2019-11-15 23:57:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17751 states to 17751 states and 21096 transitions. [2019-11-15 23:57:56,492 INFO L78 Accepts]: Start accepts. Automaton has 17751 states and 21096 transitions. Word has length 391 [2019-11-15 23:57:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:56,493 INFO L462 AbstractCegarLoop]: Abstraction has 17751 states and 21096 transitions. [2019-11-15 23:57:56,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:57:56,494 INFO L276 IsEmpty]: Start isEmpty. Operand 17751 states and 21096 transitions. [2019-11-15 23:57:56,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-11-15 23:57:56,506 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:56,507 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:56,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:57:56,711 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:56,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:56,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1505436081, now seen corresponding path program 1 times [2019-11-15 23:57:56,712 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:56,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804077304] [2019-11-15 23:57:56,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:56,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:56,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:57,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804077304] [2019-11-15 23:57:57,255 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:57,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:57:57,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419954059] [2019-11-15 23:57:57,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:57:57,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:57,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:57:57,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:57:57,261 INFO L87 Difference]: Start difference. First operand 17751 states and 21096 transitions. Second operand 4 states. [2019-11-15 23:58:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:00,472 INFO L93 Difference]: Finished difference Result 38793 states and 46339 transitions. [2019-11-15 23:58:00,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:58:00,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 445 [2019-11-15 23:58:00,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:58:00,499 INFO L225 Difference]: With dead ends: 38793 [2019-11-15 23:58:00,500 INFO L226 Difference]: Without dead ends: 21044 [2019-11-15 23:58:00,515 INFO L600 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-15 23:58:00,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21044 states. [2019-11-15 23:58:00,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21044 to 19842. [2019-11-15 23:58:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19842 states. [2019-11-15 23:58:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19842 states to 19842 states and 23112 transitions. [2019-11-15 23:58:00,774 INFO L78 Accepts]: Start accepts. Automaton has 19842 states and 23112 transitions. Word has length 445 [2019-11-15 23:58:00,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:58:00,775 INFO L462 AbstractCegarLoop]: Abstraction has 19842 states and 23112 transitions. [2019-11-15 23:58:00,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:58:00,775 INFO L276 IsEmpty]: Start isEmpty. Operand 19842 states and 23112 transitions. [2019-11-15 23:58:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-11-15 23:58:00,781 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:58:00,782 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:58:00,782 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:58:00,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:00,783 INFO L82 PathProgramCache]: Analyzing trace with hash -377920542, now seen corresponding path program 1 times [2019-11-15 23:58:00,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:00,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606845222] [2019-11-15 23:58:00,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:00,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:00,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:01,996 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 299 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-15 23:58:01,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606845222] [2019-11-15 23:58:01,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557821384] [2019-11-15 23:58:01,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:58:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:02,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:58:02,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:58:02,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:58:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 263 proven. 39 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-15 23:58:02,542 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:58:02,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-15 23:58:02,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812325353] [2019-11-15 23:58:02,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:58:02,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:58:02,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:58:02,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:58:02,545 INFO L87 Difference]: Start difference. First operand 19842 states and 23112 transitions. Second operand 9 states. [2019-11-15 23:58:10,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:10,244 INFO L93 Difference]: Finished difference Result 47064 states and 54313 transitions. [2019-11-15 23:58:10,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:58:10,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 447 [2019-11-15 23:58:10,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:58:10,269 INFO L225 Difference]: With dead ends: 47064 [2019-11-15 23:58:10,269 INFO L226 Difference]: Without dead ends: 19840 [2019-11-15 23:58:10,284 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 444 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:58:10,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19840 states. [2019-11-15 23:58:10,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19840 to 17446. [2019-11-15 23:58:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17446 states. [2019-11-15 23:58:10,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17446 states to 17446 states and 18768 transitions. [2019-11-15 23:58:10,525 INFO L78 Accepts]: Start accepts. Automaton has 17446 states and 18768 transitions. Word has length 447 [2019-11-15 23:58:10,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:58:10,526 INFO L462 AbstractCegarLoop]: Abstraction has 17446 states and 18768 transitions. [2019-11-15 23:58:10,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:58:10,526 INFO L276 IsEmpty]: Start isEmpty. Operand 17446 states and 18768 transitions. [2019-11-15 23:58:10,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2019-11-15 23:58:10,531 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:58:10,533 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:58:10,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:58:10,737 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:58:10,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:10,737 INFO L82 PathProgramCache]: Analyzing trace with hash 319650045, now seen corresponding path program 1 times [2019-11-15 23:58:10,738 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:10,738 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776934899] [2019-11-15 23:58:10,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:10,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:10,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 42 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:11,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776934899] [2019-11-15 23:58:11,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156515970] [2019-11-15 23:58:11,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:58:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:11,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:58:11,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:58:11,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:58:11,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:58:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 236 proven. 106 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-15 23:58:12,853 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:58:12,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 7 [2019-11-15 23:58:12,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667246301] [2019-11-15 23:58:12,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:58:12,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:58:12,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:58:12,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:58:12,856 INFO L87 Difference]: Start difference. First operand 17446 states and 18768 transitions. Second operand 8 states. [2019-11-15 23:59:25,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:25,501 INFO L93 Difference]: Finished difference Result 47525 states and 51034 transitions. [2019-11-15 23:59:25,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:59:25,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 498 [2019-11-15 23:59:25,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:25,526 INFO L225 Difference]: With dead ends: 47525 [2019-11-15 23:59:25,526 INFO L226 Difference]: Without dead ends: 29782 [2019-11-15 23:59:25,537 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:59:25,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29782 states. [2019-11-15 23:59:25,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29782 to 24633. [2019-11-15 23:59:25,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24633 states. [2019-11-15 23:59:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24633 states to 24633 states and 26473 transitions. [2019-11-15 23:59:25,814 INFO L78 Accepts]: Start accepts. Automaton has 24633 states and 26473 transitions. Word has length 498 [2019-11-15 23:59:25,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:25,815 INFO L462 AbstractCegarLoop]: Abstraction has 24633 states and 26473 transitions. [2019-11-15 23:59:25,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:59:25,815 INFO L276 IsEmpty]: Start isEmpty. Operand 24633 states and 26473 transitions. [2019-11-15 23:59:25,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2019-11-15 23:59:25,820 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:25,821 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:59:26,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:59:26,025 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:26,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:26,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1407121983, now seen corresponding path program 1 times [2019-11-15 23:59:26,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:26,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367752856] [2019-11-15 23:59:26,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:26,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:26,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 87 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:26,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367752856] [2019-11-15 23:59:26,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972044445] [2019-11-15 23:59:26,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:59:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:26,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:59:26,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:59:26,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:59:26,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:59:26,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:59:26,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:59:26,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:59:26,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:59:26,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:59:26,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:59:31,608 WARN L191 SmtUtils]: Spent 4.68 s on a formula simplification. DAG size of input: 56 DAG size of output: 24 [2019-11-15 23:59:31,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:59:31,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:59:31,880 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 31 [2019-11-15 23:59:31,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:59:31,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:59:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 125 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:33,307 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:59:33,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-11-15 23:59:33,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279537823] [2019-11-15 23:59:33,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:59:33,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:33,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:59:33,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:59:33,309 INFO L87 Difference]: Start difference. First operand 24633 states and 26473 transitions. Second operand 9 states. [2019-11-16 00:00:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:07,787 INFO L93 Difference]: Finished difference Result 59512 states and 63915 transitions. [2019-11-16 00:00:07,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:00:07,788 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 510 [2019-11-16 00:00:07,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:07,819 INFO L225 Difference]: With dead ends: 59512 [2019-11-16 00:00:07,819 INFO L226 Difference]: Without dead ends: 34582 [2019-11-16 00:00:07,835 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 507 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:00:07,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34582 states. [2019-11-16 00:00:08,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34582 to 26731. [2019-11-16 00:00:08,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26731 states. [2019-11-16 00:00:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26731 states to 26731 states and 28795 transitions. [2019-11-16 00:00:08,139 INFO L78 Accepts]: Start accepts. Automaton has 26731 states and 28795 transitions. Word has length 510 [2019-11-16 00:00:08,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:08,140 INFO L462 AbstractCegarLoop]: Abstraction has 26731 states and 28795 transitions. [2019-11-16 00:00:08,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:00:08,140 INFO L276 IsEmpty]: Start isEmpty. Operand 26731 states and 28795 transitions. [2019-11-16 00:00:08,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2019-11-16 00:00:08,148 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:08,149 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:00:08,353 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:00:08,354 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:08,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:08,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1741362260, now seen corresponding path program 1 times [2019-11-16 00:00:08,355 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:08,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240885500] [2019-11-16 00:00:08,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:08,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:08,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 390 proven. 132 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-16 00:00:09,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240885500] [2019-11-16 00:00:09,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346025500] [2019-11-16 00:00:09,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/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-16 00:00:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:10,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:00:10,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:00:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-16 00:00:10,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:00:10,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-16 00:00:10,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239231839] [2019-11-16 00:00:10,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:00:10,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:10,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:00:10,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:00:10,322 INFO L87 Difference]: Start difference. First operand 26731 states and 28795 transitions. Second operand 3 states. [2019-11-16 00:00:11,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:11,698 INFO L93 Difference]: Finished difference Result 53160 states and 57286 transitions. [2019-11-16 00:00:11,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:00:11,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 567 [2019-11-16 00:00:11,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:11,723 INFO L225 Difference]: With dead ends: 53160 [2019-11-16 00:00:11,723 INFO L226 Difference]: Without dead ends: 26730 [2019-11-16 00:00:11,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 568 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:00:11,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26730 states. [2019-11-16 00:00:11,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26730 to 26130. [2019-11-16 00:00:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26130 states. [2019-11-16 00:00:11,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26130 states to 26130 states and 27968 transitions. [2019-11-16 00:00:11,988 INFO L78 Accepts]: Start accepts. Automaton has 26130 states and 27968 transitions. Word has length 567 [2019-11-16 00:00:11,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:11,989 INFO L462 AbstractCegarLoop]: Abstraction has 26130 states and 27968 transitions. [2019-11-16 00:00:11,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:00:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 26130 states and 27968 transitions. [2019-11-16 00:00:11,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2019-11-16 00:00:11,996 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:11,996 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:00:12,197 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:00:12,197 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:12,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:12,198 INFO L82 PathProgramCache]: Analyzing trace with hash 588763416, now seen corresponding path program 1 times [2019-11-16 00:00:12,198 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:12,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292555252] [2019-11-16 00:00:12,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:12,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:12,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 190 proven. 131 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-11-16 00:00:13,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292555252] [2019-11-16 00:00:13,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15869480] [2019-11-16 00:00:13,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/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-16 00:00:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:14,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:00:14,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:00:14,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:00:14,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:00:14,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:00:14,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:00:14,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:00:14,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:00:14,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:14,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:24,140 WARN L191 SmtUtils]: Spent 9.52 s on a formula simplification. DAG size of input: 191 DAG size of output: 33 [2019-11-16 00:00:24,717 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 212 proven. 42 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2019-11-16 00:00:24,717 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:00:24,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-11-16 00:00:24,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515323139] [2019-11-16 00:00:24,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:00:24,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:24,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:00:24,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:00:24,720 INFO L87 Difference]: Start difference. First operand 26130 states and 27968 transitions. Second operand 11 states. [2019-11-16 00:00:51,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:51,785 INFO L93 Difference]: Finished difference Result 58241 states and 62238 transitions. [2019-11-16 00:00:51,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:00:51,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 626 [2019-11-16 00:00:51,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:51,814 INFO L225 Difference]: With dead ends: 58241 [2019-11-16 00:00:51,814 INFO L226 Difference]: Without dead ends: 32110 [2019-11-16 00:00:51,830 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 634 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:00:51,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32110 states. [2019-11-16 00:00:52,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32110 to 23131. [2019-11-16 00:00:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23131 states. [2019-11-16 00:00:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23131 states to 23131 states and 24329 transitions. [2019-11-16 00:00:52,113 INFO L78 Accepts]: Start accepts. Automaton has 23131 states and 24329 transitions. Word has length 626 [2019-11-16 00:00:52,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:52,114 INFO L462 AbstractCegarLoop]: Abstraction has 23131 states and 24329 transitions. [2019-11-16 00:00:52,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:00:52,115 INFO L276 IsEmpty]: Start isEmpty. Operand 23131 states and 24329 transitions. [2019-11-16 00:00:52,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2019-11-16 00:00:52,123 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:52,124 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2019-11-16 00:00:52,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:00:52,328 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:52,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:52,328 INFO L82 PathProgramCache]: Analyzing trace with hash -197045537, now seen corresponding path program 1 times [2019-11-16 00:00:52,328 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:52,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030188548] [2019-11-16 00:00:52,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:52,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:52,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2019-11-16 00:00:52,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030188548] [2019-11-16 00:00:52,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:52,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:00:52,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170231321] [2019-11-16 00:00:52,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:00:52,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:52,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:00:52,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:00:52,944 INFO L87 Difference]: Start difference. First operand 23131 states and 24329 transitions. Second operand 5 states. [2019-11-16 00:00:56,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:56,140 INFO L93 Difference]: Finished difference Result 55272 states and 58070 transitions. [2019-11-16 00:00:56,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:00:56,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 630 [2019-11-16 00:00:56,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:56,177 INFO L225 Difference]: With dead ends: 55272 [2019-11-16 00:00:56,177 INFO L226 Difference]: Without dead ends: 31844 [2019-11-16 00:00:56,189 INFO L600 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-16 00:00:56,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31844 states. [2019-11-16 00:00:56,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31844 to 23733. [2019-11-16 00:00:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23733 states. [2019-11-16 00:00:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23733 states to 23733 states and 24982 transitions. [2019-11-16 00:00:56,664 INFO L78 Accepts]: Start accepts. Automaton has 23733 states and 24982 transitions. Word has length 630 [2019-11-16 00:00:56,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:56,665 INFO L462 AbstractCegarLoop]: Abstraction has 23733 states and 24982 transitions. [2019-11-16 00:00:56,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:00:56,665 INFO L276 IsEmpty]: Start isEmpty. Operand 23733 states and 24982 transitions. [2019-11-16 00:00:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2019-11-16 00:00:56,670 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:56,671 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:00:56,671 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:56,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:56,671 INFO L82 PathProgramCache]: Analyzing trace with hash -623330870, now seen corresponding path program 1 times [2019-11-16 00:00:56,671 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:56,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164614528] [2019-11-16 00:00:56,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:56,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:56,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-11-16 00:00:57,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164614528] [2019-11-16 00:00:57,227 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:57,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:00:57,228 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903241240] [2019-11-16 00:00:57,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:00:57,229 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:57,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:00:57,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:00:57,229 INFO L87 Difference]: Start difference. First operand 23733 states and 24982 transitions. Second operand 3 states. [2019-11-16 00:00:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:58,873 INFO L93 Difference]: Finished difference Result 51065 states and 53778 transitions. [2019-11-16 00:00:58,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:00:58,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 632 [2019-11-16 00:00:58,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:58,900 INFO L225 Difference]: With dead ends: 51065 [2019-11-16 00:00:58,901 INFO L226 Difference]: Without dead ends: 27035 [2019-11-16 00:00:58,911 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:00:58,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27035 states. [2019-11-16 00:00:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27035 to 27025. [2019-11-16 00:00:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27025 states. [2019-11-16 00:00:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27025 states to 27025 states and 28227 transitions. [2019-11-16 00:00:59,186 INFO L78 Accepts]: Start accepts. Automaton has 27025 states and 28227 transitions. Word has length 632 [2019-11-16 00:00:59,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:59,187 INFO L462 AbstractCegarLoop]: Abstraction has 27025 states and 28227 transitions. [2019-11-16 00:00:59,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:00:59,188 INFO L276 IsEmpty]: Start isEmpty. Operand 27025 states and 28227 transitions. [2019-11-16 00:00:59,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2019-11-16 00:00:59,196 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:00:59,196 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:00:59,197 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:00:59,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:00:59,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1435228887, now seen corresponding path program 1 times [2019-11-16 00:00:59,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:00:59,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912658878] [2019-11-16 00:00:59,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:59,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:00:59,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:00:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:00:59,789 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2019-11-16 00:00:59,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912658878] [2019-11-16 00:00:59,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:59,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:00:59,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104008052] [2019-11-16 00:00:59,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:00:59,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:00:59,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:00:59,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:00:59,791 INFO L87 Difference]: Start difference. First operand 27025 states and 28227 transitions. Second operand 3 states. [2019-11-16 00:01:01,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:01,146 INFO L93 Difference]: Finished difference Result 56140 states and 58626 transitions. [2019-11-16 00:01:01,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:01:01,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 684 [2019-11-16 00:01:01,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:01,191 INFO L225 Difference]: With dead ends: 56140 [2019-11-16 00:01:01,192 INFO L226 Difference]: Without dead ends: 29117 [2019-11-16 00:01:01,203 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:01:01,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29117 states. [2019-11-16 00:01:01,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29117 to 26725. [2019-11-16 00:01:01,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26725 states. [2019-11-16 00:01:01,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26725 states to 26725 states and 27904 transitions. [2019-11-16 00:01:01,480 INFO L78 Accepts]: Start accepts. Automaton has 26725 states and 27904 transitions. Word has length 684 [2019-11-16 00:01:01,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:01,480 INFO L462 AbstractCegarLoop]: Abstraction has 26725 states and 27904 transitions. [2019-11-16 00:01:01,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:01:01,481 INFO L276 IsEmpty]: Start isEmpty. Operand 26725 states and 27904 transitions. [2019-11-16 00:01:01,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2019-11-16 00:01:01,492 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:01,492 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:01:01,493 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:01,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:01,493 INFO L82 PathProgramCache]: Analyzing trace with hash -749809954, now seen corresponding path program 1 times [2019-11-16 00:01:01,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:01,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842760049] [2019-11-16 00:01:01,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:01,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:01,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 334 proven. 412 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-16 00:01:03,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842760049] [2019-11-16 00:01:03,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655462744] [2019-11-16 00:01:03,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/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-16 00:01:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:03,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:01:03,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:03,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:01:03,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:03,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:03,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:03,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:03,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:03,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:04,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:04,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:05,210 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 557 proven. 119 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-16 00:01:05,211 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:01:05,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-11-16 00:01:05,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456136368] [2019-11-16 00:01:05,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:01:05,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:05,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:01:05,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:01:05,214 INFO L87 Difference]: Start difference. First operand 26725 states and 27904 transitions. Second operand 16 states. [2019-11-16 00:01:48,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:48,309 INFO L93 Difference]: Finished difference Result 66939 states and 69750 transitions. [2019-11-16 00:01:48,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-11-16 00:01:48,309 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 732 [2019-11-16 00:01:48,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:48,341 INFO L225 Difference]: With dead ends: 66939 [2019-11-16 00:01:48,341 INFO L226 Difference]: Without dead ends: 39612 [2019-11-16 00:01:48,350 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 838 GetRequests, 772 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=839, Invalid=2821, Unknown=0, NotChecked=0, Total=3660 [2019-11-16 00:01:48,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39612 states. [2019-11-16 00:01:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39612 to 22827. [2019-11-16 00:01:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22827 states. [2019-11-16 00:01:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22827 states to 22827 states and 23816 transitions. [2019-11-16 00:01:48,646 INFO L78 Accepts]: Start accepts. Automaton has 22827 states and 23816 transitions. Word has length 732 [2019-11-16 00:01:48,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:48,646 INFO L462 AbstractCegarLoop]: Abstraction has 22827 states and 23816 transitions. [2019-11-16 00:01:48,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:01:48,646 INFO L276 IsEmpty]: Start isEmpty. Operand 22827 states and 23816 transitions. [2019-11-16 00:01:48,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2019-11-16 00:01:48,658 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:48,659 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:01:48,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:48,861 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:48,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:48,862 INFO L82 PathProgramCache]: Analyzing trace with hash 578201737, now seen corresponding path program 1 times [2019-11-16 00:01:48,862 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:48,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31352734] [2019-11-16 00:01:48,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:48,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:48,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-11-16 00:01:49,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31352734] [2019-11-16 00:01:49,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:49,497 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:01:49,497 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119108401] [2019-11-16 00:01:49,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:01:49,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:49,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:01:49,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:01:49,499 INFO L87 Difference]: Start difference. First operand 22827 states and 23816 transitions. Second operand 3 states. [2019-11-16 00:01:50,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:50,781 INFO L93 Difference]: Finished difference Result 45949 states and 47941 transitions. [2019-11-16 00:01:50,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:01:50,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 758 [2019-11-16 00:01:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:50,800 INFO L225 Difference]: With dead ends: 45949 [2019-11-16 00:01:50,801 INFO L226 Difference]: Without dead ends: 23124 [2019-11-16 00:01:50,809 INFO L600 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-16 00:01:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23124 states. [2019-11-16 00:01:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23124 to 22825. [2019-11-16 00:01:51,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22825 states. [2019-11-16 00:01:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22825 states to 22825 states and 23812 transitions. [2019-11-16 00:01:51,051 INFO L78 Accepts]: Start accepts. Automaton has 22825 states and 23812 transitions. Word has length 758 [2019-11-16 00:01:51,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:51,051 INFO L462 AbstractCegarLoop]: Abstraction has 22825 states and 23812 transitions. [2019-11-16 00:01:51,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:01:51,052 INFO L276 IsEmpty]: Start isEmpty. Operand 22825 states and 23812 transitions. [2019-11-16 00:01:51,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 805 [2019-11-16 00:01:51,065 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:51,066 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:01:51,066 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:51,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:51,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1706100167, now seen corresponding path program 1 times [2019-11-16 00:01:51,067 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:51,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958977704] [2019-11-16 00:01:51,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:51,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:51,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 757 proven. 163 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-16 00:01:52,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958977704] [2019-11-16 00:01:52,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419730967] [2019-11-16 00:01:52,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/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-16 00:01:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:52,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:01:52,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:01:52,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:52,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:01:53,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2019-11-16 00:01:53,631 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:01:53,631 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2019-11-16 00:01:53,631 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827894028] [2019-11-16 00:01:53,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:01:53,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:53,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:01:53,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:01:53,633 INFO L87 Difference]: Start difference. First operand 22825 states and 23812 transitions. Second operand 3 states. [2019-11-16 00:01:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:55,019 INFO L93 Difference]: Finished difference Result 49847 states and 52054 transitions. [2019-11-16 00:01:55,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:01:55,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 804 [2019-11-16 00:01:55,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:55,049 INFO L225 Difference]: With dead ends: 49847 [2019-11-16 00:01:55,049 INFO L226 Difference]: Without dead ends: 27024 [2019-11-16 00:01:55,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 804 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:01:55,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27024 states. [2019-11-16 00:01:55,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27024 to 24324. [2019-11-16 00:01:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24324 states. [2019-11-16 00:01:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24324 states to 24324 states and 25219 transitions. [2019-11-16 00:01:55,311 INFO L78 Accepts]: Start accepts. Automaton has 24324 states and 25219 transitions. Word has length 804 [2019-11-16 00:01:55,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:55,312 INFO L462 AbstractCegarLoop]: Abstraction has 24324 states and 25219 transitions. [2019-11-16 00:01:55,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:01:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 24324 states and 25219 transitions. [2019-11-16 00:01:55,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2019-11-16 00:01:55,327 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:55,328 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:01:55,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:01:55,532 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:55,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:55,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1858402503, now seen corresponding path program 1 times [2019-11-16 00:01:55,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:55,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510032373] [2019-11-16 00:01:55,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:55,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:55,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-11-16 00:01:56,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510032373] [2019-11-16 00:01:56,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:56,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:01:56,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962797092] [2019-11-16 00:01:56,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:01:56,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:56,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:01:56,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:01:56,249 INFO L87 Difference]: Start difference. First operand 24324 states and 25219 transitions. Second operand 3 states. [2019-11-16 00:01:57,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:01:57,343 INFO L93 Difference]: Finished difference Result 41111 states and 42625 transitions. [2019-11-16 00:01:57,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:01:57,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 840 [2019-11-16 00:01:57,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:01:57,357 INFO L225 Difference]: With dead ends: 41111 [2019-11-16 00:01:57,357 INFO L226 Difference]: Without dead ends: 16789 [2019-11-16 00:01:57,366 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:01:57,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16789 states. [2019-11-16 00:01:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16789 to 14696. [2019-11-16 00:01:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14696 states. [2019-11-16 00:01:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14696 states to 14696 states and 15050 transitions. [2019-11-16 00:01:57,534 INFO L78 Accepts]: Start accepts. Automaton has 14696 states and 15050 transitions. Word has length 840 [2019-11-16 00:01:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:01:57,535 INFO L462 AbstractCegarLoop]: Abstraction has 14696 states and 15050 transitions. [2019-11-16 00:01:57,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:01:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand 14696 states and 15050 transitions. [2019-11-16 00:01:57,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 967 [2019-11-16 00:01:57,552 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:01:57,552 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:01:57,553 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:01:57,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:01:57,553 INFO L82 PathProgramCache]: Analyzing trace with hash 798112884, now seen corresponding path program 1 times [2019-11-16 00:01:57,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:01:57,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858615786] [2019-11-16 00:01:57,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:57,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:01:57,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:01:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:01:58,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1581 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2019-11-16 00:01:58,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858615786] [2019-11-16 00:01:58,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:01:58,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:01:58,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860139121] [2019-11-16 00:01:58,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:01:58,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:01:58,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:01:58,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:01:58,851 INFO L87 Difference]: Start difference. First operand 14696 states and 15050 transitions. Second operand 5 states. [2019-11-16 00:02:01,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:01,049 INFO L93 Difference]: Finished difference Result 17099 states and 17500 transitions. [2019-11-16 00:02:01,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:02:01,052 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 966 [2019-11-16 00:02:01,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:01,053 INFO L225 Difference]: With dead ends: 17099 [2019-11-16 00:02:01,053 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:02:01,057 INFO L600 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-16 00:02:01,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:02:01,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:02:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:02:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:02:01,059 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 966 [2019-11-16 00:02:01,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:01,059 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:02:01,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:02:01,060 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:02:01,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:02:01,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:02:03,284 WARN L191 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 1060 DAG size of output: 829 [2019-11-16 00:02:04,669 WARN L191 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 1046 DAG size of output: 783 [2019-11-16 00:02:05,741 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 785 DAG size of output: 643 [2019-11-16 00:03:04,526 WARN L191 SmtUtils]: Spent 58.77 s on a formula simplification. DAG size of input: 778 DAG size of output: 163 [2019-11-16 00:03:48,599 WARN L191 SmtUtils]: Spent 44.07 s on a formula simplification. DAG size of input: 723 DAG size of output: 161 [2019-11-16 00:04:10,452 WARN L191 SmtUtils]: Spent 21.85 s on a formula simplification. DAG size of input: 608 DAG size of output: 158 [2019-11-16 00:04:10,454 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,454 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,454 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,454 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,455 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-16 00:04:10,455 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,455 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,455 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,455 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,455 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,455 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,455 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-16 00:04:10,455 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,455 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,455 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,455 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-16 00:04:10,455 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,455 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,455 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-16 00:04:10,455 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,456 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,456 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,456 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,456 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,456 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,456 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-16 00:04:10,456 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,456 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,456 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,456 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,456 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-16 00:04:10,456 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-16 00:04:10,456 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,456 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,456 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,456 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,456 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-16 00:04:10,457 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-16 00:04:10,457 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,457 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,457 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,457 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,457 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,457 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-16 00:04:10,457 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,457 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-16 00:04:10,457 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-16 00:04:10,457 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-16 00:04:10,457 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-16 00:04:10,457 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,457 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,457 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,457 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,458 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,458 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-16 00:04:10,458 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,458 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,458 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-16 00:04:10,458 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,458 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-16 00:04:10,458 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,458 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,458 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,458 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-16 00:04:10,460 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,460 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-16 00:04:10,460 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-16 00:04:10,460 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-16 00:04:10,460 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-16 00:04:10,460 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-16 00:04:10,460 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-16 00:04:10,461 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,461 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,461 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,461 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,461 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-16 00:04:10,461 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-16 00:04:10,461 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,461 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-16 00:04:10,461 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,461 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,461 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,461 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,461 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,461 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,461 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-16 00:04:10,461 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:04:10,462 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,462 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,462 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,462 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,462 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,462 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-16 00:04:10,462 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-16 00:04:10,462 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,462 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-16 00:04:10,462 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-16 00:04:10,462 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-16 00:04:10,462 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,462 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-16 00:04:10,462 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-16 00:04:10,462 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,462 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,463 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,463 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,463 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-16 00:04:10,463 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-16 00:04:10,463 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,463 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,464 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,464 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-16 00:04:10,464 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-16 00:04:10,464 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,464 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-16 00:04:10,464 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,464 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,464 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,464 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,464 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,464 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,464 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-16 00:04:10,464 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,464 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,465 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-16 00:04:10,465 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,465 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,465 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,465 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,465 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-16 00:04:10,465 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,465 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,465 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,466 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,466 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,466 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-16 00:04:10,466 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,466 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,466 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,466 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,466 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-16 00:04:10,467 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,467 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,467 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,467 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-16 00:04:10,467 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-16 00:04:10,467 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,467 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,468 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-16 00:04:10,468 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,468 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2019-11-16 00:04:10,468 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,468 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,468 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,468 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,469 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-16 00:04:10,469 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,469 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,469 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,469 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,469 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,469 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-16 00:04:10,469 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,470 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,470 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-16 00:04:10,470 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,470 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-16 00:04:10,470 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-16 00:04:10,470 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,470 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,471 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,471 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,471 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,471 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-16 00:04:10,471 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-16 00:04:10,471 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,471 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-16 00:04:10,471 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:04:10,472 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-16 00:04:10,472 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,472 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,472 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,472 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,472 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,472 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-16 00:04:10,473 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-16 00:04:10,473 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-16 00:04:10,473 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-16 00:04:10,473 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,473 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,473 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,473 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-16 00:04:10,473 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-16 00:04:10,474 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,474 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-16 00:04:10,474 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,474 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,474 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,474 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,474 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-16 00:04:10,475 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-16 00:04:10,475 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-16 00:04:10,475 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,475 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-16 00:04:10,475 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,475 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,475 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,476 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,476 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,476 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,476 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,476 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,476 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-16 00:04:10,476 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-16 00:04:10,476 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-16 00:04:10,477 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-16 00:04:10,477 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,477 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,477 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,477 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,478 INFO L439 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse21 (+ ~a4~0 86)) (.cse26 (+ ~a0~0 147)) (.cse25 (= 1 ~a2~0))) (let ((.cse2 (not (= ~a2~0 3))) (.cse20 (not .cse25)) (.cse22 (+ ~a29~0 127)) (.cse15 (< 0 .cse26)) (.cse11 (<= 0 (+ ~a0~0 44))) (.cse12 (<= .cse21 0)) (.cse9 (= ~a2~0 1)) (.cse14 (<= (+ ~a29~0 16) 0))) (let ((.cse17 (< 0 (+ ~a29~0 144))) (.cse13 (or (and .cse12 .cse9 .cse15) (and .cse9 .cse11) (and .cse12 .cse9 .cse14))) (.cse19 (<= ~a29~0 599997)) (.cse4 (<= 0 .cse22)) (.cse7 (or (and .cse12 .cse2 .cse20) (and (and .cse2 .cse11) .cse20))) (.cse5 (<= 3 ~a2~0)) (.cse8 (< 43 ~a29~0)) (.cse3 (exists ((v_~a29~0_903 Int)) (and (< 43 v_~a29~0_903) (<= ~a29~0 (+ (mod v_~a29~0_903 299978) 300021)) (<= 0 v_~a29~0_903)))) (.cse23 (= 3 ~a2~0)) (.cse16 (<= (+ ~a0~0 61) 0)) (.cse0 (<= (+ ~a0~0 98) 0)) (.cse6 (= 2 ~a2~0)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse18 (<= ~a29~0 599999)) (.cse10 (or (<= (+ ~a29~0 (* 5 ~a0~0)) 599238) (<= .cse26 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse3) (and .cse1 (and (and .cse7 (<= ~a29~0 96178) .cse4) .cse5)) (and .cse0 .cse8 .cse9 .cse1 .cse10 .cse3) (and .cse11 (and .cse12 .cse13 .cse14 .cse4)) (and .cse0 .cse1 .cse15 .cse2 .cse8 .cse5) (and .cse0 .cse15 (<= (+ ~a29~0 56603) 0) .cse1 .cse5) (and .cse14 .cse16 .cse1 .cse9 .cse17) (and .cse0 .cse1 .cse14 .cse17 .cse5) (and .cse13 .cse16) (and (= 4 ~a2~0) .cse0 .cse1 .cse18) (and (<= (+ ~a0~0 366640) 0) .cse1 .cse5 .cse19) (and .cse12 .cse20 .cse16) (and .cse0 (or (and .cse10 .cse3 .cse6 .cse8) (and .cse6 .cse8 .cse19))) (and .cse0 .cse1 (and .cse9 .cse15 .cse14)) (and .cse1 (and (< 0 .cse21) (<= ~a29~0 43) .cse4 .cse9)) (or (and .cse1 (and .cse3 (and .cse7 .cse6))) (and .cse12 (<= (+ ~a29~0 145526) 0) .cse20 (<= ~a2~0 3))) (and .cse12 (<= .cse22 0) .cse5 (<= ~a2~0 4)) (and (and .cse12 .cse16) .cse8) (and .cse0 .cse1 .cse10 .cse3 .cse23) (and .cse12 .cse3 .cse23) (and .cse1 (and (exists ((v_prenex_2 Int)) (let ((.cse24 (div v_prenex_2 5))) (and (<= ~a29~0 (+ (div (+ .cse24 (- 403018)) 5) 1)) (< .cse24 403019) (<= (+ v_prenex_2 144) 0) (not (= (mod (+ .cse24 2) 5) 0)) (< v_prenex_2 0) (< .cse24 403018) (not (= (mod (+ .cse24 1) 5) 0)) (not (= 0 (mod v_prenex_2 5)))))) (and .cse25 .cse15 .cse16))) (and .cse0 .cse6 .cse1 .cse18 .cse10))))) [2019-11-16 00:04:10,478 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-16 00:04:10,478 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-16 00:04:10,478 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,479 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,479 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,479 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,479 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,479 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,479 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,479 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-16 00:04:10,480 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,480 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-16 00:04:10,480 INFO L446 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-16 00:04:10,480 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,480 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-16 00:04:10,480 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-16 00:04:10,480 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-16 00:04:10,480 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-16 00:04:10,481 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,481 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,481 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,481 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,481 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,481 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-16 00:04:10,481 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-16 00:04:10,482 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,482 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-16 00:04:10,482 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-16 00:04:10,482 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,482 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,482 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,483 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,483 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,483 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,483 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse26 (+ ~a29~0 144)) (.cse18 (+ ~a4~0 86)) (.cse28 (+ ~a0~0 147)) (.cse24 (= 1 ~a2~0))) (let ((.cse10 (+ ~a29~0 127)) (.cse2 (not (= ~a2~0 3))) (.cse25 (not .cse24)) (.cse16 (< 0 .cse28)) (.cse27 (<= 0 (+ ~a0~0 44))) (.cse6 (<= .cse18 0)) (.cse17 (= ~a2~0 1)) (.cse19 (<= (+ ~a29~0 16) 0)) (.cse20 (< 0 .cse26))) (let ((.cse15 (<= ~a29~0 599997)) (.cse11 (= 4 ~a2~0)) (.cse8 (<= (+ ~a0~0 61) 0)) (.cse21 (or (and .cse6 .cse17 .cse16) (and .cse17 .cse27) (and .cse6 .cse17 .cse19 .cse20))) (.cse7 (= 3 ~a2~0)) (.cse12 (or (and .cse6 .cse2 .cse25) (and (and .cse2 .cse27) .cse25))) (.cse4 (<= 0 .cse10)) (.cse5 (<= 3 ~a2~0)) (.cse9 (< 43 ~a29~0)) (.cse3 (exists ((v_~a29~0_903 Int)) (and (< 43 v_~a29~0_903) (<= ~a29~0 (+ (mod v_~a29~0_903 299978) 300021)) (<= 0 v_~a29~0_903)))) (.cse0 (<= (+ ~a0~0 98) 0)) (.cse13 (= 2 ~a2~0)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse22 (<= ~a29~0 599999)) (.cse14 (or (<= (+ ~a29~0 (* 5 ~a0~0)) 599238) (<= .cse28 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse3 .cse7) (and (and .cse6 .cse8) .cse9) (and .cse6 (<= .cse10 0) .cse11) (or (and .cse6 (<= (+ ~a29~0 145526) 0) (<= ~a2~0 3)) (and .cse1 (and .cse3 (and .cse12 .cse13)))) (and (or (and .cse14 .cse3 .cse13 .cse9) (and .cse13 .cse9 .cse15)) .cse0) (and (<= (+ ~a0~0 366640) 0) .cse1 .cse5 .cse15) (and .cse0 .cse16 (<= (+ ~a29~0 56603) 0) .cse1 .cse5) (and .cse1 (and (and .cse17 (<= ~a29~0 43) .cse4) (< 0 .cse18))) (and .cse0 .cse1 (and .cse17 .cse16 .cse19)) (and .cse19 .cse8 .cse1 .cse17 .cse20) (and .cse21 .cse8) (and .cse11 .cse0 .cse1 .cse22) (and .cse19 (and .cse0 .cse1 (and .cse20 .cse5))) (and .cse1 (and (exists ((v_prenex_2 Int)) (let ((.cse23 (div v_prenex_2 5))) (and (<= ~a29~0 (+ (div (+ .cse23 (- 403018)) 5) 1)) (< .cse23 403019) (<= (+ v_prenex_2 144) 0) (not (= (mod (+ .cse23 2) 5) 0)) (< v_prenex_2 0) (< .cse23 403018) (not (= (mod (+ .cse23 1) 5) 0)) (not (= 0 (mod v_prenex_2 5)))))) (and .cse24 .cse16 .cse8))) (and .cse0 .cse1 .cse16 .cse2 .cse5 .cse9) (and .cse6 .cse25 .cse8) (and .cse6 .cse17 (<= .cse26 0)) (and (and (and .cse6 .cse21 .cse4) .cse27) .cse19) (and .cse0 .cse1 .cse14 .cse3 .cse7) (and .cse1 (and (and .cse12 (<= ~a29~0 96178) .cse4) .cse5)) (and .cse0 .cse13 .cse1 .cse3) (and .cse0 .cse9 .cse1 .cse17 .cse14 .cse3) (and .cse0 .cse13 .cse1 .cse22 .cse14))))) [2019-11-16 00:04:10,484 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,484 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-16 00:04:10,484 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-16 00:04:10,484 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,484 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,484 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,484 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,485 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,485 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,485 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-16 00:04:10,485 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-16 00:04:10,485 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,485 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,485 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-16 00:04:10,486 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,486 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,486 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,486 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,486 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,486 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,486 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-16 00:04:10,487 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-16 00:04:10,487 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,487 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,487 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,487 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,487 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,487 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,487 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:04:10,488 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-16 00:04:10,488 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,488 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-16 00:04:10,488 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,488 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,488 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,488 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,488 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,489 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,489 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,489 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-16 00:04:10,489 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-16 00:04:10,489 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,489 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,489 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,490 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,490 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,490 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,490 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,490 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-16 00:04:10,490 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-16 00:04:10,490 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,490 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,491 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,491 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,491 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,491 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,491 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,491 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-16 00:04:10,491 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-16 00:04:10,491 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,492 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-16 00:04:10,492 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-16 00:04:10,492 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,492 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,492 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,492 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,492 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,492 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,493 INFO L439 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse7 (+ ~a4~0 86)) (.cse27 (+ ~a0~0 147)) (.cse22 (= 1 ~a2~0))) (let ((.cse2 (not (= ~a2~0 3))) (.cse23 (not .cse22)) (.cse24 (+ ~a29~0 144)) (.cse16 (< 0 .cse27)) (.cse11 (<= 0 (+ ~a0~0 44))) (.cse12 (<= .cse7 0)) (.cse8 (= ~a2~0 1)) (.cse14 (<= (+ ~a29~0 16) 0)) (.cse25 (+ ~a29~0 127))) (let ((.cse4 (<= 0 .cse25)) (.cse13 (or (and .cse12 .cse8 .cse16) (and .cse8 .cse11) (and .cse12 .cse8 .cse14))) (.cse18 (< 0 .cse24)) (.cse15 (<= ~a29~0 599997)) (.cse9 (< 43 ~a29~0)) (.cse17 (<= (+ ~a0~0 61) 0)) (.cse5 (<= 3 ~a2~0)) (.cse6 (or (and .cse12 .cse2 .cse23) (and (and .cse2 .cse11) .cse23))) (.cse26 (= 3 ~a2~0)) (.cse3 (exists ((v_~a29~0_903 Int)) (and (< 43 v_~a29~0_903) (<= ~a29~0 (+ (mod v_~a29~0_903 299978) 300021)) (<= 0 v_~a29~0_903)))) (.cse0 (<= (+ ~a0~0 98) 0)) (.cse20 (= 2 ~a2~0)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse19 (<= ~a29~0 599999)) (.cse10 (or (<= (+ ~a29~0 (* 5 ~a0~0)) 599238) (<= .cse27 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 (and (and .cse6 (<= ~a29~0 96178) .cse4) .cse5)) (and (< 0 .cse7) (<= ~a29~0 43) .cse4 .cse1 .cse8) (and .cse0 .cse9 .cse8 .cse1 .cse10 .cse3) (and .cse11 (and .cse12 .cse13 .cse14 .cse4)) (and (<= (+ ~a0~0 366640) 0) .cse1 .cse5 .cse15) (and .cse0 .cse16 (<= (+ ~a29~0 56603) 0) .cse1 .cse5) (and .cse14 .cse17 .cse1 .cse8 .cse18) (and (and .cse12 .cse17) .cse9) (and .cse13 .cse17) (and (= 4 ~a2~0) .cse0 .cse1 .cse19) (and .cse14 (and .cse0 .cse1 (and .cse18 .cse5))) (and (or (and .cse10 .cse3 .cse20 .cse9) (and .cse20 .cse9 .cse15)) .cse0) (and .cse1 (and (exists ((v_prenex_2 Int)) (let ((.cse21 (div v_prenex_2 5))) (and (<= ~a29~0 (+ (div (+ .cse21 (- 403018)) 5) 1)) (< .cse21 403019) (<= (+ v_prenex_2 144) 0) (not (= (mod (+ .cse21 2) 5) 0)) (< v_prenex_2 0) (< .cse21 403018) (not (= (mod (+ .cse21 1) 5) 0)) (not (= 0 (mod v_prenex_2 5)))))) (and .cse22 .cse16 .cse17))) (and .cse0 .cse1 .cse16 .cse2 .cse5 .cse9) (and .cse12 .cse23 .cse17) (and .cse12 .cse8 (<= .cse24 0)) (and .cse12 (<= .cse25 0) .cse5 (<= ~a2~0 4)) (and .cse0 .cse1 (and .cse8 .cse16 .cse14)) (or (and (and .cse3 (and .cse6 .cse20)) .cse1) (and .cse12 (<= (+ ~a29~0 145526) 0) (<= ~a2~0 3))) (and .cse0 .cse1 .cse10 .cse3 .cse26) (and .cse12 .cse3 .cse26) (and .cse0 .cse20 .cse1 .cse3) (and .cse0 .cse20 .cse1 .cse19 .cse10))))) [2019-11-16 00:04:10,493 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-16 00:04:10,493 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-16 00:04:10,494 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,494 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,494 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,494 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,494 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,494 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,494 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,494 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,495 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-16 00:04:10,495 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-16 00:04:10,495 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,495 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-16 00:04:10,495 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-16 00:04:10,495 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,495 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,496 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,496 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,496 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,496 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-16 00:04:10,496 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-16 00:04:10,496 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,496 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,496 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,497 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,497 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-16 00:04:10,497 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-16 00:04:10,497 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-16 00:04:10,497 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,497 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-16 00:04:10,497 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-16 00:04:10,497 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,498 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,498 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,498 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,498 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,498 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,498 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,498 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-16 00:04:10,499 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-16 00:04:10,499 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,499 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,499 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,499 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-16 00:04:10,499 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,499 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:04:10,499 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,500 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-16 00:04:10,500 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,500 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,500 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,500 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,500 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,500 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,500 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,501 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-16 00:04:10,501 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-16 00:04:10,501 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,501 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-16 00:04:10,501 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,501 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,501 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,501 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-16 00:04:10,502 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,502 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,502 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,502 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,502 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-16 00:04:10,502 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,502 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,503 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-16 00:04:10,503 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-16 00:04:10,503 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,503 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,503 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,503 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-16 00:04:10,503 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,503 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,504 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,504 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,504 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,504 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-16 00:04:10,504 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,504 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,504 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-16 00:04:10,504 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-16 00:04:10,505 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,505 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:04:10,505 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-16 00:04:10,505 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,505 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-16 00:04:10,505 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,505 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-16 00:04:10,505 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-16 00:04:10,506 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,506 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,506 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-16 00:04:10,506 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-16 00:04:10,506 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-16 00:04:10,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,525 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,525 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,525 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,525 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,558 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,559 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,560 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,562 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,562 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,563 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,563 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,563 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,563 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,566 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,566 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,568 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,587 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,588 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,589 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,590 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,590 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,590 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,590 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,590 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,591 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,591 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,591 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,591 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,592 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,592 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,592 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,592 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,594 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,596 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,596 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,596 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,597 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,598 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,604 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,604 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,605 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,606 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,606 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,606 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,610 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,611 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,611 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,611 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,611 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,612 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:04:10 BoogieIcfgContainer [2019-11-16 00:04:10,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:04:10,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:04:10,616 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:04:10,616 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:04:10,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:56:44" (3/4) ... [2019-11-16 00:04:10,620 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:04:10,653 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-16 00:04:10,665 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:04:10,702 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(a2 == 3)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 0 <= a29 + 127) && 3 <= a2) || ((a4 + 86 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && 43 < a29)) || ((a4 + 86 <= 0 && a29 + 127 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && a29 + 145526 <= 0) && a2 <= 3) || (a4 + 42 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903) && (((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && 2 == a2)) || ((((((a29 + 5 * a0 <= 599238 || a0 + 147 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && 43 < a29) || ((2 == a2 && 43 < a29) && a29 <= 599997)) && a0 + 98 <= 0)) || (((a0 + 366640 <= 0 && a4 + 42 <= 0) && 3 <= a2) && a29 <= 599997)) || ((((a0 + 98 <= 0 && 0 < a0 + 147) && a29 + 56603 <= 0) && a4 + 42 <= 0) && 3 <= a2)) || (a4 + 42 <= 0 && ((a2 == 1 && a29 <= 43) && 0 <= a29 + 127) && 0 < a4 + 86)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && (a2 == 1 && 0 < a0 + 147) && a29 + 16 <= 0)) || ((((a29 + 16 <= 0 && a0 + 61 <= 0) && a4 + 42 <= 0) && a2 == 1) && 0 < a29 + 144)) || (((((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44)) || (((a4 + 86 <= 0 && a2 == 1) && a29 + 16 <= 0) && 0 < a29 + 144)) && a0 + 61 <= 0)) || (((4 == a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a29 <= 599999)) || (a29 + 16 <= 0 && (a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 144 && 3 <= a2)) || (a4 + 42 <= 0 && (\exists v_prenex_2 : int :: ((((((a29 <= (v_prenex_2 / 5 + -403018) / 5 + 1 && v_prenex_2 / 5 < 403019) && v_prenex_2 + 144 <= 0) && !((v_prenex_2 / 5 + 2) % 5 == 0)) && v_prenex_2 < 0) && v_prenex_2 / 5 < 403018) && !((v_prenex_2 / 5 + 1) % 5 == 0)) && !(0 == v_prenex_2 % 5)) && (1 == a2 && 0 < a0 + 147) && a0 + 61 <= 0)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && !(a2 == 3)) && 3 <= a2) && 43 < a29)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((((a4 + 86 <= 0 && ((((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44)) || (((a4 + 86 <= 0 && a2 == 1) && a29 + 16 <= 0) && 0 < a29 + 144))) && 0 <= a29 + 127) && 0 <= a0 + 44) && a29 + 16 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || (a4 + 42 <= 0 && (((((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && a29 <= 96178) && 0 <= a29 + 127) && 3 <= a2)) || (((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || (((((a0 + 98 <= 0 && 43 < a29) && a4 + 42 <= 0) && a2 == 1) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || ((((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && a29 <= 599999) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) [2019-11-16 00:04:10,707 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(a2 == 3)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 0 <= a29 + 127) && 3 <= a2) || (a4 + 42 <= 0 && (((((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && a29 <= 96178) && 0 <= a29 + 127) && 3 <= a2)) || ((((0 < a4 + 86 && a29 <= 43) && 0 <= a29 + 127) && a4 + 42 <= 0) && a2 == 1)) || (((((a0 + 98 <= 0 && 43 < a29) && a2 == 1) && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || (0 <= a0 + 44 && ((a4 + 86 <= 0 && ((((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 16 <= 0))) && a29 + 16 <= 0) && 0 <= a29 + 127)) || (((a0 + 366640 <= 0 && a4 + 42 <= 0) && 3 <= a2) && a29 <= 599997)) || ((((a0 + 98 <= 0 && 0 < a0 + 147) && a29 + 56603 <= 0) && a4 + 42 <= 0) && 3 <= a2)) || ((((a29 + 16 <= 0 && a0 + 61 <= 0) && a4 + 42 <= 0) && a2 == 1) && 0 < a29 + 144)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && 43 < a29)) || (((((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 16 <= 0)) && a0 + 61 <= 0)) || (((4 == a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a29 <= 599999)) || (a29 + 16 <= 0 && (a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 144 && 3 <= a2)) || ((((((a29 + 5 * a0 <= 599238 || a0 + 147 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && 43 < a29) || ((2 == a2 && 43 < a29) && a29 <= 599997)) && a0 + 98 <= 0)) || (a4 + 42 <= 0 && (\exists v_prenex_2 : int :: ((((((a29 <= (v_prenex_2 / 5 + -403018) / 5 + 1 && v_prenex_2 / 5 < 403019) && v_prenex_2 + 144 <= 0) && !((v_prenex_2 / 5 + 2) % 5 == 0)) && v_prenex_2 < 0) && v_prenex_2 / 5 < 403018) && !((v_prenex_2 / 5 + 1) % 5 == 0)) && !(0 == v_prenex_2 % 5)) && (1 == a2 && 0 < a0 + 147) && a0 + 61 <= 0)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && !(a2 == 3)) && 3 <= a2) && 43 < a29)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || (((a4 + 86 <= 0 && a29 + 127 <= 0) && 3 <= a2) && a2 <= 4)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && (a2 == 1 && 0 < a0 + 147) && a29 + 16 <= 0)) || (((\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903) && (((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && 2 == a2) && a4 + 42 <= 0) || ((a4 + 86 <= 0 && a29 + 145526 <= 0) && a2 <= 3)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || (((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || ((((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && a29 <= 599999) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) [2019-11-16 00:04:10,721 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(a2 == 3)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 0 <= a29 + 127) && 3 <= a2) || (((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || (a4 + 42 <= 0 && (((((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && a29 <= 96178) && 0 <= a29 + 127) && 3 <= a2)) || (((((a0 + 98 <= 0 && 43 < a29) && a2 == 1) && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || (0 <= a0 + 44 && ((a4 + 86 <= 0 && ((((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 16 <= 0))) && a29 + 16 <= 0) && 0 <= a29 + 127)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && !(a2 == 3)) && 43 < a29) && 3 <= a2)) || ((((a0 + 98 <= 0 && 0 < a0 + 147) && a29 + 56603 <= 0) && a4 + 42 <= 0) && 3 <= a2)) || ((((a29 + 16 <= 0 && a0 + 61 <= 0) && a4 + 42 <= 0) && a2 == 1) && 0 < a29 + 144)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 <= a2)) || (((((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 16 <= 0)) && a0 + 61 <= 0)) || (((4 == a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a29 <= 599999)) || (((a0 + 366640 <= 0 && a4 + 42 <= 0) && 3 <= a2) && a29 <= 599997)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || (a0 + 98 <= 0 && (((((a29 + 5 * a0 <= 599238 || a0 + 147 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && 43 < a29) || ((2 == a2 && 43 < a29) && a29 <= 599997)))) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && (a2 == 1 && 0 < a0 + 147) && a29 + 16 <= 0)) || (a4 + 42 <= 0 && ((0 < a4 + 86 && a29 <= 43) && 0 <= a29 + 127) && a2 == 1)) || (a4 + 42 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903) && (((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && 2 == a2) || (((a4 + 86 <= 0 && a29 + 145526 <= 0) && !(1 == a2)) && a2 <= 3)) || (((a4 + 86 <= 0 && a29 + 127 <= 0) && 3 <= a2) && a2 <= 4)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && 43 < a29)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || (a4 + 42 <= 0 && (\exists v_prenex_2 : int :: ((((((a29 <= (v_prenex_2 / 5 + -403018) / 5 + 1 && v_prenex_2 / 5 < 403019) && v_prenex_2 + 144 <= 0) && !((v_prenex_2 / 5 + 2) % 5 == 0)) && v_prenex_2 < 0) && v_prenex_2 / 5 < 403018) && !((v_prenex_2 / 5 + 1) % 5 == 0)) && !(0 == v_prenex_2 % 5)) && (1 == a2 && 0 < a0 + 147) && a0 + 61 <= 0)) || ((((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && a29 <= 599999) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) [2019-11-16 00:04:10,929 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_73d4a7e2-cb5a-40f5-80bd-f55fd332084e/bin/uautomizer/witness.graphml [2019-11-16 00:04:10,929 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:04:10,930 INFO L168 Benchmark]: Toolchain (without parser) took 453776.53 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 944.8 MB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 516.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:10,931 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:04:10,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1427.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -134.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:10,931 INFO L168 Benchmark]: Boogie Procedure Inliner took 257.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:10,932 INFO L168 Benchmark]: Boogie Preprocessor took 298.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:10,932 INFO L168 Benchmark]: RCFGBuilder took 5218.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 117.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -103.5 MB). Peak memory consumption was 215.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:10,933 INFO L168 Benchmark]: TraceAbstraction took 446255.21 ms. Allocated memory was 1.3 GB in the beginning and 4.5 GB in the end (delta: 3.2 GB). Free memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-11-16 00:04:10,933 INFO L168 Benchmark]: Witness Printer took 313.84 ms. Allocated memory is still 4.5 GB. Free memory was 3.9 GB in the beginning and 3.9 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:10,935 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.35 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1427.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -134.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 257.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 298.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5218.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 117.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -103.5 MB). Peak memory consumption was 215.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 446255.21 ms. Allocated memory was 1.3 GB in the beginning and 4.5 GB in the end (delta: 3.2 GB). Free memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 313.84 ms. Allocated memory is still 4.5 GB. Free memory was 3.9 GB in the beginning and 3.9 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 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_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 139]: 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-16 00:04:10,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,970 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(a2 == 3)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 0 <= a29 + 127) && 3 <= a2) || ((a4 + 86 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && 43 < a29)) || ((a4 + 86 <= 0 && a29 + 127 <= 0) && 4 == a2)) || ((a4 + 86 <= 0 && a29 + 145526 <= 0) && a2 <= 3) || (a4 + 42 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903) && (((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && 2 == a2)) || ((((((a29 + 5 * a0 <= 599238 || a0 + 147 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && 43 < a29) || ((2 == a2 && 43 < a29) && a29 <= 599997)) && a0 + 98 <= 0)) || (((a0 + 366640 <= 0 && a4 + 42 <= 0) && 3 <= a2) && a29 <= 599997)) || ((((a0 + 98 <= 0 && 0 < a0 + 147) && a29 + 56603 <= 0) && a4 + 42 <= 0) && 3 <= a2)) || (a4 + 42 <= 0 && ((a2 == 1 && a29 <= 43) && 0 <= a29 + 127) && 0 < a4 + 86)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && (a2 == 1 && 0 < a0 + 147) && a29 + 16 <= 0)) || ((((a29 + 16 <= 0 && a0 + 61 <= 0) && a4 + 42 <= 0) && a2 == 1) && 0 < a29 + 144)) || (((((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44)) || (((a4 + 86 <= 0 && a2 == 1) && a29 + 16 <= 0) && 0 < a29 + 144)) && a0 + 61 <= 0)) || (((4 == a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a29 <= 599999)) || (a29 + 16 <= 0 && (a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 144 && 3 <= a2)) || (a4 + 42 <= 0 && (\exists v_prenex_2 : int :: ((((((a29 <= (v_prenex_2 / 5 + -403018) / 5 + 1 && v_prenex_2 / 5 < 403019) && v_prenex_2 + 144 <= 0) && !((v_prenex_2 / 5 + 2) % 5 == 0)) && v_prenex_2 < 0) && v_prenex_2 / 5 < 403018) && !((v_prenex_2 / 5 + 1) % 5 == 0)) && !(0 == v_prenex_2 % 5)) && (1 == a2 && 0 < a0 + 147) && a0 + 61 <= 0)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && !(a2 == 3)) && 3 <= a2) && 43 < a29)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((((a4 + 86 <= 0 && ((((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44)) || (((a4 + 86 <= 0 && a2 == 1) && a29 + 16 <= 0) && 0 < a29 + 144))) && 0 <= a29 + 127) && 0 <= a0 + 44) && a29 + 16 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || (a4 + 42 <= 0 && (((((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && a29 <= 96178) && 0 <= a29 + 127) && 3 <= a2)) || (((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || (((((a0 + 98 <= 0 && 43 < a29) && a4 + 42 <= 0) && a2 == 1) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || ((((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && a29 <= 599999) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) - InvariantResult [Line: 23]: Loop Invariant [2019-11-16 00:04:10,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,980 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,980 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,980 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,980 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,981 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,982 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,986 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,989 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,993 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,995 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,995 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,995 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,996 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,996 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:10,996 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,999 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,999 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,999 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:10,999 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,000 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,000 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,000 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,000 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,000 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,001 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,001 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,001 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,001 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,001 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,002 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(a2 == 3)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 0 <= a29 + 127) && 3 <= a2) || (a4 + 42 <= 0 && (((((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && a29 <= 96178) && 0 <= a29 + 127) && 3 <= a2)) || ((((0 < a4 + 86 && a29 <= 43) && 0 <= a29 + 127) && a4 + 42 <= 0) && a2 == 1)) || (((((a0 + 98 <= 0 && 43 < a29) && a2 == 1) && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || (0 <= a0 + 44 && ((a4 + 86 <= 0 && ((((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 16 <= 0))) && a29 + 16 <= 0) && 0 <= a29 + 127)) || (((a0 + 366640 <= 0 && a4 + 42 <= 0) && 3 <= a2) && a29 <= 599997)) || ((((a0 + 98 <= 0 && 0 < a0 + 147) && a29 + 56603 <= 0) && a4 + 42 <= 0) && 3 <= a2)) || ((((a29 + 16 <= 0 && a0 + 61 <= 0) && a4 + 42 <= 0) && a2 == 1) && 0 < a29 + 144)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && 43 < a29)) || (((((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 16 <= 0)) && a0 + 61 <= 0)) || (((4 == a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a29 <= 599999)) || (a29 + 16 <= 0 && (a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 144 && 3 <= a2)) || ((((((a29 + 5 * a0 <= 599238 || a0 + 147 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && 43 < a29) || ((2 == a2 && 43 < a29) && a29 <= 599997)) && a0 + 98 <= 0)) || (a4 + 42 <= 0 && (\exists v_prenex_2 : int :: ((((((a29 <= (v_prenex_2 / 5 + -403018) / 5 + 1 && v_prenex_2 / 5 < 403019) && v_prenex_2 + 144 <= 0) && !((v_prenex_2 / 5 + 2) % 5 == 0)) && v_prenex_2 < 0) && v_prenex_2 / 5 < 403018) && !((v_prenex_2 / 5 + 1) % 5 == 0)) && !(0 == v_prenex_2 % 5)) && (1 == a2 && 0 < a0 + 147) && a0 + 61 <= 0)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && !(a2 == 3)) && 3 <= a2) && 43 < a29)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || (((a4 + 86 <= 0 && a29 + 127 <= 0) && 3 <= a2) && a2 <= 4)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && (a2 == 1 && 0 < a0 + 147) && a29 + 16 <= 0)) || (((\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903) && (((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && 2 == a2) && a4 + 42 <= 0) || ((a4 + 86 <= 0 && a29 + 145526 <= 0) && a2 <= 3)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || (((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || ((((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && a29 <= 599999) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-16 00:04:11,003 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,003 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,006 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,006 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,006 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,006 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,007 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,007 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,007 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,007 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,007 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,008 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,008 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,008 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,008 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,008 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:11,009 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:11,009 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:11,009 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:11,009 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:11,009 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:11,010 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:11,010 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:11,012 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,012 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,012 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,013 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,013 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,013 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,015 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,015 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,015 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,015 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,016 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,016 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,016 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,016 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,016 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_903,QUANTIFIED] [2019-11-16 00:04:11,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:11,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:11,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:11,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:11,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:11,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:11,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:04:11,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(a2 == 3)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 0 <= a29 + 127) && 3 <= a2) || (((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || (a4 + 42 <= 0 && (((((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && a29 <= 96178) && 0 <= a29 + 127) && 3 <= a2)) || (((((a0 + 98 <= 0 && 43 < a29) && a2 == 1) && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903))) || (0 <= a0 + 44 && ((a4 + 86 <= 0 && ((((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 16 <= 0))) && a29 + 16 <= 0) && 0 <= a29 + 127)) || (((((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a0 + 147) && !(a2 == 3)) && 43 < a29) && 3 <= a2)) || ((((a0 + 98 <= 0 && 0 < a0 + 147) && a29 + 56603 <= 0) && a4 + 42 <= 0) && 3 <= a2)) || ((((a29 + 16 <= 0 && a0 + 61 <= 0) && a4 + 42 <= 0) && a2 == 1) && 0 < a29 + 144)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 + 16 <= 0) && 0 < a29 + 144) && 3 <= a2)) || (((((a4 + 86 <= 0 && a2 == 1) && 0 < a0 + 147) || (a2 == 1 && 0 <= a0 + 44)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 16 <= 0)) && a0 + 61 <= 0)) || (((4 == a2 && a0 + 98 <= 0) && a4 + 42 <= 0) && a29 <= 599999)) || (((a0 + 366640 <= 0 && a4 + 42 <= 0) && 3 <= a2) && a29 <= 599997)) || ((a4 + 86 <= 0 && !(1 == a2)) && a0 + 61 <= 0)) || (a0 + 98 <= 0 && (((((a29 + 5 * a0 <= 599238 || a0 + 147 <= 0) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 2 == a2) && 43 < a29) || ((2 == a2 && 43 < a29) && a29 <= 599997)))) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && (a2 == 1 && 0 < a0 + 147) && a29 + 16 <= 0)) || (a4 + 42 <= 0 && ((0 < a4 + 86 && a29 <= 43) && 0 <= a29 + 127) && a2 == 1)) || (a4 + 42 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903) && (((a4 + 86 <= 0 && !(a2 == 3)) && !(1 == a2)) || ((!(a2 == 3) && 0 <= a0 + 44) && !(1 == a2))) && 2 == a2) || (((a4 + 86 <= 0 && a29 + 145526 <= 0) && !(1 == a2)) && a2 <= 3)) || (((a4 + 86 <= 0 && a29 + 127 <= 0) && 3 <= a2) && a2 <= 4)) || ((a4 + 86 <= 0 && a0 + 61 <= 0) && 43 < a29)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || ((a4 + 86 <= 0 && (\exists v_~a29~0_903 : int :: (43 < v_~a29~0_903 && a29 <= v_~a29~0_903 % 299978 + 300021) && 0 <= v_~a29~0_903)) && 3 == a2)) || (a4 + 42 <= 0 && (\exists v_prenex_2 : int :: ((((((a29 <= (v_prenex_2 / 5 + -403018) / 5 + 1 && v_prenex_2 / 5 < 403019) && v_prenex_2 + 144 <= 0) && !((v_prenex_2 / 5 + 2) % 5 == 0)) && v_prenex_2 < 0) && v_prenex_2 / 5 < 403018) && !((v_prenex_2 / 5 + 1) % 5 == 0)) && !(0 == v_prenex_2 % 5)) && (1 == a2 && 0 < a0 + 147) && a0 + 61 <= 0)) || ((((a0 + 98 <= 0 && 2 == a2) && a4 + 42 <= 0) && a29 <= 599999) && (a29 + 5 * a0 <= 599238 || a0 + 147 <= 0)) - 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: 446.0s, OverallIterations: 22, TraceHistogramMax: 6, AutomataDifference: 246.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 129.3s, HoareTripleCheckerStatistics: 4681 SDtfs, 28927 SDslu, 2205 SDs, 0 SdLazy, 68657 SolverSat, 8299 SolverUnsat, 56 SolverUnknown, 0 SolverNotchecked, 220.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5169 GetRequests, 4983 SyntacticMatches, 35 SemanticMatches, 151 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 41.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27025occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 70947 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 294 NumberOfFragments, 2415 HoareAnnotationTreeSize, 4 FomulaSimplifications, 2285405 FormulaSimplificationTreeSizeReduction, 4.6s HoareSimplificationTime, 4 FomulaSimplificationsInter, 522259 FormulaSimplificationTreeSizeReductionInter, 124.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 49.5s InterpolantComputationTime, 15765 NumberOfCodeBlocks, 15765 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 15733 ConstructedInterpolants, 517 QuantifiedInterpolants, 38134049 SizeOfPredicates, 9 NumberOfNonLiveVariables, 5946 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 32 InterpolantComputations, 16 PerfectInterpolantSequences, 12657/14950 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! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...