./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label22.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_10cfbad8-6f49-4430-8e19-b0b8c39433e1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_10cfbad8-6f49-4430-8e19-b0b8c39433e1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_10cfbad8-6f49-4430-8e19-b0b8c39433e1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_10cfbad8-6f49-4430-8e19-b0b8c39433e1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label22.c -s /tmp/vcloud-vcloud-master/worker/run_dir_10cfbad8-6f49-4430-8e19-b0b8c39433e1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_10cfbad8-6f49-4430-8e19-b0b8c39433e1/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 201bb8edf1558ee8c2befb91c86634486acb774b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 00:45:54,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:45:54,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:45:54,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:45:54,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:45:54,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:45:54,247 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:45:54,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:45:54,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:45:54,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:45:54,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:45:54,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:45:54,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:45:54,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:45:54,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:45:54,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:45:54,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:45:54,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:45:54,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:45:54,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:45:54,267 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:45:54,268 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:45:54,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:45:54,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:45:54,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:45:54,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:45:54,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:45:54,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:45:54,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:45:54,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:45:54,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:45:54,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:45:54,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:45:54,279 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:45:54,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:45:54,280 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:45:54,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:45:54,281 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:45:54,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:45:54,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:45:54,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:45:54,290 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_10cfbad8-6f49-4430-8e19-b0b8c39433e1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 00:45:54,309 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:45:54,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:45:54,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:45:54,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:45:54,311 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:45:54,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:45:54,312 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:45:54,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:45:54,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:45:54,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:45:54,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:45:54,314 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:45:54,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:45:54,314 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:45:54,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:45:54,315 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:45:54,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:45:54,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:45:54,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:45:54,316 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:45:54,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:45:54,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:45:54,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:45:54,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:45:54,317 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:45:54,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:45:54,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:45:54,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:45:54,318 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_10cfbad8-6f49-4430-8e19-b0b8c39433e1/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 -> 201bb8edf1558ee8c2befb91c86634486acb774b [2019-11-20 00:45:54,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:45:54,563 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:45:54,566 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:45:54,568 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:45:54,568 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:45:54,569 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_10cfbad8-6f49-4430-8e19-b0b8c39433e1/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label22.c [2019-11-20 00:45:54,634 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_10cfbad8-6f49-4430-8e19-b0b8c39433e1/bin/uautomizer/data/2e7d32cd2/9c6e4d2b39bd430b9fb416048698c71a/FLAG69b312a68 [2019-11-20 00:45:55,268 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:45:55,271 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_10cfbad8-6f49-4430-8e19-b0b8c39433e1/sv-benchmarks/c/eca-rers2012/Problem11_label22.c [2019-11-20 00:45:55,289 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_10cfbad8-6f49-4430-8e19-b0b8c39433e1/bin/uautomizer/data/2e7d32cd2/9c6e4d2b39bd430b9fb416048698c71a/FLAG69b312a68 [2019-11-20 00:45:55,437 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_10cfbad8-6f49-4430-8e19-b0b8c39433e1/bin/uautomizer/data/2e7d32cd2/9c6e4d2b39bd430b9fb416048698c71a [2019-11-20 00:45:55,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:45:55,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:45:55,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:45:55,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:45:55,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:45:55,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:45:55" (1/1) ... [2019-11-20 00:45:55,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14cbc577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:55, skipping insertion in model container [2019-11-20 00:45:55,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:45:55" (1/1) ... [2019-11-20 00:45:55,458 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:45:55,536 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:45:56,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:45:56,235 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:45:56,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:45:56,518 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:45:56,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:56 WrapperNode [2019-11-20 00:45:56,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:45:56,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:45:56,521 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:45:56,521 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:45:56,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:56" (1/1) ... [2019-11-20 00:45:56,570 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:56" (1/1) ... [2019-11-20 00:45:56,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:45:56,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:45:56,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:45:56,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:45:56,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:56" (1/1) ... [2019-11-20 00:45:56,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:56" (1/1) ... [2019-11-20 00:45:56,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:56" (1/1) ... [2019-11-20 00:45:56,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:56" (1/1) ... [2019-11-20 00:45:56,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:56" (1/1) ... [2019-11-20 00:45:56,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:56" (1/1) ... [2019-11-20 00:45:56,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:56" (1/1) ... [2019-11-20 00:45:56,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:45:56,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:45:56,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:45:56,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:45:56,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10cfbad8-6f49-4430-8e19-b0b8c39433e1/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-20 00:45:56,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:45:56,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:45:59,250 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:45:59,250 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 00:45:59,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:45:59 BoogieIcfgContainer [2019-11-20 00:45:59,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:45:59,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:45:59,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:45:59,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:45:59,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:45:55" (1/3) ... [2019-11-20 00:45:59,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5474cd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:45:59, skipping insertion in model container [2019-11-20 00:45:59,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:45:56" (2/3) ... [2019-11-20 00:45:59,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5474cd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:45:59, skipping insertion in model container [2019-11-20 00:45:59,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:45:59" (3/3) ... [2019-11-20 00:45:59,259 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label22.c [2019-11-20 00:45:59,268 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:45:59,275 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:45:59,286 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:45:59,319 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:45:59,319 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:45:59,320 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:45:59,320 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:45:59,320 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:45:59,321 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:45:59,321 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:45:59,322 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:45:59,356 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-20 00:45:59,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-20 00:45:59,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:45:59,368 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:45:59,368 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:45:59,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:45:59,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1246856209, now seen corresponding path program 1 times [2019-11-20 00:45:59,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:45:59,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736495168] [2019-11-20 00:45:59,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:45:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:59,753 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-20 00:45:59,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736495168] [2019-11-20 00:45:59,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:45:59,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:45:59,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009214493] [2019-11-20 00:45:59,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:45:59,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:45:59,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:45:59,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:45:59,774 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-20 00:46:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:02,141 INFO L93 Difference]: Finished difference Result 954 states and 1721 transitions. [2019-11-20 00:46:02,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:02,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-20 00:46:02,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:02,168 INFO L225 Difference]: With dead ends: 954 [2019-11-20 00:46:02,168 INFO L226 Difference]: Without dead ends: 603 [2019-11-20 00:46:02,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:02,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-11-20 00:46:02,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-11-20 00:46:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-11-20 00:46:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 837 transitions. [2019-11-20 00:46:02,290 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 837 transitions. Word has length 55 [2019-11-20 00:46:02,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:02,291 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 837 transitions. [2019-11-20 00:46:02,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:02,291 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 837 transitions. [2019-11-20 00:46:02,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 00:46:02,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:02,299 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:02,299 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:02,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:02,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1037527256, now seen corresponding path program 1 times [2019-11-20 00:46:02,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:02,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154957971] [2019-11-20 00:46:02,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:02,559 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:02,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154957971] [2019-11-20 00:46:02,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:02,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:02,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247223904] [2019-11-20 00:46:02,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:02,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:02,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:02,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:02,564 INFO L87 Difference]: Start difference. First operand 603 states and 837 transitions. Second operand 4 states. [2019-11-20 00:46:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:04,292 INFO L93 Difference]: Finished difference Result 2329 states and 3248 transitions. [2019-11-20 00:46:04,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:04,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-11-20 00:46:04,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:04,305 INFO L225 Difference]: With dead ends: 2329 [2019-11-20 00:46:04,306 INFO L226 Difference]: Without dead ends: 1728 [2019-11-20 00:46:04,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-20 00:46:04,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2019-11-20 00:46:04,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1342. [2019-11-20 00:46:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-11-20 00:46:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1792 transitions. [2019-11-20 00:46:04,357 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1792 transitions. Word has length 124 [2019-11-20 00:46:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:04,358 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 1792 transitions. [2019-11-20 00:46:04,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1792 transitions. [2019-11-20 00:46:04,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-20 00:46:04,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:04,368 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:46:04,368 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:04,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:04,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1586005467, now seen corresponding path program 1 times [2019-11-20 00:46:04,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:04,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432816861] [2019-11-20 00:46:04,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:04,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432816861] [2019-11-20 00:46:04,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:04,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:46:04,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666141404] [2019-11-20 00:46:04,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:04,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:04,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:04,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:04,565 INFO L87 Difference]: Start difference. First operand 1342 states and 1792 transitions. Second operand 4 states. [2019-11-20 00:46:06,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:06,573 INFO L93 Difference]: Finished difference Result 5087 states and 6835 transitions. [2019-11-20 00:46:06,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:06,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-11-20 00:46:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:06,595 INFO L225 Difference]: With dead ends: 5087 [2019-11-20 00:46:06,596 INFO L226 Difference]: Without dead ends: 3747 [2019-11-20 00:46:06,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3747 states. [2019-11-20 00:46:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3747 to 3741. [2019-11-20 00:46:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3741 states. [2019-11-20 00:46:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 4663 transitions. [2019-11-20 00:46:06,696 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 4663 transitions. Word has length 137 [2019-11-20 00:46:06,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:06,697 INFO L462 AbstractCegarLoop]: Abstraction has 3741 states and 4663 transitions. [2019-11-20 00:46:06,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:06,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 4663 transitions. [2019-11-20 00:46:06,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-20 00:46:06,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:06,713 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:46:06,713 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:06,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:06,714 INFO L82 PathProgramCache]: Analyzing trace with hash 693126941, now seen corresponding path program 1 times [2019-11-20 00:46:06,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:06,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321867897] [2019-11-20 00:46:06,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:07,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321867897] [2019-11-20 00:46:07,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:07,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:07,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170712625] [2019-11-20 00:46:07,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:46:07,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:07,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:46:07,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:07,076 INFO L87 Difference]: Start difference. First operand 3741 states and 4663 transitions. Second operand 5 states. [2019-11-20 00:46:09,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:09,819 INFO L93 Difference]: Finished difference Result 13396 states and 17132 transitions. [2019-11-20 00:46:09,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:46:09,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 182 [2019-11-20 00:46:09,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:09,877 INFO L225 Difference]: With dead ends: 13396 [2019-11-20 00:46:09,877 INFO L226 Difference]: Without dead ends: 9657 [2019-11-20 00:46:09,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:09,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9657 states. [2019-11-20 00:46:10,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9657 to 8171. [2019-11-20 00:46:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8171 states. [2019-11-20 00:46:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8171 states to 8171 states and 10119 transitions. [2019-11-20 00:46:10,153 INFO L78 Accepts]: Start accepts. Automaton has 8171 states and 10119 transitions. Word has length 182 [2019-11-20 00:46:10,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:10,154 INFO L462 AbstractCegarLoop]: Abstraction has 8171 states and 10119 transitions. [2019-11-20 00:46:10,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:46:10,154 INFO L276 IsEmpty]: Start isEmpty. Operand 8171 states and 10119 transitions. [2019-11-20 00:46:10,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-20 00:46:10,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:10,165 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 00:46:10,165 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:10,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:10,166 INFO L82 PathProgramCache]: Analyzing trace with hash 803669015, now seen corresponding path program 1 times [2019-11-20 00:46:10,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:10,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517196264] [2019-11-20 00:46:10,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-20 00:46:10,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517196264] [2019-11-20 00:46:10,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:10,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:10,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259366305] [2019-11-20 00:46:10,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:46:10,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:10,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:46:10,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:10,448 INFO L87 Difference]: Start difference. First operand 8171 states and 10119 transitions. Second operand 5 states. [2019-11-20 00:46:12,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:12,631 INFO L93 Difference]: Finished difference Result 19111 states and 23595 transitions. [2019-11-20 00:46:12,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:46:12,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 244 [2019-11-20 00:46:12,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:12,676 INFO L225 Difference]: With dead ends: 19111 [2019-11-20 00:46:12,676 INFO L226 Difference]: Without dead ends: 10758 [2019-11-20 00:46:12,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10758 states. [2019-11-20 00:46:12,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10758 to 9275. [2019-11-20 00:46:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9275 states. [2019-11-20 00:46:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9275 states to 9275 states and 11284 transitions. [2019-11-20 00:46:12,891 INFO L78 Accepts]: Start accepts. Automaton has 9275 states and 11284 transitions. Word has length 244 [2019-11-20 00:46:12,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:12,892 INFO L462 AbstractCegarLoop]: Abstraction has 9275 states and 11284 transitions. [2019-11-20 00:46:12,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:46:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 9275 states and 11284 transitions. [2019-11-20 00:46:12,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-11-20 00:46:12,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:12,906 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 00:46:12,907 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:12,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:12,907 INFO L82 PathProgramCache]: Analyzing trace with hash -757813282, now seen corresponding path program 1 times [2019-11-20 00:46:12,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:12,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528947389] [2019-11-20 00:46:12,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-20 00:46:13,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528947389] [2019-11-20 00:46:13,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:13,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:46:13,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326428791] [2019-11-20 00:46:13,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:13,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:13,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:13,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:13,124 INFO L87 Difference]: Start difference. First operand 9275 states and 11284 transitions. Second operand 4 states. [2019-11-20 00:46:14,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:14,779 INFO L93 Difference]: Finished difference Result 24461 states and 29940 transitions. [2019-11-20 00:46:14,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:14,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 295 [2019-11-20 00:46:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:14,833 INFO L225 Difference]: With dead ends: 24461 [2019-11-20 00:46:14,834 INFO L226 Difference]: Without dead ends: 15372 [2019-11-20 00:46:14,844 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:14,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15372 states. [2019-11-20 00:46:15,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15372 to 14243. [2019-11-20 00:46:15,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14243 states. [2019-11-20 00:46:15,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14243 states to 14243 states and 16964 transitions. [2019-11-20 00:46:15,073 INFO L78 Accepts]: Start accepts. Automaton has 14243 states and 16964 transitions. Word has length 295 [2019-11-20 00:46:15,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:15,074 INFO L462 AbstractCegarLoop]: Abstraction has 14243 states and 16964 transitions. [2019-11-20 00:46:15,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:15,074 INFO L276 IsEmpty]: Start isEmpty. Operand 14243 states and 16964 transitions. [2019-11-20 00:46:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-11-20 00:46:15,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:15,087 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:15,087 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:15,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:15,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1923530039, now seen corresponding path program 1 times [2019-11-20 00:46:15,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:15,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031570385] [2019-11-20 00:46:15,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 170 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 00:46:15,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031570385] [2019-11-20 00:46:15,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85329220] [2019-11-20 00:46:15,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10cfbad8-6f49-4430-8e19-b0b8c39433e1/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-20 00:46:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:15,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:46:15,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:46:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-20 00:46:15,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:46:15,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-11-20 00:46:15,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578930057] [2019-11-20 00:46:15,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:46:15,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:15,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:46:15,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:15,715 INFO L87 Difference]: Start difference. First operand 14243 states and 16964 transitions. Second operand 3 states. [2019-11-20 00:46:16,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:16,881 INFO L93 Difference]: Finished difference Result 29978 states and 35910 transitions. [2019-11-20 00:46:16,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:46:16,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-11-20 00:46:16,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:16,909 INFO L225 Difference]: With dead ends: 29978 [2019-11-20 00:46:16,910 INFO L226 Difference]: Without dead ends: 17767 [2019-11-20 00:46:16,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 302 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-20 00:46:16,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17767 states. [2019-11-20 00:46:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17767 to 17211. [2019-11-20 00:46:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17211 states. [2019-11-20 00:46:17,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17211 states to 17211 states and 20462 transitions. [2019-11-20 00:46:17,229 INFO L78 Accepts]: Start accepts. Automaton has 17211 states and 20462 transitions. Word has length 301 [2019-11-20 00:46:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:17,230 INFO L462 AbstractCegarLoop]: Abstraction has 17211 states and 20462 transitions. [2019-11-20 00:46:17,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:46:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 17211 states and 20462 transitions. [2019-11-20 00:46:17,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-11-20 00:46:17,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:17,255 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:17,461 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:46:17,461 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:17,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:17,462 INFO L82 PathProgramCache]: Analyzing trace with hash 413217873, now seen corresponding path program 1 times [2019-11-20 00:46:17,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:17,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051296303] [2019-11-20 00:46:17,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:17,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051296303] [2019-11-20 00:46:17,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:17,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:17,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258118142] [2019-11-20 00:46:17,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:17,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:17,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:17,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:17,774 INFO L87 Difference]: Start difference. First operand 17211 states and 20462 transitions. Second operand 4 states. [2019-11-20 00:46:19,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:19,422 INFO L93 Difference]: Finished difference Result 35895 states and 42811 transitions. [2019-11-20 00:46:19,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:19,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 357 [2019-11-20 00:46:19,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:19,462 INFO L225 Difference]: With dead ends: 35895 [2019-11-20 00:46:19,462 INFO L226 Difference]: Without dead ends: 20716 [2019-11-20 00:46:19,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:19,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20716 states. [2019-11-20 00:46:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20716 to 18131. [2019-11-20 00:46:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18131 states. [2019-11-20 00:46:19,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18131 states to 18131 states and 21571 transitions. [2019-11-20 00:46:19,739 INFO L78 Accepts]: Start accepts. Automaton has 18131 states and 21571 transitions. Word has length 357 [2019-11-20 00:46:19,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:19,740 INFO L462 AbstractCegarLoop]: Abstraction has 18131 states and 21571 transitions. [2019-11-20 00:46:19,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 18131 states and 21571 transitions. [2019-11-20 00:46:19,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-11-20 00:46:19,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:19,766 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:19,766 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:19,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:19,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1368180965, now seen corresponding path program 1 times [2019-11-20 00:46:19,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:19,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132206157] [2019-11-20 00:46:19,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-11-20 00:46:20,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132206157] [2019-11-20 00:46:20,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:20,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:46:20,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023945808] [2019-11-20 00:46:20,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:46:20,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:20,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:46:20,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:46:20,110 INFO L87 Difference]: Start difference. First operand 18131 states and 21571 transitions. Second operand 3 states. [2019-11-20 00:46:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:21,076 INFO L93 Difference]: Finished difference Result 34758 states and 41170 transitions. [2019-11-20 00:46:21,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:46:21,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2019-11-20 00:46:21,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:21,108 INFO L225 Difference]: With dead ends: 34758 [2019-11-20 00:46:21,108 INFO L226 Difference]: Without dead ends: 16445 [2019-11-20 00:46:21,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-20 00:46:21,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16445 states. [2019-11-20 00:46:21,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16445 to 14603. [2019-11-20 00:46:21,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14603 states. [2019-11-20 00:46:21,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14603 states to 14603 states and 16685 transitions. [2019-11-20 00:46:21,297 INFO L78 Accepts]: Start accepts. Automaton has 14603 states and 16685 transitions. Word has length 366 [2019-11-20 00:46:21,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:21,298 INFO L462 AbstractCegarLoop]: Abstraction has 14603 states and 16685 transitions. [2019-11-20 00:46:21,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:46:21,299 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 16685 transitions. [2019-11-20 00:46:21,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2019-11-20 00:46:21,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:21,337 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:21,337 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:21,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:21,338 INFO L82 PathProgramCache]: Analyzing trace with hash 405640561, now seen corresponding path program 1 times [2019-11-20 00:46:21,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:21,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748944797] [2019-11-20 00:46:21,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 670 proven. 0 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2019-11-20 00:46:21,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748944797] [2019-11-20 00:46:21,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:21,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:21,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886745608] [2019-11-20 00:46:21,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:21,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:21,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:21,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:21,791 INFO L87 Difference]: Start difference. First operand 14603 states and 16685 transitions. Second operand 4 states. [2019-11-20 00:46:23,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:23,303 INFO L93 Difference]: Finished difference Result 31058 states and 35482 transitions. [2019-11-20 00:46:23,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:23,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 605 [2019-11-20 00:46:23,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:23,323 INFO L225 Difference]: With dead ends: 31058 [2019-11-20 00:46:23,323 INFO L226 Difference]: Without dead ends: 16825 [2019-11-20 00:46:23,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16825 states. [2019-11-20 00:46:23,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16825 to 15155. [2019-11-20 00:46:23,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15155 states. [2019-11-20 00:46:23,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15155 states to 15155 states and 16939 transitions. [2019-11-20 00:46:23,537 INFO L78 Accepts]: Start accepts. Automaton has 15155 states and 16939 transitions. Word has length 605 [2019-11-20 00:46:23,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:23,538 INFO L462 AbstractCegarLoop]: Abstraction has 15155 states and 16939 transitions. [2019-11-20 00:46:23,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:23,539 INFO L276 IsEmpty]: Start isEmpty. Operand 15155 states and 16939 transitions. [2019-11-20 00:46:23,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2019-11-20 00:46:23,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:23,588 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2019-11-20 00:46:23,588 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:23,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:23,589 INFO L82 PathProgramCache]: Analyzing trace with hash -799752283, now seen corresponding path program 1 times [2019-11-20 00:46:23,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:23,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512694790] [2019-11-20 00:46:23,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1692 backedges. 1053 proven. 437 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-11-20 00:46:25,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512694790] [2019-11-20 00:46:25,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400816515] [2019-11-20 00:46:25,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10cfbad8-6f49-4430-8e19-b0b8c39433e1/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-20 00:46:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:25,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:46:25,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:46:25,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:46:25,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:46:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1692 backedges. 1258 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-11-20 00:46:26,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:46:26,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-20 00:46:26,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480274251] [2019-11-20 00:46:26,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:46:26,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:26,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:46:26,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-20 00:46:26,345 INFO L87 Difference]: Start difference. First operand 15155 states and 16939 transitions. Second operand 3 states. [2019-11-20 00:46:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:27,521 INFO L93 Difference]: Finished difference Result 34176 states and 38217 transitions. [2019-11-20 00:46:27,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:46:27,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 747 [2019-11-20 00:46:27,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:27,539 INFO L225 Difference]: With dead ends: 34176 [2019-11-20 00:46:27,539 INFO L226 Difference]: Without dead ends: 19391 [2019-11-20 00:46:27,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 746 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-20 00:46:27,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19391 states. [2019-11-20 00:46:27,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19391 to 18654. [2019-11-20 00:46:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18654 states. [2019-11-20 00:46:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18654 states to 18654 states and 20520 transitions. [2019-11-20 00:46:27,741 INFO L78 Accepts]: Start accepts. Automaton has 18654 states and 20520 transitions. Word has length 747 [2019-11-20 00:46:27,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:27,742 INFO L462 AbstractCegarLoop]: Abstraction has 18654 states and 20520 transitions. [2019-11-20 00:46:27,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:46:27,742 INFO L276 IsEmpty]: Start isEmpty. Operand 18654 states and 20520 transitions. [2019-11-20 00:46:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2019-11-20 00:46:27,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:27,758 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:46:27,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:46:27,961 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:27,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:27,962 INFO L82 PathProgramCache]: Analyzing trace with hash 216433610, now seen corresponding path program 1 times [2019-11-20 00:46:27,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:27,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414147137] [2019-11-20 00:46:27,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1799 backedges. 1217 proven. 100 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-11-20 00:46:28,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414147137] [2019-11-20 00:46:28,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922685300] [2019-11-20 00:46:28,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10cfbad8-6f49-4430-8e19-b0b8c39433e1/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-20 00:46:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:29,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:46:29,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:46:29,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:46:29,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:46:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1799 backedges. 1214 proven. 0 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-11-20 00:46:30,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:46:30,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-20 00:46:30,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288872716] [2019-11-20 00:46:30,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:46:30,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:30,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:46:30,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:46:30,145 INFO L87 Difference]: Start difference. First operand 18654 states and 20520 transitions. Second operand 3 states. [2019-11-20 00:46:31,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:31,186 INFO L93 Difference]: Finished difference Result 39514 states and 43439 transitions. [2019-11-20 00:46:31,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:46:31,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 774 [2019-11-20 00:46:31,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:31,204 INFO L225 Difference]: With dead ends: 39514 [2019-11-20 00:46:31,205 INFO L226 Difference]: Without dead ends: 21230 [2019-11-20 00:46:31,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 773 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:46:31,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21230 states. [2019-11-20 00:46:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21230 to 19574. [2019-11-20 00:46:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19574 states. [2019-11-20 00:46:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19574 states to 19574 states and 21487 transitions. [2019-11-20 00:46:31,420 INFO L78 Accepts]: Start accepts. Automaton has 19574 states and 21487 transitions. Word has length 774 [2019-11-20 00:46:31,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:31,421 INFO L462 AbstractCegarLoop]: Abstraction has 19574 states and 21487 transitions. [2019-11-20 00:46:31,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:46:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 19574 states and 21487 transitions. [2019-11-20 00:46:31,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 804 [2019-11-20 00:46:31,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:31,433 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:46:31,634 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:46:31,634 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:31,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:31,634 INFO L82 PathProgramCache]: Analyzing trace with hash -755017445, now seen corresponding path program 1 times [2019-11-20 00:46:31,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:31,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283064999] [2019-11-20 00:46:31,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1896 backedges. 1327 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-11-20 00:46:32,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283064999] [2019-11-20 00:46:32,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:32,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:32,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587773345] [2019-11-20 00:46:32,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:32,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:32,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:32,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:32,330 INFO L87 Difference]: Start difference. First operand 19574 states and 21487 transitions. Second operand 4 states. [2019-11-20 00:46:33,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:33,587 INFO L93 Difference]: Finished difference Result 39899 states and 43767 transitions. [2019-11-20 00:46:33,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:33,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 803 [2019-11-20 00:46:33,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:33,601 INFO L225 Difference]: With dead ends: 39899 [2019-11-20 00:46:33,601 INFO L226 Difference]: Without dead ends: 20511 [2019-11-20 00:46:33,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:46:33,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20511 states. [2019-11-20 00:46:33,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20511 to 19389. [2019-11-20 00:46:33,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19389 states. [2019-11-20 00:46:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19389 states to 19389 states and 20978 transitions. [2019-11-20 00:46:33,782 INFO L78 Accepts]: Start accepts. Automaton has 19389 states and 20978 transitions. Word has length 803 [2019-11-20 00:46:33,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:33,782 INFO L462 AbstractCegarLoop]: Abstraction has 19389 states and 20978 transitions. [2019-11-20 00:46:33,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 19389 states and 20978 transitions. [2019-11-20 00:46:33,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2019-11-20 00:46:33,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:33,801 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:33,801 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:33,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:33,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1081799803, now seen corresponding path program 1 times [2019-11-20 00:46:33,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:33,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915024231] [2019-11-20 00:46:33,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:34,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1924 backedges. 1358 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2019-11-20 00:46:34,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915024231] [2019-11-20 00:46:34,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:34,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:46:34,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858238844] [2019-11-20 00:46:34,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 00:46:34,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:34,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 00:46:34,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:46:34,683 INFO L87 Difference]: Start difference. First operand 19389 states and 20978 transitions. Second operand 6 states. [2019-11-20 00:46:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:36,499 INFO L93 Difference]: Finished difference Result 42644 states and 46063 transitions. [2019-11-20 00:46:36,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:46:36,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 827 [2019-11-20 00:46:36,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:36,514 INFO L225 Difference]: With dead ends: 42644 [2019-11-20 00:46:36,514 INFO L226 Difference]: Without dead ends: 23625 [2019-11-20 00:46:36,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:46:36,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23625 states. [2019-11-20 00:46:36,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23625 to 14787. [2019-11-20 00:46:36,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14787 states. [2019-11-20 00:46:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14787 states to 14787 states and 15938 transitions. [2019-11-20 00:46:36,674 INFO L78 Accepts]: Start accepts. Automaton has 14787 states and 15938 transitions. Word has length 827 [2019-11-20 00:46:36,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:36,675 INFO L462 AbstractCegarLoop]: Abstraction has 14787 states and 15938 transitions. [2019-11-20 00:46:36,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 00:46:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 14787 states and 15938 transitions. [2019-11-20 00:46:36,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2019-11-20 00:46:36,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:36,694 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 00:46:36,694 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:36,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:36,694 INFO L82 PathProgramCache]: Analyzing trace with hash -366298296, now seen corresponding path program 1 times [2019-11-20 00:46:36,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:36,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184408624] [2019-11-20 00:46:36,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1904 backedges. 1123 proven. 0 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2019-11-20 00:46:37,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184408624] [2019-11-20 00:46:37,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:37,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:46:37,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650423920] [2019-11-20 00:46:37,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:46:37,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:37,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:46:37,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:37,775 INFO L87 Difference]: Start difference. First operand 14787 states and 15938 transitions. Second operand 5 states. [2019-11-20 00:46:39,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:39,239 INFO L93 Difference]: Finished difference Result 30151 states and 32515 transitions. [2019-11-20 00:46:39,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:46:39,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 831 [2019-11-20 00:46:39,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:39,255 INFO L225 Difference]: With dead ends: 30151 [2019-11-20 00:46:39,255 INFO L226 Difference]: Without dead ends: 15920 [2019-11-20 00:46:39,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:39,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15920 states. [2019-11-20 00:46:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15920 to 14417. [2019-11-20 00:46:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14417 states. [2019-11-20 00:46:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14417 states to 14417 states and 15461 transitions. [2019-11-20 00:46:39,391 INFO L78 Accepts]: Start accepts. Automaton has 14417 states and 15461 transitions. Word has length 831 [2019-11-20 00:46:39,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:39,392 INFO L462 AbstractCegarLoop]: Abstraction has 14417 states and 15461 transitions. [2019-11-20 00:46:39,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:46:39,392 INFO L276 IsEmpty]: Start isEmpty. Operand 14417 states and 15461 transitions. [2019-11-20 00:46:39,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2019-11-20 00:46:39,402 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:39,402 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:39,402 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:39,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:39,403 INFO L82 PathProgramCache]: Analyzing trace with hash -102372182, now seen corresponding path program 1 times [2019-11-20 00:46:39,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:39,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328545653] [2019-11-20 00:46:39,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 1023 proven. 142 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2019-11-20 00:46:40,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328545653] [2019-11-20 00:46:40,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729376680] [2019-11-20 00:46:40,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10cfbad8-6f49-4430-8e19-b0b8c39433e1/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-20 00:46:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:41,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 00:46:41,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:46:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 1165 proven. 0 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2019-11-20 00:46:41,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:46:41,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-20 00:46:41,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362265098] [2019-11-20 00:46:41,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:46:41,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:41,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:46:41,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-20 00:46:41,787 INFO L87 Difference]: Start difference. First operand 14417 states and 15461 transitions. Second operand 4 states. [2019-11-20 00:46:42,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:42,674 INFO L93 Difference]: Finished difference Result 29570 states and 31705 transitions. [2019-11-20 00:46:42,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:46:42,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 847 [2019-11-20 00:46:42,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:42,684 INFO L225 Difference]: With dead ends: 29570 [2019-11-20 00:46:42,684 INFO L226 Difference]: Without dead ends: 15525 [2019-11-20 00:46:42,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 845 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-20 00:46:42,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15525 states. [2019-11-20 00:46:42,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15525 to 13681. [2019-11-20 00:46:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13681 states. [2019-11-20 00:46:42,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13681 states to 13681 states and 14649 transitions. [2019-11-20 00:46:42,792 INFO L78 Accepts]: Start accepts. Automaton has 13681 states and 14649 transitions. Word has length 847 [2019-11-20 00:46:42,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:42,792 INFO L462 AbstractCegarLoop]: Abstraction has 13681 states and 14649 transitions. [2019-11-20 00:46:42,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:46:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 13681 states and 14649 transitions. [2019-11-20 00:46:42,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 897 [2019-11-20 00:46:42,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:42,801 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 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] [2019-11-20 00:46:43,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:46:43,005 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:43,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:43,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1121909716, now seen corresponding path program 1 times [2019-11-20 00:46:43,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:43,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439118007] [2019-11-20 00:46:43,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2397 backedges. 1537 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-11-20 00:46:43,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439118007] [2019-11-20 00:46:43,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:43,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:46:43,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656785618] [2019-11-20 00:46:43,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:46:43,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:43,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:46:43,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:43,909 INFO L87 Difference]: Start difference. First operand 13681 states and 14649 transitions. Second operand 5 states. [2019-11-20 00:46:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:45,141 INFO L93 Difference]: Finished difference Result 28280 states and 30246 transitions. [2019-11-20 00:46:45,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:46:45,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 896 [2019-11-20 00:46:45,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:45,153 INFO L225 Difference]: With dead ends: 28280 [2019-11-20 00:46:45,153 INFO L226 Difference]: Without dead ends: 14970 [2019-11-20 00:46:45,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:46:45,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14970 states. [2019-11-20 00:46:45,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14970 to 12760. [2019-11-20 00:46:45,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12760 states. [2019-11-20 00:46:45,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12760 states to 12760 states and 13648 transitions. [2019-11-20 00:46:45,279 INFO L78 Accepts]: Start accepts. Automaton has 12760 states and 13648 transitions. Word has length 896 [2019-11-20 00:46:45,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:45,279 INFO L462 AbstractCegarLoop]: Abstraction has 12760 states and 13648 transitions. [2019-11-20 00:46:45,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:46:45,279 INFO L276 IsEmpty]: Start isEmpty. Operand 12760 states and 13648 transitions. [2019-11-20 00:46:45,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2019-11-20 00:46:45,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:45,291 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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-20 00:46:45,291 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:45,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:45,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1056427581, now seen corresponding path program 1 times [2019-11-20 00:46:45,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:45,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818371161] [2019-11-20 00:46:45,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2513 backedges. 1636 proven. 0 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2019-11-20 00:46:46,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818371161] [2019-11-20 00:46:46,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:46,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:46:46,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926651600] [2019-11-20 00:46:46,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 00:46:46,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:46,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 00:46:46,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:46:46,636 INFO L87 Difference]: Start difference. First operand 12760 states and 13648 transitions. Second operand 6 states. [2019-11-20 00:46:48,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:48,360 INFO L93 Difference]: Finished difference Result 26620 states and 28458 transitions. [2019-11-20 00:46:48,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:46:48,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 923 [2019-11-20 00:46:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:48,368 INFO L225 Difference]: With dead ends: 26620 [2019-11-20 00:46:48,368 INFO L226 Difference]: Without dead ends: 11836 [2019-11-20 00:46:48,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:46:48,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11836 states. [2019-11-20 00:46:48,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11836 to 11100. [2019-11-20 00:46:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11100 states. [2019-11-20 00:46:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11100 states to 11100 states and 11624 transitions. [2019-11-20 00:46:48,451 INFO L78 Accepts]: Start accepts. Automaton has 11100 states and 11624 transitions. Word has length 923 [2019-11-20 00:46:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:48,451 INFO L462 AbstractCegarLoop]: Abstraction has 11100 states and 11624 transitions. [2019-11-20 00:46:48,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 00:46:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 11100 states and 11624 transitions. [2019-11-20 00:46:48,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 966 [2019-11-20 00:46:48,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:48,460 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 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-20 00:46:48,460 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:48,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:48,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1498076430, now seen corresponding path program 1 times [2019-11-20 00:46:48,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:48,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354544119] [2019-11-20 00:46:48,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2658 backedges. 1628 proven. 249 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2019-11-20 00:46:50,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354544119] [2019-11-20 00:46:50,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963413568] [2019-11-20 00:46:50,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10cfbad8-6f49-4430-8e19-b0b8c39433e1/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-20 00:46:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:50,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 1199 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 00:46:50,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:46:50,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:46:50,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:46:50,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:46:50,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:46:50,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:46:52,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2658 backedges. 1628 proven. 249 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2019-11-20 00:46:52,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:46:52,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-11-20 00:46:52,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939196652] [2019-11-20 00:46:52,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 00:46:52,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:52,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 00:46:52,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-11-20 00:46:52,638 INFO L87 Difference]: Start difference. First operand 11100 states and 11624 transitions. Second operand 13 states. [2019-11-20 00:46:56,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:56,743 INFO L93 Difference]: Finished difference Result 22879 states and 23962 transitions. [2019-11-20 00:46:56,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 00:46:56,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 965 [2019-11-20 00:46:56,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:56,751 INFO L225 Difference]: With dead ends: 22879 [2019-11-20 00:46:56,751 INFO L226 Difference]: Without dead ends: 11191 [2019-11-20 00:46:56,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 987 GetRequests, 962 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 [2019-11-20 00:46:56,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11191 states. [2019-11-20 00:46:56,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11191 to 8679. [2019-11-20 00:46:56,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8679 states. [2019-11-20 00:46:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8679 states to 8679 states and 9012 transitions. [2019-11-20 00:46:56,832 INFO L78 Accepts]: Start accepts. Automaton has 8679 states and 9012 transitions. Word has length 965 [2019-11-20 00:46:56,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:56,833 INFO L462 AbstractCegarLoop]: Abstraction has 8679 states and 9012 transitions. [2019-11-20 00:46:56,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 00:46:56,833 INFO L276 IsEmpty]: Start isEmpty. Operand 8679 states and 9012 transitions. [2019-11-20 00:46:56,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2019-11-20 00:46:56,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:56,845 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 00:46:57,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:46:57,048 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:57,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:57,049 INFO L82 PathProgramCache]: Analyzing trace with hash -770256063, now seen corresponding path program 1 times [2019-11-20 00:46:57,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:57,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310652140] [2019-11-20 00:46:57,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3221 backedges. 2118 proven. 0 refuted. 0 times theorem prover too weak. 1103 trivial. 0 not checked. [2019-11-20 00:46:57,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310652140] [2019-11-20 00:46:57,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:46:57,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:46:57,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71190743] [2019-11-20 00:46:57,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:46:57,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:46:57,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:46:57,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:46:57,790 INFO L87 Difference]: Start difference. First operand 8679 states and 9012 transitions. Second operand 3 states. [2019-11-20 00:46:58,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:46:58,256 INFO L93 Difference]: Finished difference Result 16802 states and 17456 transitions. [2019-11-20 00:46:58,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:46:58,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 994 [2019-11-20 00:46:58,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:46:58,261 INFO L225 Difference]: With dead ends: 16802 [2019-11-20 00:46:58,261 INFO L226 Difference]: Without dead ends: 8863 [2019-11-20 00:46:58,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:46:58,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8863 states. [2019-11-20 00:46:58,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8863 to 7943. [2019-11-20 00:46:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7943 states. [2019-11-20 00:46:58,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7943 states to 7943 states and 8244 transitions. [2019-11-20 00:46:58,321 INFO L78 Accepts]: Start accepts. Automaton has 7943 states and 8244 transitions. Word has length 994 [2019-11-20 00:46:58,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:46:58,321 INFO L462 AbstractCegarLoop]: Abstraction has 7943 states and 8244 transitions. [2019-11-20 00:46:58,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:46:58,321 INFO L276 IsEmpty]: Start isEmpty. Operand 7943 states and 8244 transitions. [2019-11-20 00:46:58,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2019-11-20 00:46:58,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:46:58,329 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:46:58,329 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:46:58,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:46:58,330 INFO L82 PathProgramCache]: Analyzing trace with hash -170186788, now seen corresponding path program 1 times [2019-11-20 00:46:58,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:46:58,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662338155] [2019-11-20 00:46:58,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:46:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:00,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2773 backedges. 1992 proven. 0 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2019-11-20 00:47:00,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662338155] [2019-11-20 00:47:00,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:47:00,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 00:47:00,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809997142] [2019-11-20 00:47:00,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 00:47:00,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:47:00,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 00:47:00,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:47:00,026 INFO L87 Difference]: Start difference. First operand 7943 states and 8244 transitions. Second operand 7 states. [2019-11-20 00:47:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:01,859 INFO L93 Difference]: Finished difference Result 17171 states and 17832 transitions. [2019-11-20 00:47:01,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 00:47:01,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1009 [2019-11-20 00:47:01,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:01,869 INFO L225 Difference]: With dead ends: 17171 [2019-11-20 00:47:01,870 INFO L226 Difference]: Without dead ends: 9784 [2019-11-20 00:47:01,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:47:01,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9784 states. [2019-11-20 00:47:01,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9784 to 8311. [2019-11-20 00:47:01,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8311 states. [2019-11-20 00:47:01,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8311 states to 8311 states and 8617 transitions. [2019-11-20 00:47:01,960 INFO L78 Accepts]: Start accepts. Automaton has 8311 states and 8617 transitions. Word has length 1009 [2019-11-20 00:47:01,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:01,960 INFO L462 AbstractCegarLoop]: Abstraction has 8311 states and 8617 transitions. [2019-11-20 00:47:01,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 00:47:01,960 INFO L276 IsEmpty]: Start isEmpty. Operand 8311 states and 8617 transitions. [2019-11-20 00:47:01,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1020 [2019-11-20 00:47:01,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:01,970 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-20 00:47:01,971 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:47:01,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:01,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1902220041, now seen corresponding path program 1 times [2019-11-20 00:47:01,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:47:01,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923972062] [2019-11-20 00:47:01,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:47:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:03,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 2445 proven. 0 refuted. 0 times theorem prover too weak. 892 trivial. 0 not checked. [2019-11-20 00:47:03,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923972062] [2019-11-20 00:47:03,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:47:03,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:47:03,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317847073] [2019-11-20 00:47:03,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:47:03,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:47:03,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:47:03,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:47:03,080 INFO L87 Difference]: Start difference. First operand 8311 states and 8617 transitions. Second operand 5 states. [2019-11-20 00:47:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:04,261 INFO L93 Difference]: Finished difference Result 17175 states and 17818 transitions. [2019-11-20 00:47:04,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:47:04,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1019 [2019-11-20 00:47:04,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:04,269 INFO L225 Difference]: With dead ends: 17175 [2019-11-20 00:47:04,269 INFO L226 Difference]: Without dead ends: 9604 [2019-11-20 00:47:04,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:47:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9604 states. [2019-11-20 00:47:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9604 to 8867. [2019-11-20 00:47:04,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8867 states. [2019-11-20 00:47:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8867 states to 8867 states and 9188 transitions. [2019-11-20 00:47:04,344 INFO L78 Accepts]: Start accepts. Automaton has 8867 states and 9188 transitions. Word has length 1019 [2019-11-20 00:47:04,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:04,345 INFO L462 AbstractCegarLoop]: Abstraction has 8867 states and 9188 transitions. [2019-11-20 00:47:04,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:47:04,345 INFO L276 IsEmpty]: Start isEmpty. Operand 8867 states and 9188 transitions. [2019-11-20 00:47:04,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1027 [2019-11-20 00:47:04,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:47:04,355 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-11-20 00:47:04,355 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:47:04,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:47:04,355 INFO L82 PathProgramCache]: Analyzing trace with hash -38082471, now seen corresponding path program 1 times [2019-11-20 00:47:04,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:47:04,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712252913] [2019-11-20 00:47:04,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:47:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2814 backedges. 2143 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2019-11-20 00:47:05,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712252913] [2019-11-20 00:47:05,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:47:05,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:47:05,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967813906] [2019-11-20 00:47:05,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:47:05,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:47:05,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:47:05,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:47:05,550 INFO L87 Difference]: Start difference. First operand 8867 states and 9188 transitions. Second operand 5 states. [2019-11-20 00:47:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:47:06,190 INFO L93 Difference]: Finished difference Result 14025 states and 14530 transitions. [2019-11-20 00:47:06,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:47:06,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1026 [2019-11-20 00:47:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:47:06,191 INFO L225 Difference]: With dead ends: 14025 [2019-11-20 00:47:06,192 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 00:47:06,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-20 00:47:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 00:47:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 00:47:06,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 00:47:06,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 00:47:06,195 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1026 [2019-11-20 00:47:06,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:47:06,195 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 00:47:06,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:47:06,195 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 00:47:06,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 00:47:06,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 00:47:07,302 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 691 DAG size of output: 550 [2019-11-20 00:47:08,055 WARN L191 SmtUtils]: Spent 750.00 ms on a formula simplification. DAG size of input: 688 DAG size of output: 549 [2019-11-20 00:47:12,317 WARN L191 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 508 DAG size of output: 185 [2019-11-20 00:47:16,509 WARN L191 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 508 DAG size of output: 185 [2019-11-20 00:47:16,512 INFO L444 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-20 00:47:16,513 INFO L444 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-20 00:47:16,513 INFO L444 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-20 00:47:16,513 INFO L447 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-20 00:47:16,513 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,513 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,513 INFO L444 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,513 INFO L444 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,514 INFO L444 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,514 INFO L444 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,514 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,514 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-20 00:47:16,514 INFO L444 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-20 00:47:16,514 INFO L444 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-20 00:47:16,514 INFO L444 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,514 INFO L444 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,514 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,514 INFO L444 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,515 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,515 INFO L444 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,515 INFO L444 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,515 INFO L444 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,515 INFO L444 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,515 INFO L444 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-20 00:47:16,515 INFO L444 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-20 00:47:16,515 INFO L444 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-20 00:47:16,515 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,516 INFO L440 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse38 (+ ~a23~0 43)) (.cse9 (= 12 ~a25~0)) (.cse0 (= ~a25~0 13))) (let ((.cse1 (<= ~a29~0 130)) (.cse35 (not .cse0)) (.cse30 (not .cse9)) (.cse27 (<= .cse38 0))) (let ((.cse34 (and .cse30 .cse27)) (.cse5 (and (and .cse1 .cse27) .cse35)) (.cse23 (= ~a4~0 1)) (.cse15 (= ~a25~0 9)) (.cse39 (<= ~a29~0 274)) (.cse17 (= 10 ~a25~0))) (let ((.cse10 (<= ~a4~0 0)) (.cse32 (and .cse39 .cse17)) (.cse21 (< 140 ~a29~0)) (.cse6 (= 1 ~a3~0)) (.cse37 (or (and (and .cse34 .cse39) .cse23) (and .cse5 .cse23) (and .cse15 .cse1 .cse27))) (.cse7 (= 15 ~a8~0)) (.cse26 (<= ~a23~0 312)) (.cse20 (<= ~a29~0 277)) (.cse3 (< 138 ~a23~0))) (let ((.cse18 (<= 261 ~a29~0)) (.cse4 (<= ~a23~0 262)) (.cse14 (<= ~a25~0 9)) (.cse22 (and (not .cse15) (or (and .cse30 .cse26 (< 0 .cse38) .cse35 .cse20) (and .cse26 .cse35 .cse20 .cse3)) (not .cse17))) (.cse31 (and .cse6 .cse37 .cse7)) (.cse11 (<= ~a23~0 600000)) (.cse12 (= ~a25~0 11)) (.cse19 (and .cse21 .cse37)) (.cse29 (<= ~a29~0 245)) (.cse33 (or .cse32 (and .cse17 .cse20 .cse3))) (.cse24 (exists ((v_~a29~0_499 Int)) (let ((.cse36 (mod v_~a29~0_499 15))) (and (<= (+ .cse36 247) ~a29~0) (< 140 v_~a29~0_499) (= .cse36 0))))) (.cse16 (<= ~a23~0 306)) (.cse2 (= 1 ~a4~0)) (.cse25 (and .cse10 .cse35 .cse20)) (.cse8 (<= (+ ~a23~0 55) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (and .cse5 .cse6 .cse7) (<= 0 (+ ~a29~0 28553)) .cse8) (and .cse5 .cse9 .cse10 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse6 .cse7) (and .cse11 (let ((.cse13 (< 277 ~a29~0))) (or (and .cse6 .cse7 .cse2 .cse12 .cse13) (and .cse6 (and .cse14 (and (exists ((v_~a29~0_500 Int)) (and (< 140 v_~a29~0_500) (<= (+ (* 2 (div (* v_~a29~0_500 10) 5)) 569818) ~a29~0))) .cse3) .cse2) .cse7) (and .cse6 (and .cse15 .cse2) .cse7 .cse13)))) (and .cse16 (and (and .cse17 .cse3) .cse2)) (and .cse16 .cse2 .cse12 .cse18) (and .cse0 .cse19) (and .cse11 (and (and (and (and .cse20 .cse3) .cse21) .cse2) .cse6 .cse7)) (and (and .cse0 .cse18 .cse3) .cse2 .cse4) (and .cse21 (and (and .cse6 .cse7 .cse22) .cse23)) (and .cse16 .cse2 .cse12 .cse3) (and .cse6 .cse7 (and .cse9 .cse24 .cse25)) (and .cse26 .cse15 .cse1 .cse3) (and .cse14 .cse19) (and (and .cse10 (and .cse15 .cse27)) (exists ((v_~a29~0_503 Int)) (let ((.cse28 (mod v_~a29~0_503 299861))) (and (<= (+ .cse28 10250) ~a29~0) (< 140 v_~a29~0_503) (= 0 .cse28)))) .cse6 .cse7) (and (and .cse0 .cse29) .cse6 .cse21 .cse7 .cse2) (and .cse30 (and (and .cse22 .cse24) .cse2) .cse16) (and .cse31 .cse8) (and .cse11 (and .cse0 .cse6 .cse7 .cse3) (<= ~a29~0 599998) .cse23) (and .cse32 .cse16 .cse2) (and .cse9 .cse31 (<= (+ ~a29~0 22) 0)) (and .cse6 .cse7 (and (or (and .cse26 .cse15) (and .cse15 .cse21 .cse20) (and .cse33 .cse21)) .cse2)) (and .cse11 .cse17 .cse6 .cse7 .cse2) (and .cse26 .cse9 .cse6 .cse7 .cse2 .cse3) (and .cse12 .cse19) (and .cse34 .cse23 .cse17) (and (or (and .cse0 .cse21 .cse29 .cse3) (or (and .cse33 .cse24) (and .cse15 .cse24 .cse20))) .cse2) (and .cse15 .cse16 .cse2) (and (and .cse9 .cse6 .cse21 .cse7 .cse25) .cse8))))))) [2019-11-20 00:47:16,516 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,516 INFO L444 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,517 INFO L444 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,517 INFO L444 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,517 INFO L444 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,517 INFO L444 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,517 INFO L444 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,517 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,517 INFO L444 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-20 00:47:16,517 INFO L444 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-20 00:47:16,517 INFO L444 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-20 00:47:16,517 INFO L444 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-20 00:47:16,518 INFO L444 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-20 00:47:16,518 INFO L444 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-20 00:47:16,518 INFO L444 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-20 00:47:16,518 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,518 INFO L444 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,518 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,518 INFO L444 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,518 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,518 INFO L444 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,518 INFO L444 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,519 INFO L444 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,519 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,519 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,519 INFO L444 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-20 00:47:16,519 INFO L444 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-20 00:47:16,519 INFO L444 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-20 00:47:16,519 INFO L444 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-20 00:47:16,519 INFO L444 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,519 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,520 INFO L444 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,520 INFO L444 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,520 INFO L444 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,520 INFO L444 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-20 00:47:16,520 INFO L444 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-20 00:47:16,520 INFO L444 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-20 00:47:16,520 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,520 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,520 INFO L444 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,520 INFO L444 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,521 INFO L444 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-20 00:47:16,521 INFO L444 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-20 00:47:16,521 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,521 INFO L444 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,521 INFO L444 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,521 INFO L444 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,521 INFO L444 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,521 INFO L444 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,521 INFO L444 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-20 00:47:16,521 INFO L444 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-20 00:47:16,522 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,522 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,522 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-20 00:47:16,522 INFO L444 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-20 00:47:16,522 INFO L444 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-20 00:47:16,522 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,522 INFO L444 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,522 INFO L444 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,522 INFO L444 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,522 INFO L444 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,523 INFO L444 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,523 INFO L444 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,523 INFO L444 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-20 00:47:16,523 INFO L444 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-20 00:47:16,523 INFO L444 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-20 00:47:16,523 INFO L444 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-20 00:47:16,523 INFO L444 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-20 00:47:16,523 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-20 00:47:16,523 INFO L444 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-20 00:47:16,523 INFO L444 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,524 INFO L444 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,524 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 00:47:16,524 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-20 00:47:16,524 INFO L444 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-20 00:47:16,524 INFO L444 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,524 INFO L444 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,524 INFO L444 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,524 INFO L444 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,524 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,524 INFO L444 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-20 00:47:16,524 INFO L444 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-20 00:47:16,525 INFO L444 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-20 00:47:16,525 INFO L444 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,525 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,525 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,525 INFO L444 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,525 INFO L444 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,525 INFO L444 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,525 INFO L444 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-20 00:47:16,525 INFO L444 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-20 00:47:16,525 INFO L444 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-20 00:47:16,525 INFO L444 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,526 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,526 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,526 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,526 INFO L444 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,526 INFO L444 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,526 INFO L444 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,526 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 00:47:16,526 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2019-11-20 00:47:16,526 INFO L444 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,527 INFO L444 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-20 00:47:16,527 INFO L444 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-20 00:47:16,527 INFO L444 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-20 00:47:16,527 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,527 INFO L444 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,527 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,527 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,527 INFO L444 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,527 INFO L444 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,527 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,528 INFO L444 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,528 INFO L444 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,528 INFO L444 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,528 INFO L444 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,528 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-20 00:47:16,528 INFO L444 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-20 00:47:16,528 INFO L444 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-20 00:47:16,528 INFO L444 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-20 00:47:16,529 INFO L444 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-20 00:47:16,529 INFO L444 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,529 INFO L444 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,529 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,529 INFO L444 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,529 INFO L444 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,529 INFO L444 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,530 INFO L444 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,530 INFO L444 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-20 00:47:16,530 INFO L444 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-20 00:47:16,530 INFO L444 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-20 00:47:16,530 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,530 INFO L444 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,530 INFO L444 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,530 INFO L444 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-20 00:47:16,531 INFO L444 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-20 00:47:16,531 INFO L444 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,531 INFO L444 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,531 INFO L444 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,531 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,531 INFO L444 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,531 INFO L444 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-20 00:47:16,531 INFO L444 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-20 00:47:16,532 INFO L444 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,532 INFO L444 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,532 INFO L444 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-20 00:47:16,532 INFO L444 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-20 00:47:16,532 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,532 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,532 INFO L444 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,533 INFO L444 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,533 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,533 INFO L444 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,533 INFO L444 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-20 00:47:16,533 INFO L444 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-20 00:47:16,533 INFO L444 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-20 00:47:16,533 INFO L444 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-20 00:47:16,533 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,534 INFO L444 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,534 INFO L444 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,534 INFO L444 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,534 INFO L444 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,534 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,534 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,534 INFO L444 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,535 INFO L444 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-20 00:47:16,535 INFO L444 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-20 00:47:16,535 INFO L444 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-20 00:47:16,535 INFO L444 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-20 00:47:16,535 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-20 00:47:16,535 INFO L444 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-20 00:47:16,535 INFO L444 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,535 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,536 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,536 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,536 INFO L444 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,536 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,536 INFO L444 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,536 INFO L444 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-20 00:47:16,536 INFO L444 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-20 00:47:16,537 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 00:47:16,537 INFO L444 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,537 INFO L444 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,537 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,537 INFO L444 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,537 INFO L444 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,537 INFO L444 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,537 INFO L444 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-20 00:47:16,538 INFO L444 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-20 00:47:16,538 INFO L444 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,538 INFO L444 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,538 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,538 INFO L444 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,538 INFO L444 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,538 INFO L444 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,538 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,539 INFO L444 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-20 00:47:16,539 INFO L444 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,539 INFO L444 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,539 INFO L444 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,539 INFO L444 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-20 00:47:16,539 INFO L444 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-20 00:47:16,539 INFO L444 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-20 00:47:16,540 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,540 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-20 00:47:16,540 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,540 INFO L444 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-20 00:47:16,540 INFO L444 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,540 INFO L444 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,540 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,540 INFO L444 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,541 INFO L444 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,541 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,541 INFO L444 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-20 00:47:16,541 INFO L444 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-20 00:47:16,541 INFO L444 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-20 00:47:16,541 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,541 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,541 INFO L444 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,542 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 00:47:16,542 INFO L444 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,542 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,542 INFO L444 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,542 INFO L444 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,542 INFO L444 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,542 INFO L444 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,543 INFO L444 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,543 INFO L444 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-20 00:47:16,543 INFO L444 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-20 00:47:16,543 INFO L444 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-20 00:47:16,543 INFO L444 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,543 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-20 00:47:16,543 INFO L444 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-20 00:47:16,544 INFO L444 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,544 INFO L444 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,544 INFO L444 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,544 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,544 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,544 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,544 INFO L444 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-20 00:47:16,544 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-20 00:47:16,545 INFO L444 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-20 00:47:16,545 INFO L444 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,545 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,545 INFO L444 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,546 INFO L440 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse38 (+ ~a23~0 43)) (.cse9 (= 12 ~a25~0)) (.cse0 (= ~a25~0 13))) (let ((.cse1 (<= ~a29~0 130)) (.cse35 (not .cse0)) (.cse30 (not .cse9)) (.cse27 (<= .cse38 0))) (let ((.cse34 (and .cse30 .cse27)) (.cse5 (and (and .cse1 .cse27) .cse35)) (.cse23 (= ~a4~0 1)) (.cse15 (= ~a25~0 9)) (.cse39 (<= ~a29~0 274)) (.cse17 (= 10 ~a25~0))) (let ((.cse10 (<= ~a4~0 0)) (.cse32 (and .cse39 .cse17)) (.cse21 (< 140 ~a29~0)) (.cse6 (= 1 ~a3~0)) (.cse37 (or (and (and .cse34 .cse39) .cse23) (and .cse5 .cse23) (and .cse15 .cse1 .cse27))) (.cse7 (= 15 ~a8~0)) (.cse26 (<= ~a23~0 312)) (.cse20 (<= ~a29~0 277)) (.cse3 (< 138 ~a23~0))) (let ((.cse18 (<= 261 ~a29~0)) (.cse4 (<= ~a23~0 262)) (.cse14 (<= ~a25~0 9)) (.cse22 (and (not .cse15) (or (and .cse30 .cse26 (< 0 .cse38) .cse35 .cse20) (and .cse26 .cse35 .cse20 .cse3)) (not .cse17))) (.cse31 (and .cse6 .cse37 .cse7)) (.cse11 (<= ~a23~0 600000)) (.cse12 (= ~a25~0 11)) (.cse19 (and .cse21 .cse37)) (.cse29 (<= ~a29~0 245)) (.cse33 (or .cse32 (and .cse17 .cse20 .cse3))) (.cse24 (exists ((v_~a29~0_499 Int)) (let ((.cse36 (mod v_~a29~0_499 15))) (and (<= (+ .cse36 247) ~a29~0) (< 140 v_~a29~0_499) (= .cse36 0))))) (.cse16 (<= ~a23~0 306)) (.cse2 (= 1 ~a4~0)) (.cse25 (and .cse10 .cse35 .cse20)) (.cse8 (<= (+ ~a23~0 55) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (and .cse5 .cse6 .cse7) (<= 0 (+ ~a29~0 28553)) .cse8) (and .cse5 .cse9 .cse10 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse6 .cse7) (and .cse11 (let ((.cse13 (< 277 ~a29~0))) (or (and .cse6 .cse7 .cse2 .cse12 .cse13) (and .cse6 (and .cse14 (and (exists ((v_~a29~0_500 Int)) (and (< 140 v_~a29~0_500) (<= (+ (* 2 (div (* v_~a29~0_500 10) 5)) 569818) ~a29~0))) .cse3) .cse2) .cse7) (and .cse6 (and .cse15 .cse2) .cse7 .cse13)))) (and .cse16 (and (and .cse17 .cse3) .cse2)) (and .cse16 .cse2 .cse12 .cse18) (and .cse0 .cse19) (and .cse11 (and (and (and (and .cse20 .cse3) .cse21) .cse2) .cse6 .cse7)) (and (and .cse0 .cse18 .cse3) .cse2 .cse4) (and .cse21 (and (and .cse6 .cse7 .cse22) .cse23)) (and .cse16 .cse2 .cse12 .cse3) (and .cse6 .cse7 (and .cse9 .cse24 .cse25)) (and .cse26 .cse15 .cse1 .cse3) (and .cse14 .cse19) (and (and .cse10 (and .cse15 .cse27)) (exists ((v_~a29~0_503 Int)) (let ((.cse28 (mod v_~a29~0_503 299861))) (and (<= (+ .cse28 10250) ~a29~0) (< 140 v_~a29~0_503) (= 0 .cse28)))) .cse6 .cse7) (and (and .cse0 .cse29) .cse6 .cse21 .cse7 .cse2) (and .cse30 (and (and .cse22 .cse24) .cse2) .cse16) (and .cse31 .cse8) (and .cse11 (and .cse0 .cse6 .cse7 .cse3) (<= ~a29~0 599998) .cse23) (and .cse32 .cse16 .cse2) (and .cse9 .cse31 (<= (+ ~a29~0 22) 0)) (and .cse6 .cse7 (and (or (and .cse26 .cse15) (and .cse15 .cse21 .cse20) (and .cse33 .cse21)) .cse2)) (and .cse11 .cse17 .cse6 .cse7 .cse2) (and .cse26 .cse9 .cse6 .cse7 .cse2 .cse3) (and .cse12 .cse19) (and .cse34 .cse23 .cse17) (and (or (and .cse0 .cse21 .cse29 .cse3) (or (and .cse33 .cse24) (and .cse15 .cse24 .cse20))) .cse2) (and .cse15 .cse16 .cse2) (and (and .cse9 .cse6 .cse21 .cse7 .cse25) .cse8))))))) [2019-11-20 00:47:16,546 INFO L444 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,546 INFO L444 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-20 00:47:16,546 INFO L444 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-20 00:47:16,546 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,546 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,547 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-20 00:47:16,547 INFO L444 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,547 INFO L444 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,547 INFO L444 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:47:16,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 00:47:16,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 00:47:16,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,586 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 00:47:16,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 00:47:16,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 00:47:16,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 00:47:16,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 00:47:16,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 00:47:16,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,637 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,637 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,637 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,637 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,639 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,639 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,639 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:47:16 BoogieIcfgContainer [2019-11-20 00:47:16,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:47:16,643 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:47:16,644 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:47:16,644 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:47:16,644 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:45:59" (3/4) ... [2019-11-20 00:47:16,647 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 00:47:16,681 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 00:47:16,683 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 00:47:16,737 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((a25 == 13 && a29 <= 130) && 1 == a4) && 138 < a23) && a23 <= 262) || ((((((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && 1 == a3) && 15 == a8) && 0 <= a29 + 28553) && a23 + 55 <= 0)) || (((((((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && 12 == a25) && a4 <= 0) && !(3 == input)) && 1 == a3) && 15 == a8)) || (a23 <= 600000 && ((((((1 == a3 && 15 == a8) && 1 == a4) && a25 == 11) && 277 < a29) || ((1 == a3 && (a25 <= 9 && (\exists v_~a29~0_500 : int :: 140 < v_~a29~0_500 && 2 * (v_~a29~0_500 * 10 / 5) + 569818 <= a29) && 138 < a23) && 1 == a4) && 15 == a8)) || (((1 == a3 && a25 == 9 && 1 == a4) && 15 == a8) && 277 < a29)))) || (a23 <= 306 && (10 == a25 && 138 < a23) && 1 == a4)) || (((a23 <= 306 && 1 == a4) && a25 == 11) && 261 <= a29)) || (a25 == 13 && 140 < a29 && (((((!(12 == a25) && a23 + 43 <= 0) && a29 <= 274) && a4 == 1) || (((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && a4 == 1)) || ((a25 == 9 && a29 <= 130) && a23 + 43 <= 0)))) || (a23 <= 600000 && ((((a29 <= 277 && 138 < a23) && 140 < a29) && 1 == a4) && 1 == a3) && 15 == a8)) || ((((a25 == 13 && 261 <= a29) && 138 < a23) && 1 == a4) && a23 <= 262)) || (140 < a29 && ((1 == a3 && 15 == a8) && (!(a25 == 9) && (((((!(12 == a25) && a23 <= 312) && 0 < a23 + 43) && !(a25 == 13)) && a29 <= 277) || (((a23 <= 312 && !(a25 == 13)) && a29 <= 277) && 138 < a23))) && !(10 == a25)) && a4 == 1)) || (((a23 <= 306 && 1 == a4) && a25 == 11) && 138 < a23)) || ((1 == a3 && 15 == a8) && (12 == a25 && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && (a4 <= 0 && !(a25 == 13)) && a29 <= 277)) || (((a23 <= 312 && a25 == 9) && a29 <= 130) && 138 < a23)) || (a25 <= 9 && 140 < a29 && (((((!(12 == a25) && a23 + 43 <= 0) && a29 <= 274) && a4 == 1) || (((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && a4 == 1)) || ((a25 == 9 && a29 <= 130) && a23 + 43 <= 0)))) || ((((a4 <= 0 && a25 == 9 && a23 + 43 <= 0) && (\exists v_~a29~0_503 : int :: (v_~a29~0_503 % 299861 + 10250 <= a29 && 140 < v_~a29~0_503) && 0 == v_~a29~0_503 % 299861)) && 1 == a3) && 15 == a8)) || (((((a25 == 13 && a29 <= 245) && 1 == a3) && 140 < a29) && 15 == a8) && 1 == a4)) || ((!(12 == a25) && (((!(a25 == 9) && (((((!(12 == a25) && a23 <= 312) && 0 < a23 + 43) && !(a25 == 13)) && a29 <= 277) || (((a23 <= 312 && !(a25 == 13)) && a29 <= 277) && 138 < a23))) && !(10 == a25)) && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && 1 == a4) && a23 <= 306)) || (((1 == a3 && (((((!(12 == a25) && a23 + 43 <= 0) && a29 <= 274) && a4 == 1) || (((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && a4 == 1)) || ((a25 == 9 && a29 <= 130) && a23 + 43 <= 0))) && 15 == a8) && a23 + 55 <= 0)) || (((a23 <= 600000 && ((a25 == 13 && 1 == a3) && 15 == a8) && 138 < a23) && a29 <= 599998) && a4 == 1)) || (((a29 <= 274 && 10 == a25) && a23 <= 306) && 1 == a4)) || ((12 == a25 && (1 == a3 && (((((!(12 == a25) && a23 + 43 <= 0) && a29 <= 274) && a4 == 1) || (((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && a4 == 1)) || ((a25 == 9 && a29 <= 130) && a23 + 43 <= 0))) && 15 == a8) && a29 + 22 <= 0)) || ((1 == a3 && 15 == a8) && (((a23 <= 312 && a25 == 9) || ((a25 == 9 && 140 < a29) && a29 <= 277)) || (((a29 <= 274 && 10 == a25) || ((10 == a25 && a29 <= 277) && 138 < a23)) && 140 < a29)) && 1 == a4)) || ((((a23 <= 600000 && 10 == a25) && 1 == a3) && 15 == a8) && 1 == a4)) || (((((a23 <= 312 && 12 == a25) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || (a25 == 11 && 140 < a29 && (((((!(12 == a25) && a23 + 43 <= 0) && a29 <= 274) && a4 == 1) || (((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && a4 == 1)) || ((a25 == 9 && a29 <= 130) && a23 + 43 <= 0)))) || (((!(12 == a25) && a23 + 43 <= 0) && a4 == 1) && 10 == a25)) || (((((a25 == 13 && 140 < a29) && a29 <= 245) && 138 < a23) || (((a29 <= 274 && 10 == a25) || ((10 == a25 && a29 <= 277) && 138 < a23)) && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) || ((a25 == 9 && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && a29 <= 277)) && 1 == a4)) || ((a25 == 9 && a23 <= 306) && 1 == a4)) || (((((12 == a25 && 1 == a3) && 140 < a29) && 15 == a8) && (a4 <= 0 && !(a25 == 13)) && a29 <= 277) && a23 + 55 <= 0) [2019-11-20 00:47:16,742 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((a25 == 13 && a29 <= 130) && 1 == a4) && 138 < a23) && a23 <= 262) || ((((((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && 1 == a3) && 15 == a8) && 0 <= a29 + 28553) && a23 + 55 <= 0)) || (((((((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && 12 == a25) && a4 <= 0) && !(3 == input)) && 1 == a3) && 15 == a8)) || (a23 <= 600000 && ((((((1 == a3 && 15 == a8) && 1 == a4) && a25 == 11) && 277 < a29) || ((1 == a3 && (a25 <= 9 && (\exists v_~a29~0_500 : int :: 140 < v_~a29~0_500 && 2 * (v_~a29~0_500 * 10 / 5) + 569818 <= a29) && 138 < a23) && 1 == a4) && 15 == a8)) || (((1 == a3 && a25 == 9 && 1 == a4) && 15 == a8) && 277 < a29)))) || (a23 <= 306 && (10 == a25 && 138 < a23) && 1 == a4)) || (((a23 <= 306 && 1 == a4) && a25 == 11) && 261 <= a29)) || (a25 == 13 && 140 < a29 && (((((!(12 == a25) && a23 + 43 <= 0) && a29 <= 274) && a4 == 1) || (((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && a4 == 1)) || ((a25 == 9 && a29 <= 130) && a23 + 43 <= 0)))) || (a23 <= 600000 && ((((a29 <= 277 && 138 < a23) && 140 < a29) && 1 == a4) && 1 == a3) && 15 == a8)) || ((((a25 == 13 && 261 <= a29) && 138 < a23) && 1 == a4) && a23 <= 262)) || (140 < a29 && ((1 == a3 && 15 == a8) && (!(a25 == 9) && (((((!(12 == a25) && a23 <= 312) && 0 < a23 + 43) && !(a25 == 13)) && a29 <= 277) || (((a23 <= 312 && !(a25 == 13)) && a29 <= 277) && 138 < a23))) && !(10 == a25)) && a4 == 1)) || (((a23 <= 306 && 1 == a4) && a25 == 11) && 138 < a23)) || ((1 == a3 && 15 == a8) && (12 == a25 && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && (a4 <= 0 && !(a25 == 13)) && a29 <= 277)) || (((a23 <= 312 && a25 == 9) && a29 <= 130) && 138 < a23)) || (a25 <= 9 && 140 < a29 && (((((!(12 == a25) && a23 + 43 <= 0) && a29 <= 274) && a4 == 1) || (((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && a4 == 1)) || ((a25 == 9 && a29 <= 130) && a23 + 43 <= 0)))) || ((((a4 <= 0 && a25 == 9 && a23 + 43 <= 0) && (\exists v_~a29~0_503 : int :: (v_~a29~0_503 % 299861 + 10250 <= a29 && 140 < v_~a29~0_503) && 0 == v_~a29~0_503 % 299861)) && 1 == a3) && 15 == a8)) || (((((a25 == 13 && a29 <= 245) && 1 == a3) && 140 < a29) && 15 == a8) && 1 == a4)) || ((!(12 == a25) && (((!(a25 == 9) && (((((!(12 == a25) && a23 <= 312) && 0 < a23 + 43) && !(a25 == 13)) && a29 <= 277) || (((a23 <= 312 && !(a25 == 13)) && a29 <= 277) && 138 < a23))) && !(10 == a25)) && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && 1 == a4) && a23 <= 306)) || (((1 == a3 && (((((!(12 == a25) && a23 + 43 <= 0) && a29 <= 274) && a4 == 1) || (((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && a4 == 1)) || ((a25 == 9 && a29 <= 130) && a23 + 43 <= 0))) && 15 == a8) && a23 + 55 <= 0)) || (((a23 <= 600000 && ((a25 == 13 && 1 == a3) && 15 == a8) && 138 < a23) && a29 <= 599998) && a4 == 1)) || (((a29 <= 274 && 10 == a25) && a23 <= 306) && 1 == a4)) || ((12 == a25 && (1 == a3 && (((((!(12 == a25) && a23 + 43 <= 0) && a29 <= 274) && a4 == 1) || (((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && a4 == 1)) || ((a25 == 9 && a29 <= 130) && a23 + 43 <= 0))) && 15 == a8) && a29 + 22 <= 0)) || ((1 == a3 && 15 == a8) && (((a23 <= 312 && a25 == 9) || ((a25 == 9 && 140 < a29) && a29 <= 277)) || (((a29 <= 274 && 10 == a25) || ((10 == a25 && a29 <= 277) && 138 < a23)) && 140 < a29)) && 1 == a4)) || ((((a23 <= 600000 && 10 == a25) && 1 == a3) && 15 == a8) && 1 == a4)) || (((((a23 <= 312 && 12 == a25) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || (a25 == 11 && 140 < a29 && (((((!(12 == a25) && a23 + 43 <= 0) && a29 <= 274) && a4 == 1) || (((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && a4 == 1)) || ((a25 == 9 && a29 <= 130) && a23 + 43 <= 0)))) || (((!(12 == a25) && a23 + 43 <= 0) && a4 == 1) && 10 == a25)) || (((((a25 == 13 && 140 < a29) && a29 <= 245) && 138 < a23) || (((a29 <= 274 && 10 == a25) || ((10 == a25 && a29 <= 277) && 138 < a23)) && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) || ((a25 == 9 && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && a29 <= 277)) && 1 == a4)) || ((a25 == 9 && a23 <= 306) && 1 == a4)) || (((((12 == a25 && 1 == a3) && 140 < a29) && 15 == a8) && (a4 <= 0 && !(a25 == 13)) && a29 <= 277) && a23 + 55 <= 0) [2019-11-20 00:47:16,874 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_10cfbad8-6f49-4430-8e19-b0b8c39433e1/bin/uautomizer/witness.graphml [2019-11-20 00:47:16,874 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:47:16,876 INFO L168 Benchmark]: Toolchain (without parser) took 81434.48 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 940.7 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-20 00:47:16,876 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:47:16,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1077.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-20 00:47:16,877 INFO L168 Benchmark]: Boogie Procedure Inliner took 175.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:47:16,877 INFO L168 Benchmark]: Boogie Preprocessor took 162.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:47:16,878 INFO L168 Benchmark]: RCFGBuilder took 2393.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 910.5 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:47:16,878 INFO L168 Benchmark]: TraceAbstraction took 77390.34 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 910.5 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-11-20 00:47:16,878 INFO L168 Benchmark]: Witness Printer took 230.80 ms. Allocated memory is still 4.2 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-11-20 00:47:16,880 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1077.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 175.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 162.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2393.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 910.5 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 77390.34 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 910.5 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 230.80 ms. Allocated memory is still 4.2 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 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_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 171]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-11-20 00:47:16,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 00:47:16,895 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 00:47:16,895 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 00:47:16,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 00:47:16,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,903 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,904 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,905 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((a25 == 13 && a29 <= 130) && 1 == a4) && 138 < a23) && a23 <= 262) || ((((((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && 1 == a3) && 15 == a8) && 0 <= a29 + 28553) && a23 + 55 <= 0)) || (((((((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && 12 == a25) && a4 <= 0) && !(3 == input)) && 1 == a3) && 15 == a8)) || (a23 <= 600000 && ((((((1 == a3 && 15 == a8) && 1 == a4) && a25 == 11) && 277 < a29) || ((1 == a3 && (a25 <= 9 && (\exists v_~a29~0_500 : int :: 140 < v_~a29~0_500 && 2 * (v_~a29~0_500 * 10 / 5) + 569818 <= a29) && 138 < a23) && 1 == a4) && 15 == a8)) || (((1 == a3 && a25 == 9 && 1 == a4) && 15 == a8) && 277 < a29)))) || (a23 <= 306 && (10 == a25 && 138 < a23) && 1 == a4)) || (((a23 <= 306 && 1 == a4) && a25 == 11) && 261 <= a29)) || (a25 == 13 && 140 < a29 && (((((!(12 == a25) && a23 + 43 <= 0) && a29 <= 274) && a4 == 1) || (((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && a4 == 1)) || ((a25 == 9 && a29 <= 130) && a23 + 43 <= 0)))) || (a23 <= 600000 && ((((a29 <= 277 && 138 < a23) && 140 < a29) && 1 == a4) && 1 == a3) && 15 == a8)) || ((((a25 == 13 && 261 <= a29) && 138 < a23) && 1 == a4) && a23 <= 262)) || (140 < a29 && ((1 == a3 && 15 == a8) && (!(a25 == 9) && (((((!(12 == a25) && a23 <= 312) && 0 < a23 + 43) && !(a25 == 13)) && a29 <= 277) || (((a23 <= 312 && !(a25 == 13)) && a29 <= 277) && 138 < a23))) && !(10 == a25)) && a4 == 1)) || (((a23 <= 306 && 1 == a4) && a25 == 11) && 138 < a23)) || ((1 == a3 && 15 == a8) && (12 == a25 && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && (a4 <= 0 && !(a25 == 13)) && a29 <= 277)) || (((a23 <= 312 && a25 == 9) && a29 <= 130) && 138 < a23)) || (a25 <= 9 && 140 < a29 && (((((!(12 == a25) && a23 + 43 <= 0) && a29 <= 274) && a4 == 1) || (((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && a4 == 1)) || ((a25 == 9 && a29 <= 130) && a23 + 43 <= 0)))) || ((((a4 <= 0 && a25 == 9 && a23 + 43 <= 0) && (\exists v_~a29~0_503 : int :: (v_~a29~0_503 % 299861 + 10250 <= a29 && 140 < v_~a29~0_503) && 0 == v_~a29~0_503 % 299861)) && 1 == a3) && 15 == a8)) || (((((a25 == 13 && a29 <= 245) && 1 == a3) && 140 < a29) && 15 == a8) && 1 == a4)) || ((!(12 == a25) && (((!(a25 == 9) && (((((!(12 == a25) && a23 <= 312) && 0 < a23 + 43) && !(a25 == 13)) && a29 <= 277) || (((a23 <= 312 && !(a25 == 13)) && a29 <= 277) && 138 < a23))) && !(10 == a25)) && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && 1 == a4) && a23 <= 306)) || (((1 == a3 && (((((!(12 == a25) && a23 + 43 <= 0) && a29 <= 274) && a4 == 1) || (((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && a4 == 1)) || ((a25 == 9 && a29 <= 130) && a23 + 43 <= 0))) && 15 == a8) && a23 + 55 <= 0)) || (((a23 <= 600000 && ((a25 == 13 && 1 == a3) && 15 == a8) && 138 < a23) && a29 <= 599998) && a4 == 1)) || (((a29 <= 274 && 10 == a25) && a23 <= 306) && 1 == a4)) || ((12 == a25 && (1 == a3 && (((((!(12 == a25) && a23 + 43 <= 0) && a29 <= 274) && a4 == 1) || (((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && a4 == 1)) || ((a25 == 9 && a29 <= 130) && a23 + 43 <= 0))) && 15 == a8) && a29 + 22 <= 0)) || ((1 == a3 && 15 == a8) && (((a23 <= 312 && a25 == 9) || ((a25 == 9 && 140 < a29) && a29 <= 277)) || (((a29 <= 274 && 10 == a25) || ((10 == a25 && a29 <= 277) && 138 < a23)) && 140 < a29)) && 1 == a4)) || ((((a23 <= 600000 && 10 == a25) && 1 == a3) && 15 == a8) && 1 == a4)) || (((((a23 <= 312 && 12 == a25) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || (a25 == 11 && 140 < a29 && (((((!(12 == a25) && a23 + 43 <= 0) && a29 <= 274) && a4 == 1) || (((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && a4 == 1)) || ((a25 == 9 && a29 <= 130) && a23 + 43 <= 0)))) || (((!(12 == a25) && a23 + 43 <= 0) && a4 == 1) && 10 == a25)) || (((((a25 == 13 && 140 < a29) && a29 <= 245) && 138 < a23) || (((a29 <= 274 && 10 == a25) || ((10 == a25 && a29 <= 277) && 138 < a23)) && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) || ((a25 == 9 && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && a29 <= 277)) && 1 == a4)) || ((a25 == 9 && a23 <= 306) && 1 == a4)) || (((((12 == a25 && 1 == a3) && 140 < a29) && 15 == a8) && (a4 <= 0 && !(a25 == 13)) && a29 <= 277) && a23 + 55 <= 0) - InvariantResult [Line: 22]: Loop Invariant [2019-11-20 00:47:16,908 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 00:47:16,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 00:47:16,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,909 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,910 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,911 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,912 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,913 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 00:47:16,915 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_500,QUANTIFIED] [2019-11-20 00:47:16,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,916 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,917 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,918 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-11-20 00:47:16,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,919 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,920 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:47:16,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((a25 == 13 && a29 <= 130) && 1 == a4) && 138 < a23) && a23 <= 262) || ((((((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && 1 == a3) && 15 == a8) && 0 <= a29 + 28553) && a23 + 55 <= 0)) || (((((((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && 12 == a25) && a4 <= 0) && !(3 == input)) && 1 == a3) && 15 == a8)) || (a23 <= 600000 && ((((((1 == a3 && 15 == a8) && 1 == a4) && a25 == 11) && 277 < a29) || ((1 == a3 && (a25 <= 9 && (\exists v_~a29~0_500 : int :: 140 < v_~a29~0_500 && 2 * (v_~a29~0_500 * 10 / 5) + 569818 <= a29) && 138 < a23) && 1 == a4) && 15 == a8)) || (((1 == a3 && a25 == 9 && 1 == a4) && 15 == a8) && 277 < a29)))) || (a23 <= 306 && (10 == a25 && 138 < a23) && 1 == a4)) || (((a23 <= 306 && 1 == a4) && a25 == 11) && 261 <= a29)) || (a25 == 13 && 140 < a29 && (((((!(12 == a25) && a23 + 43 <= 0) && a29 <= 274) && a4 == 1) || (((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && a4 == 1)) || ((a25 == 9 && a29 <= 130) && a23 + 43 <= 0)))) || (a23 <= 600000 && ((((a29 <= 277 && 138 < a23) && 140 < a29) && 1 == a4) && 1 == a3) && 15 == a8)) || ((((a25 == 13 && 261 <= a29) && 138 < a23) && 1 == a4) && a23 <= 262)) || (140 < a29 && ((1 == a3 && 15 == a8) && (!(a25 == 9) && (((((!(12 == a25) && a23 <= 312) && 0 < a23 + 43) && !(a25 == 13)) && a29 <= 277) || (((a23 <= 312 && !(a25 == 13)) && a29 <= 277) && 138 < a23))) && !(10 == a25)) && a4 == 1)) || (((a23 <= 306 && 1 == a4) && a25 == 11) && 138 < a23)) || ((1 == a3 && 15 == a8) && (12 == a25 && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && (a4 <= 0 && !(a25 == 13)) && a29 <= 277)) || (((a23 <= 312 && a25 == 9) && a29 <= 130) && 138 < a23)) || (a25 <= 9 && 140 < a29 && (((((!(12 == a25) && a23 + 43 <= 0) && a29 <= 274) && a4 == 1) || (((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && a4 == 1)) || ((a25 == 9 && a29 <= 130) && a23 + 43 <= 0)))) || ((((a4 <= 0 && a25 == 9 && a23 + 43 <= 0) && (\exists v_~a29~0_503 : int :: (v_~a29~0_503 % 299861 + 10250 <= a29 && 140 < v_~a29~0_503) && 0 == v_~a29~0_503 % 299861)) && 1 == a3) && 15 == a8)) || (((((a25 == 13 && a29 <= 245) && 1 == a3) && 140 < a29) && 15 == a8) && 1 == a4)) || ((!(12 == a25) && (((!(a25 == 9) && (((((!(12 == a25) && a23 <= 312) && 0 < a23 + 43) && !(a25 == 13)) && a29 <= 277) || (((a23 <= 312 && !(a25 == 13)) && a29 <= 277) && 138 < a23))) && !(10 == a25)) && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && 1 == a4) && a23 <= 306)) || (((1 == a3 && (((((!(12 == a25) && a23 + 43 <= 0) && a29 <= 274) && a4 == 1) || (((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && a4 == 1)) || ((a25 == 9 && a29 <= 130) && a23 + 43 <= 0))) && 15 == a8) && a23 + 55 <= 0)) || (((a23 <= 600000 && ((a25 == 13 && 1 == a3) && 15 == a8) && 138 < a23) && a29 <= 599998) && a4 == 1)) || (((a29 <= 274 && 10 == a25) && a23 <= 306) && 1 == a4)) || ((12 == a25 && (1 == a3 && (((((!(12 == a25) && a23 + 43 <= 0) && a29 <= 274) && a4 == 1) || (((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && a4 == 1)) || ((a25 == 9 && a29 <= 130) && a23 + 43 <= 0))) && 15 == a8) && a29 + 22 <= 0)) || ((1 == a3 && 15 == a8) && (((a23 <= 312 && a25 == 9) || ((a25 == 9 && 140 < a29) && a29 <= 277)) || (((a29 <= 274 && 10 == a25) || ((10 == a25 && a29 <= 277) && 138 < a23)) && 140 < a29)) && 1 == a4)) || ((((a23 <= 600000 && 10 == a25) && 1 == a3) && 15 == a8) && 1 == a4)) || (((((a23 <= 312 && 12 == a25) && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || (a25 == 11 && 140 < a29 && (((((!(12 == a25) && a23 + 43 <= 0) && a29 <= 274) && a4 == 1) || (((a29 <= 130 && a23 + 43 <= 0) && !(a25 == 13)) && a4 == 1)) || ((a25 == 9 && a29 <= 130) && a23 + 43 <= 0)))) || (((!(12 == a25) && a23 + 43 <= 0) && a4 == 1) && 10 == a25)) || (((((a25 == 13 && 140 < a29) && a29 <= 245) && 138 < a23) || (((a29 <= 274 && 10 == a25) || ((10 == a25 && a29 <= 277) && 138 < a23)) && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) || ((a25 == 9 && (\exists v_~a29~0_499 : int :: (v_~a29~0_499 % 15 + 247 <= a29 && 140 < v_~a29~0_499) && v_~a29~0_499 % 15 == 0)) && a29 <= 277)) && 1 == a4)) || ((a25 == 9 && a23 <= 306) && 1 == a4)) || (((((12 == a25 && 1 == a3) && 140 < a29) && 15 == a8) && (a4 <= 0 && !(a25 == 13)) && a29 <= 277) && a23 + 55 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 77.2s, OverallIterations: 23, TraceHistogramMax: 9, AutomataDifference: 37.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.3s, HoareTripleCheckerStatistics: 3448 SDtfs, 11205 SDslu, 1106 SDs, 0 SdLazy, 28939 SolverSat, 3652 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3754 GetRequests, 3654 SyntacticMatches, 6 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19574occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 35431 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 132 NumberOfFragments, 2071 HoareAnnotationTreeSize, 3 FomulaSimplifications, 147447 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 3 FomulaSimplificationsInter, 364604 FormulaSimplificationTreeSizeReductionInter, 8.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 17961 NumberOfCodeBlocks, 17961 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 17933 ConstructedInterpolants, 374 QuantifiedInterpolants, 44323805 SizeOfPredicates, 6 NumberOfNonLiveVariables, 4602 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 28 InterpolantComputations, 22 PerfectInterpolantSequences, 40486/41667 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...